/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:27:30,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:27:30,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:27:30,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:27:30,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:27:30,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:27:30,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:27:30,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:27:30,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:27:30,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:27:30,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:27:30,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:27:30,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:27:30,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:27:30,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:27:30,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:27:30,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:27:30,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:27:30,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:27:30,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:27:30,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:27:30,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:27:30,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:27:30,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:27:30,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:27:30,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:27:30,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:27:30,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:27:30,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:27:30,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:27:30,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:27:30,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:27:30,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:27:30,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:27:30,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:27:30,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:27:30,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:27:30,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:27:30,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:27:30,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:27:30,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:27:30,302 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:27:30,321 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:27:30,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:27:30,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:27:30,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:27:30,324 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:27:30,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:27:30,324 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:27:30,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:27:30,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:27:30,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:27:30,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:27:30,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:27:30,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:27:30,326 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:27:30,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:27:30,327 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:27:30,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:27:30,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:27:30,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:27:30,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:27:30,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:27:30,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:27:30,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:27:30,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:27:30,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:27:30,329 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:27:30,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:27:30,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:27:30,329 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:27:30,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:27:30,615 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:27:30,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:27:30,619 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:27:30,619 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:27:30,620 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_rmo.opt.i [2019-12-27 01:27:30,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4da14bd/f7d1e7f716314ce997892f27377862bb/FLAG7b55d63b9 [2019-12-27 01:27:31,195 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:27:31,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_rmo.opt.i [2019-12-27 01:27:31,215 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4da14bd/f7d1e7f716314ce997892f27377862bb/FLAG7b55d63b9 [2019-12-27 01:27:31,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4da14bd/f7d1e7f716314ce997892f27377862bb [2019-12-27 01:27:31,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:27:31,500 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:27:31,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:27:31,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:27:31,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:27:31,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:27:31" (1/1) ... [2019-12-27 01:27:31,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:31, skipping insertion in model container [2019-12-27 01:27:31,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:27:31" (1/1) ... [2019-12-27 01:27:31,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:27:31,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:27:32,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:27:32,111 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:27:32,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:27:32,273 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:27:32,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:32 WrapperNode [2019-12-27 01:27:32,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:27:32,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:27:32,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:27:32,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:27:32,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:32" (1/1) ... [2019-12-27 01:27:32,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:32" (1/1) ... [2019-12-27 01:27:32,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:27:32,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:27:32,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:27:32,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:27:32,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:32" (1/1) ... [2019-12-27 01:27:32,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:32" (1/1) ... [2019-12-27 01:27:32,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:32" (1/1) ... [2019-12-27 01:27:32,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:32" (1/1) ... [2019-12-27 01:27:32,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:32" (1/1) ... [2019-12-27 01:27:32,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:32" (1/1) ... [2019-12-27 01:27:32,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:32" (1/1) ... [2019-12-27 01:27:32,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:27:32,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:27:32,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:27:32,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:27:32,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:27:32,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:27:32,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:27:32,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:27:32,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:27:32,469 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:27:32,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:27:32,470 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:27:32,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:27:32,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:27:32,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:27:32,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:27:32,472 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:27:33,158 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:27:33,159 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:27:33,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:27:33 BoogieIcfgContainer [2019-12-27 01:27:33,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:27:33,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:27:33,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:27:33,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:27:33,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:27:31" (1/3) ... [2019-12-27 01:27:33,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4adb4cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:27:33, skipping insertion in model container [2019-12-27 01:27:33,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:32" (2/3) ... [2019-12-27 01:27:33,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4adb4cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:27:33, skipping insertion in model container [2019-12-27 01:27:33,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:27:33" (3/3) ... [2019-12-27 01:27:33,171 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_rmo.opt.i [2019-12-27 01:27:33,182 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:27:33,182 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:27:33,195 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:27:33,196 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:27:33,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,257 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,258 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,258 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,259 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,259 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,269 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,269 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,329 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,332 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:33,348 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 01:27:33,369 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:27:33,369 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:27:33,369 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:27:33,369 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:27:33,369 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:27:33,369 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:27:33,370 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:27:33,370 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:27:33,388 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 01:27:33,390 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 01:27:33,494 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 01:27:33,494 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:27:33,508 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 01:27:33,528 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 01:27:33,574 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 01:27:33,574 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:27:33,580 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 01:27:33,596 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 01:27:33,597 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:27:38,620 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 01:27:38,729 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 01:27:39,024 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77720 [2019-12-27 01:27:39,025 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 01:27:39,030 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 01:27:39,554 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8912 states. [2019-12-27 01:27:39,556 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states. [2019-12-27 01:27:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:27:39,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:39,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:27:39,561 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:39,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:39,566 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-27 01:27:39,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:39,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517804270] [2019-12-27 01:27:39,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:39,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517804270] [2019-12-27 01:27:39,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:39,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:27:39,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340808293] [2019-12-27 01:27:39,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:39,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:39,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:39,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:39,807 INFO L87 Difference]: Start difference. First operand 8912 states. Second operand 3 states. [2019-12-27 01:27:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:40,049 INFO L93 Difference]: Finished difference Result 8760 states and 28314 transitions. [2019-12-27 01:27:40,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:40,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:27:40,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:40,148 INFO L225 Difference]: With dead ends: 8760 [2019-12-27 01:27:40,148 INFO L226 Difference]: Without dead ends: 7798 [2019-12-27 01:27:40,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-12-27 01:27:40,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7798. [2019-12-27 01:27:40,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2019-12-27 01:27:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 25120 transitions. [2019-12-27 01:27:40,575 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 25120 transitions. Word has length 3 [2019-12-27 01:27:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:40,575 INFO L462 AbstractCegarLoop]: Abstraction has 7798 states and 25120 transitions. [2019-12-27 01:27:40,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 25120 transitions. [2019-12-27 01:27:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:27:40,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:40,582 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:40,582 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:40,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:40,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-27 01:27:40,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:40,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128021764] [2019-12-27 01:27:40,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:40,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128021764] [2019-12-27 01:27:40,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:40,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:27:40,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117524585] [2019-12-27 01:27:40,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:40,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:40,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:40,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:40,703 INFO L87 Difference]: Start difference. First operand 7798 states and 25120 transitions. Second operand 3 states. [2019-12-27 01:27:40,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:40,824 INFO L93 Difference]: Finished difference Result 1232 states and 2767 transitions. [2019-12-27 01:27:40,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:40,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 01:27:40,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:40,832 INFO L225 Difference]: With dead ends: 1232 [2019-12-27 01:27:40,832 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 01:27:40,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 01:27:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-27 01:27:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-27 01:27:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2767 transitions. [2019-12-27 01:27:40,860 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2767 transitions. Word has length 11 [2019-12-27 01:27:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:40,860 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2767 transitions. [2019-12-27 01:27:40,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2767 transitions. [2019-12-27 01:27:40,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 01:27:40,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:40,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:40,862 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:40,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:40,863 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-27 01:27:40,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:40,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412573641] [2019-12-27 01:27:40,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:41,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412573641] [2019-12-27 01:27:41,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:41,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:27:41,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553143039] [2019-12-27 01:27:41,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:27:41,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:41,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:27:41,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:27:41,027 INFO L87 Difference]: Start difference. First operand 1232 states and 2767 transitions. Second operand 5 states. [2019-12-27 01:27:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:41,348 INFO L93 Difference]: Finished difference Result 1829 states and 4038 transitions. [2019-12-27 01:27:41,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:27:41,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 01:27:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:41,359 INFO L225 Difference]: With dead ends: 1829 [2019-12-27 01:27:41,359 INFO L226 Difference]: Without dead ends: 1829 [2019-12-27 01:27:41,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:27:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-12-27 01:27:41,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1572. [2019-12-27 01:27:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-12-27 01:27:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3508 transitions. [2019-12-27 01:27:41,403 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3508 transitions. Word has length 14 [2019-12-27 01:27:41,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:41,403 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 3508 transitions. [2019-12-27 01:27:41,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:27:41,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3508 transitions. [2019-12-27 01:27:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 01:27:41,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:41,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:41,406 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:41,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:41,407 INFO L82 PathProgramCache]: Analyzing trace with hash 603755618, now seen corresponding path program 1 times [2019-12-27 01:27:41,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:41,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102444487] [2019-12-27 01:27:41,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:41,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102444487] [2019-12-27 01:27:41,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:41,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:27:41,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37433998] [2019-12-27 01:27:41,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:27:41,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:41,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:27:41,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:27:41,590 INFO L87 Difference]: Start difference. First operand 1572 states and 3508 transitions. Second operand 6 states. [2019-12-27 01:27:42,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:42,012 INFO L93 Difference]: Finished difference Result 2337 states and 5011 transitions. [2019-12-27 01:27:42,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:27:42,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 01:27:42,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:42,027 INFO L225 Difference]: With dead ends: 2337 [2019-12-27 01:27:42,027 INFO L226 Difference]: Without dead ends: 2337 [2019-12-27 01:27:42,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:27:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-12-27 01:27:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1705. [2019-12-27 01:27:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-12-27 01:27:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 3772 transitions. [2019-12-27 01:27:42,073 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 3772 transitions. Word has length 24 [2019-12-27 01:27:42,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:42,074 INFO L462 AbstractCegarLoop]: Abstraction has 1705 states and 3772 transitions. [2019-12-27 01:27:42,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:27:42,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 3772 transitions. [2019-12-27 01:27:42,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 01:27:42,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:42,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:42,077 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:42,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:42,077 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-27 01:27:42,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:42,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308780676] [2019-12-27 01:27:42,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:42,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308780676] [2019-12-27 01:27:42,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:42,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:27:42,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978447631] [2019-12-27 01:27:42,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:42,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:42,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:42,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:42,168 INFO L87 Difference]: Start difference. First operand 1705 states and 3772 transitions. Second operand 3 states. [2019-12-27 01:27:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:42,179 INFO L93 Difference]: Finished difference Result 1704 states and 3770 transitions. [2019-12-27 01:27:42,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:42,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 01:27:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:42,188 INFO L225 Difference]: With dead ends: 1704 [2019-12-27 01:27:42,188 INFO L226 Difference]: Without dead ends: 1704 [2019-12-27 01:27:42,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2019-12-27 01:27:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1704. [2019-12-27 01:27:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-27 01:27:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3770 transitions. [2019-12-27 01:27:42,221 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3770 transitions. Word has length 26 [2019-12-27 01:27:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:42,221 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3770 transitions. [2019-12-27 01:27:42,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3770 transitions. [2019-12-27 01:27:42,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:27:42,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:42,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:42,224 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:42,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:42,224 INFO L82 PathProgramCache]: Analyzing trace with hash -691470702, now seen corresponding path program 1 times [2019-12-27 01:27:42,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:42,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762442013] [2019-12-27 01:27:42,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:42,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762442013] [2019-12-27 01:27:42,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:42,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:27:42,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103706297] [2019-12-27 01:27:42,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:27:42,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:42,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:27:42,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:27:42,281 INFO L87 Difference]: Start difference. First operand 1704 states and 3770 transitions. Second operand 4 states. [2019-12-27 01:27:42,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:42,307 INFO L93 Difference]: Finished difference Result 2700 states and 6022 transitions. [2019-12-27 01:27:42,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:27:42,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-27 01:27:42,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:42,321 INFO L225 Difference]: With dead ends: 2700 [2019-12-27 01:27:42,321 INFO L226 Difference]: Without dead ends: 1250 [2019-12-27 01:27:42,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:27:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2019-12-27 01:27:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1233. [2019-12-27 01:27:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-12-27 01:27:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 2691 transitions. [2019-12-27 01:27:42,349 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 2691 transitions. Word has length 27 [2019-12-27 01:27:42,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:42,349 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 2691 transitions. [2019-12-27 01:27:42,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:27:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 2691 transitions. [2019-12-27 01:27:42,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:27:42,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:42,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:42,352 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:42,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:42,352 INFO L82 PathProgramCache]: Analyzing trace with hash -250638352, now seen corresponding path program 2 times [2019-12-27 01:27:42,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:42,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977499727] [2019-12-27 01:27:42,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:42,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977499727] [2019-12-27 01:27:42,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:42,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:27:42,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741836294] [2019-12-27 01:27:42,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:27:42,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:42,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:27:42,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:27:42,460 INFO L87 Difference]: Start difference. First operand 1233 states and 2691 transitions. Second operand 5 states. [2019-12-27 01:27:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:42,969 INFO L93 Difference]: Finished difference Result 1899 states and 4075 transitions. [2019-12-27 01:27:42,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:27:42,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 01:27:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:42,979 INFO L225 Difference]: With dead ends: 1899 [2019-12-27 01:27:42,979 INFO L226 Difference]: Without dead ends: 1899 [2019-12-27 01:27:42,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:27:42,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2019-12-27 01:27:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1704. [2019-12-27 01:27:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-27 01:27:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3701 transitions. [2019-12-27 01:27:43,018 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3701 transitions. Word has length 27 [2019-12-27 01:27:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:43,019 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3701 transitions. [2019-12-27 01:27:43,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:27:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3701 transitions. [2019-12-27 01:27:43,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:27:43,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:43,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:43,022 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:43,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:43,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 1 times [2019-12-27 01:27:43,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:43,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715832424] [2019-12-27 01:27:43,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:43,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715832424] [2019-12-27 01:27:43,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:43,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:27:43,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442407299] [2019-12-27 01:27:43,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:27:43,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:43,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:27:43,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:27:43,065 INFO L87 Difference]: Start difference. First operand 1704 states and 3701 transitions. Second operand 4 states. [2019-12-27 01:27:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:43,078 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-12-27 01:27:43,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:27:43,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 01:27:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:43,081 INFO L225 Difference]: With dead ends: 921 [2019-12-27 01:27:43,081 INFO L226 Difference]: Without dead ends: 824 [2019-12-27 01:27:43,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:27:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-27 01:27:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-12-27 01:27:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-27 01:27:43,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-12-27 01:27:43,096 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-12-27 01:27:43,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:43,097 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-12-27 01:27:43,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:27:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-12-27 01:27:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 01:27:43,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:43,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:43,099 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:43,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:43,100 INFO L82 PathProgramCache]: Analyzing trace with hash -317989854, now seen corresponding path program 1 times [2019-12-27 01:27:43,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:43,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223012106] [2019-12-27 01:27:43,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:43,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:43,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223012106] [2019-12-27 01:27:43,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:43,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:27:43,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688965132] [2019-12-27 01:27:43,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:27:43,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:43,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:27:43,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:27:43,187 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 7 states. [2019-12-27 01:27:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:43,404 INFO L93 Difference]: Finished difference Result 1342 states and 2781 transitions. [2019-12-27 01:27:43,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:27:43,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-27 01:27:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:43,409 INFO L225 Difference]: With dead ends: 1342 [2019-12-27 01:27:43,409 INFO L226 Difference]: Without dead ends: 903 [2019-12-27 01:27:43,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:27:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-27 01:27:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 773. [2019-12-27 01:27:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-27 01:27:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1630 transitions. [2019-12-27 01:27:43,433 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1630 transitions. Word has length 50 [2019-12-27 01:27:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:43,433 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1630 transitions. [2019-12-27 01:27:43,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:27:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1630 transitions. [2019-12-27 01:27:43,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 01:27:43,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:43,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:43,440 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:43,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:43,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1216040192, now seen corresponding path program 2 times [2019-12-27 01:27:43,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:43,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802613726] [2019-12-27 01:27:43,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:43,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:43,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802613726] [2019-12-27 01:27:43,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:43,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:27:43,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129270052] [2019-12-27 01:27:43,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:27:43,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:43,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:27:43,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:27:43,601 INFO L87 Difference]: Start difference. First operand 773 states and 1630 transitions. Second operand 7 states. [2019-12-27 01:27:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:44,335 INFO L93 Difference]: Finished difference Result 1033 states and 2141 transitions. [2019-12-27 01:27:44,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:27:44,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-27 01:27:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:44,339 INFO L225 Difference]: With dead ends: 1033 [2019-12-27 01:27:44,339 INFO L226 Difference]: Without dead ends: 1027 [2019-12-27 01:27:44,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:27:44,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-12-27 01:27:44,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 827. [2019-12-27 01:27:44,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-12-27 01:27:44,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1729 transitions. [2019-12-27 01:27:44,356 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1729 transitions. Word has length 50 [2019-12-27 01:27:44,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:44,357 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1729 transitions. [2019-12-27 01:27:44,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:27:44,357 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1729 transitions. [2019-12-27 01:27:44,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 01:27:44,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:44,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:44,360 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:44,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:44,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1826446246, now seen corresponding path program 3 times [2019-12-27 01:27:44,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:44,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13892423] [2019-12-27 01:27:44,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:44,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13892423] [2019-12-27 01:27:44,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:44,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:27:44,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708598595] [2019-12-27 01:27:44,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:44,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:44,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:44,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:44,428 INFO L87 Difference]: Start difference. First operand 827 states and 1729 transitions. Second operand 3 states. [2019-12-27 01:27:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:44,489 INFO L93 Difference]: Finished difference Result 1100 states and 2305 transitions. [2019-12-27 01:27:44,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:44,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 01:27:44,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:44,493 INFO L225 Difference]: With dead ends: 1100 [2019-12-27 01:27:44,493 INFO L226 Difference]: Without dead ends: 1100 [2019-12-27 01:27:44,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:44,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2019-12-27 01:27:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 884. [2019-12-27 01:27:44,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-12-27 01:27:44,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1865 transitions. [2019-12-27 01:27:44,511 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1865 transitions. Word has length 50 [2019-12-27 01:27:44,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:44,513 INFO L462 AbstractCegarLoop]: Abstraction has 884 states and 1865 transitions. [2019-12-27 01:27:44,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:44,514 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1865 transitions. [2019-12-27 01:27:44,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 01:27:44,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:44,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:44,517 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:44,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:44,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1408508718, now seen corresponding path program 1 times [2019-12-27 01:27:44,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:44,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477463030] [2019-12-27 01:27:44,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:44,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477463030] [2019-12-27 01:27:44,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:44,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:27:44,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468705162] [2019-12-27 01:27:44,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:44,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:44,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:44,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:44,637 INFO L87 Difference]: Start difference. First operand 884 states and 1865 transitions. Second operand 3 states. [2019-12-27 01:27:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:44,649 INFO L93 Difference]: Finished difference Result 883 states and 1863 transitions. [2019-12-27 01:27:44,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:44,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 01:27:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:44,652 INFO L225 Difference]: With dead ends: 883 [2019-12-27 01:27:44,652 INFO L226 Difference]: Without dead ends: 883 [2019-12-27 01:27:44,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-12-27 01:27:44,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 789. [2019-12-27 01:27:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-27 01:27:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1685 transitions. [2019-12-27 01:27:44,668 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1685 transitions. Word has length 51 [2019-12-27 01:27:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:44,668 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1685 transitions. [2019-12-27 01:27:44,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1685 transitions. [2019-12-27 01:27:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 01:27:44,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:44,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:44,671 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:44,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:44,671 INFO L82 PathProgramCache]: Analyzing trace with hash 355104308, now seen corresponding path program 1 times [2019-12-27 01:27:44,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:44,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622170591] [2019-12-27 01:27:44,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:27:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:27:44,829 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:27:44,829 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:27:44,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_27|) |v_ULTIMATE.start_main_~#t315~0.offset_19| 0))) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t315~0.base_27| 4)) (< 0 |v_#StackHeapBarrier_15|) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t315~0.base_27| 1)) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t315~0.base_27|) 0) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= v_~x~0_99 0) (= 0 |v_ULTIMATE.start_main_~#t315~0.offset_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t315~0.base_27|) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t315~0.offset=|v_ULTIMATE.start_main_~#t315~0.offset_19|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_28|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ULTIMATE.start_main_~#t315~0.base=|v_ULTIMATE.start_main_~#t315~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t315~0.offset, ULTIMATE.start_main_~#t316~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t315~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t316~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 01:27:44,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t316~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t316~0.base_10|)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10|) |v_ULTIMATE.start_main_~#t316~0.offset_9| 1)) |v_#memory_int_5|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t316~0.base_10| 4)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t316~0.base_10|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t316~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t316~0.offset] because there is no mapped edge [2019-12-27 01:27:44,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~y$r_buff1_thd0~0_Out855528678 ~y$r_buff0_thd0~0_In855528678) (= ~y$r_buff0_thd1~0_In855528678 ~y$r_buff1_thd1~0_Out855528678) (= 1 ~y$r_buff0_thd1~0_Out855528678) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In855528678 0)) (= ~x~0_In855528678 ~__unbuffered_p0_EAX~0_Out855528678) (= ~y$r_buff0_thd2~0_In855528678 ~y$r_buff1_thd2~0_Out855528678)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In855528678, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In855528678, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In855528678, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In855528678, ~x~0=~x~0_In855528678} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out855528678, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out855528678, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out855528678, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In855528678, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out855528678, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In855528678, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In855528678, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out855528678, ~x~0=~x~0_In855528678} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 01:27:44,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1729852578 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1729852578 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1729852578| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1729852578| ~y$w_buff0_used~0_In1729852578) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1729852578, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1729852578} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1729852578|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1729852578, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1729852578} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 01:27:44,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In831481701 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In831481701 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In831481701 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In831481701 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In831481701 |P0Thread1of1ForFork0_#t~ite6_Out831481701|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out831481701|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In831481701, ~y$w_buff0_used~0=~y$w_buff0_used~0_In831481701, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In831481701, ~y$w_buff1_used~0=~y$w_buff1_used~0_In831481701} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out831481701|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In831481701, ~y$w_buff0_used~0=~y$w_buff0_used~0_In831481701, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In831481701, ~y$w_buff1_used~0=~y$w_buff1_used~0_In831481701} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 01:27:44,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In93276638 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In93276638 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out93276638 ~y$r_buff0_thd1~0_In93276638) (or .cse0 .cse1)) (and (not .cse0) (= ~y$r_buff0_thd1~0_Out93276638 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In93276638, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In93276638} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In93276638, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out93276638|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out93276638} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:27:44,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In1447285907 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1447285907 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1447285907 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1447285907 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In1447285907 |P0Thread1of1ForFork0_#t~ite8_Out1447285907|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1447285907|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1447285907, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1447285907, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1447285907, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1447285907} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1447285907, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1447285907, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1447285907|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1447285907, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1447285907} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 01:27:44,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:27:44,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2143955866 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In-2143955866| |P1Thread1of1ForFork1_#t~ite17_Out-2143955866|) (= ~y$w_buff1~0_In-2143955866 |P1Thread1of1ForFork1_#t~ite18_Out-2143955866|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2143955866 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-2143955866 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-2143955866 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-2143955866 256)))) (= |P1Thread1of1ForFork1_#t~ite17_Out-2143955866| |P1Thread1of1ForFork1_#t~ite18_Out-2143955866|) (= |P1Thread1of1ForFork1_#t~ite17_Out-2143955866| ~y$w_buff1~0_In-2143955866) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2143955866, ~y$w_buff1~0=~y$w_buff1~0_In-2143955866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2143955866, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2143955866, ~weak$$choice2~0=~weak$$choice2~0_In-2143955866, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-2143955866|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2143955866} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2143955866, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-2143955866|, ~y$w_buff1~0=~y$w_buff1~0_In-2143955866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2143955866, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2143955866, ~weak$$choice2~0=~weak$$choice2~0_In-2143955866, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-2143955866|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2143955866} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 01:27:44,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-565280119 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-565280119| |P1Thread1of1ForFork1_#t~ite20_Out-565280119|) (= ~y$w_buff0_used~0_In-565280119 |P1Thread1of1ForFork1_#t~ite20_Out-565280119|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-565280119 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-565280119 256)) .cse0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-565280119 256)) .cse0) (= (mod ~y$w_buff0_used~0_In-565280119 256) 0))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite20_In-565280119| |P1Thread1of1ForFork1_#t~ite20_Out-565280119|) (= |P1Thread1of1ForFork1_#t~ite21_Out-565280119| ~y$w_buff0_used~0_In-565280119) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-565280119, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-565280119, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-565280119|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-565280119, ~weak$$choice2~0=~weak$$choice2~0_In-565280119, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-565280119} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-565280119, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-565280119, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-565280119|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-565280119, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-565280119|, ~weak$$choice2~0=~weak$$choice2~0_In-565280119, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-565280119} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 01:27:44,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In179582047 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In179582047 256))) (.cse4 (= (mod ~y$w_buff1_used~0_In179582047 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out179582047| |P1Thread1of1ForFork1_#t~ite24_Out179582047|)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In179582047 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In179582047 256) 0))) (or (and (or (and (= ~y$w_buff1_used~0_In179582047 |P1Thread1of1ForFork1_#t~ite24_Out179582047|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_Out179582047| |P1Thread1of1ForFork1_#t~ite23_In179582047|)) (and (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2)) .cse0 .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out179582047| ~y$w_buff1_used~0_In179582047))) (= |P1Thread1of1ForFork1_#t~ite22_In179582047| |P1Thread1of1ForFork1_#t~ite22_Out179582047|)) (let ((.cse6 (not .cse2))) (and (= |P1Thread1of1ForFork1_#t~ite22_Out179582047| 0) (= |P1Thread1of1ForFork1_#t~ite23_Out179582047| |P1Thread1of1ForFork1_#t~ite22_Out179582047|) .cse0 (or .cse6 (not .cse1)) (or .cse6 (not .cse4)) .cse5 (not .cse3))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In179582047, ~y$w_buff0_used~0=~y$w_buff0_used~0_In179582047, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In179582047, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In179582047|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In179582047|, ~weak$$choice2~0=~weak$$choice2~0_In179582047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In179582047} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In179582047, ~y$w_buff0_used~0=~y$w_buff0_used~0_In179582047, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In179582047, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out179582047|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out179582047|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out179582047|, ~weak$$choice2~0=~weak$$choice2~0_In179582047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In179582047} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 01:27:44,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_25|) (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_25|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_22|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_24|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_20|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_35|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_28|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 01:27:44,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-943862196 256)))) (or (let ((.cse0 (not (= 0 (mod ~y$r_buff0_thd2~0_In-943862196 256))))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-943862196| |P1Thread1of1ForFork1_#t~ite28_Out-943862196|) (or (not (= (mod ~y$w_buff1_used~0_In-943862196 256) 0)) .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-943862196|) (= |P1Thread1of1ForFork1_#t~ite29_Out-943862196| |P1Thread1of1ForFork1_#t~ite30_Out-943862196|) (not (= (mod ~y$w_buff0_used~0_In-943862196 256) 0)) (or (not (= 0 (mod ~y$r_buff1_thd2~0_In-943862196 256))) .cse0) .cse1)) (and (= ~y$r_buff1_thd2~0_In-943862196 |P1Thread1of1ForFork1_#t~ite30_Out-943862196|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In-943862196| |P1Thread1of1ForFork1_#t~ite29_Out-943862196|) (= |P1Thread1of1ForFork1_#t~ite28_In-943862196| |P1Thread1of1ForFork1_#t~ite28_Out-943862196|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-943862196, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-943862196|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-943862196, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-943862196, ~weak$$choice2~0=~weak$$choice2~0_In-943862196, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-943862196|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-943862196} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-943862196, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-943862196|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-943862196|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-943862196, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-943862196, ~weak$$choice2~0=~weak$$choice2~0_In-943862196, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-943862196|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-943862196} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 01:27:44,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 01:27:44,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-687881970 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-687881970 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out-687881970| |P1Thread1of1ForFork1_#t~ite33_Out-687881970|))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out-687881970| ~y~0_In-687881970) (or .cse1 .cse2)) (and (not .cse1) (not .cse2) .cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out-687881970| ~y$w_buff1~0_In-687881970)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-687881970, ~y$w_buff1~0=~y$w_buff1~0_In-687881970, ~y~0=~y~0_In-687881970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-687881970} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-687881970, ~y$w_buff1~0=~y$w_buff1~0_In-687881970, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-687881970|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-687881970|, ~y~0=~y~0_In-687881970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-687881970} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 01:27:44,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1643471460 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1643471460 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1643471460|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1643471460 |P1Thread1of1ForFork1_#t~ite34_Out-1643471460|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1643471460, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1643471460} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1643471460, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1643471460, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1643471460|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 01:27:44,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1437709424 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1437709424 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1437709424 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1437709424 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-1437709424| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-1437709424| ~y$w_buff1_used~0_In-1437709424)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1437709424, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1437709424, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1437709424, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1437709424} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1437709424, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1437709424, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1437709424, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1437709424|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1437709424} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 01:27:44,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In595429096 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In595429096 256)))) (or (and (= ~y$r_buff0_thd2~0_In595429096 |P1Thread1of1ForFork1_#t~ite36_Out595429096|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out595429096| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In595429096, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In595429096} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In595429096, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In595429096, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out595429096|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 01:27:44,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In816929958 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In816929958 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In816929958 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In816929958 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out816929958|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In816929958 |P1Thread1of1ForFork1_#t~ite37_Out816929958|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In816929958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In816929958, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In816929958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In816929958} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In816929958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In816929958, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In816929958, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out816929958|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In816929958} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 01:27:44,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_34|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_33|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 01:27:44,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (= 2 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 01:27:44,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1641679522 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1641679522 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1641679522| ~y~0_In1641679522) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1641679522| ~y$w_buff1~0_In1641679522)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1641679522, ~y~0=~y~0_In1641679522, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1641679522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1641679522} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1641679522|, ~y$w_buff1~0=~y$w_buff1~0_In1641679522, ~y~0=~y~0_In1641679522, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1641679522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1641679522} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 01:27:44,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 01:27:44,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1782993610 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1782993610 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out1782993610|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1782993610 |ULTIMATE.start_main_#t~ite42_Out1782993610|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1782993610, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1782993610} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1782993610, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1782993610, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1782993610|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 01:27:44,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1586057590 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1586057590 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1586057590 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1586057590 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-1586057590| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1586057590| ~y$w_buff1_used~0_In-1586057590) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1586057590, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1586057590, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1586057590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1586057590} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1586057590, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1586057590, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1586057590|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1586057590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1586057590} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 01:27:44,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1762214237 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1762214237 256)))) (or (and (= ~y$r_buff0_thd0~0_In1762214237 |ULTIMATE.start_main_#t~ite44_Out1762214237|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1762214237| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1762214237, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1762214237} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1762214237, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1762214237, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1762214237|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 01:27:44,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-835799024 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-835799024 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-835799024 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-835799024 256) 0))) (or (and (= ~y$r_buff1_thd0~0_In-835799024 |ULTIMATE.start_main_#t~ite45_Out-835799024|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-835799024|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-835799024, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-835799024, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-835799024, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-835799024} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-835799024, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-835799024, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-835799024, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-835799024|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-835799024} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 01:27:44,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_28 0) (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:27:44,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:27:44 BasicIcfg [2019-12-27 01:27:44,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:27:44,990 INFO L168 Benchmark]: Toolchain (without parser) took 13489.26 ms. Allocated memory was 140.0 MB in the beginning and 434.1 MB in the end (delta: 294.1 MB). Free memory was 99.9 MB in the beginning and 235.1 MB in the end (delta: -135.2 MB). Peak memory consumption was 159.0 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:44,994 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 01:27:44,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.86 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 99.7 MB in the beginning and 158.4 MB in the end (delta: -58.7 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:44,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.22 ms. Allocated memory is still 203.9 MB. Free memory was 158.4 MB in the beginning and 155.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:44,997 INFO L168 Benchmark]: Boogie Preprocessor took 57.46 ms. Allocated memory is still 203.9 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:45,000 INFO L168 Benchmark]: RCFGBuilder took 753.08 ms. Allocated memory is still 203.9 MB. Free memory was 153.0 MB in the beginning and 109.2 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:45,006 INFO L168 Benchmark]: TraceAbstraction took 11825.09 ms. Allocated memory was 203.9 MB in the beginning and 434.1 MB in the end (delta: 230.2 MB). Free memory was 108.5 MB in the beginning and 235.1 MB in the end (delta: -126.5 MB). Peak memory consumption was 103.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:45,013 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 773.86 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 99.7 MB in the beginning and 158.4 MB in the end (delta: -58.7 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.22 ms. Allocated memory is still 203.9 MB. Free memory was 158.4 MB in the beginning and 155.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.46 ms. Allocated memory is still 203.9 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 753.08 ms. Allocated memory is still 203.9 MB. Free memory was 153.0 MB in the beginning and 109.2 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11825.09 ms. Allocated memory was 203.9 MB in the beginning and 434.1 MB in the end (delta: 230.2 MB). Free memory was 108.5 MB in the beginning and 235.1 MB in the end (delta: -126.5 MB). Peak memory consumption was 103.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 148 ProgramPointsBefore, 75 ProgramPointsAfterwards, 182 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 4966 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 167 SemBasedMoverChecksPositive, 218 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 77720 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1452 SDtfs, 1228 SDslu, 2594 SDs, 0 SdLazy, 1621 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8912occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 1783 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 349 ConstructedInterpolants, 0 QuantifiedInterpolants, 40981 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...