/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/mix034_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:13:00,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:13:00,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:13:00,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:13:00,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:13:00,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:13:00,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:13:00,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:13:00,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:13:00,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:13:00,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:13:00,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:13:00,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:13:00,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:13:00,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:13:00,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:13:00,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:13:00,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:13:00,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:13:00,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:13:00,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:13:00,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:13:00,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:13:00,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:13:00,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:13:00,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:13:00,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:13:00,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:13:00,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:13:00,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:13:00,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:13:00,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:13:00,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:13:00,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:13:00,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:13:00,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:13:00,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:13:00,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:13:00,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:13:00,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:13:00,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:13:00,399 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-18 17:13:00,412 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:13:00,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:13:00,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:13:00,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:13:00,414 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:13:00,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:13:00,415 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:13:00,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:13:00,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:13:00,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:13:00,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:13:00,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:13:00,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:13:00,416 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:13:00,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:13:00,416 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:13:00,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:13:00,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:13:00,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:13:00,417 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:13:00,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:13:00,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:13:00,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:13:00,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:13:00,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:13:00,418 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:13:00,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:13:00,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:13:00,419 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:13:00,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:13:00,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:13:00,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:13:00,709 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:13:00,710 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:13:00,710 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.opt.i [2019-12-18 17:13:00,773 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9cf7812d/1cc58c96647945799a6d0711be48ca16/FLAG398974a96 [2019-12-18 17:13:01,364 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:13:01,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.opt.i [2019-12-18 17:13:01,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9cf7812d/1cc58c96647945799a6d0711be48ca16/FLAG398974a96 [2019-12-18 17:13:01,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9cf7812d/1cc58c96647945799a6d0711be48ca16 [2019-12-18 17:13:01,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:13:01,614 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:13:01,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:13:01,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:13:01,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:13:01,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:13:01" (1/1) ... [2019-12-18 17:13:01,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca8f980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:01, skipping insertion in model container [2019-12-18 17:13:01,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:13:01" (1/1) ... [2019-12-18 17:13:01,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:13:01,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:13:02,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:13:02,234 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:13:02,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:13:02,379 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:13:02,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:02 WrapperNode [2019-12-18 17:13:02,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:13:02,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:13:02,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:13:02,381 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:13:02,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:02" (1/1) ... [2019-12-18 17:13:02,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:02" (1/1) ... [2019-12-18 17:13:02,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:13:02,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:13:02,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:13:02,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:13:02,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:02" (1/1) ... [2019-12-18 17:13:02,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:02" (1/1) ... [2019-12-18 17:13:02,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:02" (1/1) ... [2019-12-18 17:13:02,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:02" (1/1) ... [2019-12-18 17:13:02,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:02" (1/1) ... [2019-12-18 17:13:02,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:02" (1/1) ... [2019-12-18 17:13:02,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:02" (1/1) ... [2019-12-18 17:13:02,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:13:02,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:13:02,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:13:02,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:13:02,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:02" (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-18 17:13:02,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:13:02,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:13:02,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:13:02,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:13:02,541 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:13:02,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:13:02,541 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:13:02,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:13:02,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:13:02,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:13:02,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:13:02,544 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:13:03,297 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:13:03,298 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:13:03,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:13:03 BoogieIcfgContainer [2019-12-18 17:13:03,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:13:03,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:13:03,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:13:03,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:13:03,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:13:01" (1/3) ... [2019-12-18 17:13:03,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7caab5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:13:03, skipping insertion in model container [2019-12-18 17:13:03,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:02" (2/3) ... [2019-12-18 17:13:03,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7caab5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:13:03, skipping insertion in model container [2019-12-18 17:13:03,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:13:03" (3/3) ... [2019-12-18 17:13:03,313 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_power.opt.i [2019-12-18 17:13:03,323 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:13:03,324 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:13:03,332 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:13:03,333 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:13:03,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,374 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,374 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,374 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,375 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,375 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,385 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,385 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,419 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,419 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,437 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,445 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,447 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:03,464 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 17:13:03,485 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:13:03,485 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:13:03,485 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:13:03,485 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:13:03,486 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:13:03,486 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:13:03,486 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:13:03,486 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:13:03,511 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-18 17:13:03,513 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-18 17:13:03,627 INFO L126 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-18 17:13:03,628 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:13:03,650 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 17:13:03,672 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-18 17:13:03,745 INFO L126 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-18 17:13:03,746 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:13:03,755 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 17:13:03,772 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 17:13:03,773 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:13:08,635 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 17:13:08,788 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 17:13:09,092 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-12-18 17:13:09,092 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 17:13:09,096 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-18 17:13:09,610 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-12-18 17:13:09,612 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-12-18 17:13:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 17:13:09,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:09,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 17:13:09,620 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:09,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:09,626 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-12-18 17:13:09,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:09,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232719738] [2019-12-18 17:13:09,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:09,938 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-18 17:13:09,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232719738] [2019-12-18 17:13:09,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:09,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:13:09,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692519452] [2019-12-18 17:13:09,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:09,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:09,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:09,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:09,962 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-12-18 17:13:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:10,350 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-12-18 17:13:10,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:10,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 17:13:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:10,447 INFO L225 Difference]: With dead ends: 8598 [2019-12-18 17:13:10,447 INFO L226 Difference]: Without dead ends: 7662 [2019-12-18 17:13:10,449 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-18 17:13:10,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-12-18 17:13:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-12-18 17:13:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-12-18 17:13:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-12-18 17:13:10,871 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-12-18 17:13:10,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:10,872 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-12-18 17:13:10,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-12-18 17:13:10,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:13:10,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:10,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:10,879 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:10,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:10,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-12-18 17:13:10,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:10,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176155219] [2019-12-18 17:13:10,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:10,975 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-18 17:13:10,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176155219] [2019-12-18 17:13:10,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:10,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:13:10,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468862948] [2019-12-18 17:13:10,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:10,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:10,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:10,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:10,979 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 3 states. [2019-12-18 17:13:11,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:11,028 INFO L93 Difference]: Finished difference Result 1232 states and 2811 transitions. [2019-12-18 17:13:11,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:11,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 17:13:11,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:11,038 INFO L225 Difference]: With dead ends: 1232 [2019-12-18 17:13:11,038 INFO L226 Difference]: Without dead ends: 1232 [2019-12-18 17:13:11,040 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-18 17:13:11,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-18 17:13:11,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-18 17:13:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-18 17:13:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2811 transitions. [2019-12-18 17:13:11,082 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2811 transitions. Word has length 11 [2019-12-18 17:13:11,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:11,083 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2811 transitions. [2019-12-18 17:13:11,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2811 transitions. [2019-12-18 17:13:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:13:11,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:11,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:11,094 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:11,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:11,094 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-12-18 17:13:11,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:11,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615019676] [2019-12-18 17:13:11,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:11,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-18 17:13:11,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615019676] [2019-12-18 17:13:11,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:11,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:13:11,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078592014] [2019-12-18 17:13:11,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:11,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:11,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:11,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:11,188 INFO L87 Difference]: Start difference. First operand 1232 states and 2811 transitions. Second operand 3 states. [2019-12-18 17:13:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:11,271 INFO L93 Difference]: Finished difference Result 1943 states and 4408 transitions. [2019-12-18 17:13:11,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:11,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 17:13:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:11,283 INFO L225 Difference]: With dead ends: 1943 [2019-12-18 17:13:11,283 INFO L226 Difference]: Without dead ends: 1943 [2019-12-18 17:13:11,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 17:13:11,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-12-18 17:13:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1365. [2019-12-18 17:13:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-18 17:13:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3186 transitions. [2019-12-18 17:13:11,335 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3186 transitions. Word has length 14 [2019-12-18 17:13:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:11,336 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3186 transitions. [2019-12-18 17:13:11,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3186 transitions. [2019-12-18 17:13:11,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:13:11,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:11,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:11,338 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:11,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:11,338 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-12-18 17:13:11,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:11,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424452457] [2019-12-18 17:13:11,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:11,401 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-18 17:13:11,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424452457] [2019-12-18 17:13:11,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:11,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:13:11,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10574953] [2019-12-18 17:13:11,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:13:11,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:11,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:13:11,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:13:11,406 INFO L87 Difference]: Start difference. First operand 1365 states and 3186 transitions. Second operand 4 states. [2019-12-18 17:13:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:11,619 INFO L93 Difference]: Finished difference Result 1724 states and 3916 transitions. [2019-12-18 17:13:11,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:13:11,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:13:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:11,632 INFO L225 Difference]: With dead ends: 1724 [2019-12-18 17:13:11,632 INFO L226 Difference]: Without dead ends: 1724 [2019-12-18 17:13:11,633 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-18 17:13:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-18 17:13:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1660. [2019-12-18 17:13:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-12-18 17:13:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 3792 transitions. [2019-12-18 17:13:11,690 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 3792 transitions. Word has length 14 [2019-12-18 17:13:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:11,690 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 3792 transitions. [2019-12-18 17:13:11,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:13:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 3792 transitions. [2019-12-18 17:13:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:13:11,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:11,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:11,794 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:11,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:11,794 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-12-18 17:13:11,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:11,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148222217] [2019-12-18 17:13:11,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:11,834 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-18 17:13:11,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148222217] [2019-12-18 17:13:11,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:11,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:13:11,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24897332] [2019-12-18 17:13:11,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:13:11,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:11,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:13:11,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:13:11,836 INFO L87 Difference]: Start difference. First operand 1660 states and 3792 transitions. Second operand 4 states. [2019-12-18 17:13:12,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:12,019 INFO L93 Difference]: Finished difference Result 1991 states and 4482 transitions. [2019-12-18 17:13:12,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:13:12,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:13:12,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:12,032 INFO L225 Difference]: With dead ends: 1991 [2019-12-18 17:13:12,032 INFO L226 Difference]: Without dead ends: 1991 [2019-12-18 17:13:12,032 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-18 17:13:12,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-18 17:13:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1731. [2019-12-18 17:13:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-12-18 17:13:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3946 transitions. [2019-12-18 17:13:12,080 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 3946 transitions. Word has length 14 [2019-12-18 17:13:12,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:12,081 INFO L462 AbstractCegarLoop]: Abstraction has 1731 states and 3946 transitions. [2019-12-18 17:13:12,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:13:12,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3946 transitions. [2019-12-18 17:13:12,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 17:13:12,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:12,085 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-18 17:13:12,085 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:12,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:12,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-12-18 17:13:12,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:12,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403271345] [2019-12-18 17:13:12,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:12,193 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-18 17:13:12,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403271345] [2019-12-18 17:13:12,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:12,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:13:12,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797459372] [2019-12-18 17:13:12,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:13:12,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:12,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:13:12,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:13:12,195 INFO L87 Difference]: Start difference. First operand 1731 states and 3946 transitions. Second operand 5 states. [2019-12-18 17:13:12,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:12,439 INFO L93 Difference]: Finished difference Result 2258 states and 4996 transitions. [2019-12-18 17:13:12,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:13:12,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 17:13:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:12,453 INFO L225 Difference]: With dead ends: 2258 [2019-12-18 17:13:12,453 INFO L226 Difference]: Without dead ends: 2258 [2019-12-18 17:13:12,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:13:12,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-12-18 17:13:12,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2002. [2019-12-18 17:13:12,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-12-18 17:13:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4502 transitions. [2019-12-18 17:13:12,504 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4502 transitions. Word has length 24 [2019-12-18 17:13:12,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:12,504 INFO L462 AbstractCegarLoop]: Abstraction has 2002 states and 4502 transitions. [2019-12-18 17:13:12,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:13:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4502 transitions. [2019-12-18 17:13:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 17:13:12,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:12,507 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-18 17:13:12,508 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:12,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:12,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1461081411, now seen corresponding path program 1 times [2019-12-18 17:13:12,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:12,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989589842] [2019-12-18 17:13:12,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:12,593 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-18 17:13:12,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989589842] [2019-12-18 17:13:12,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:12,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:13:12,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89008074] [2019-12-18 17:13:12,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:12,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:12,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:12,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:12,596 INFO L87 Difference]: Start difference. First operand 2002 states and 4502 transitions. Second operand 3 states. [2019-12-18 17:13:12,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:12,610 INFO L93 Difference]: Finished difference Result 2001 states and 4500 transitions. [2019-12-18 17:13:12,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:12,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 17:13:12,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:12,627 INFO L225 Difference]: With dead ends: 2001 [2019-12-18 17:13:12,628 INFO L226 Difference]: Without dead ends: 2001 [2019-12-18 17:13:12,630 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-18 17:13:12,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-12-18 17:13:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 2001. [2019-12-18 17:13:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-12-18 17:13:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 4500 transitions. [2019-12-18 17:13:12,678 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 4500 transitions. Word has length 26 [2019-12-18 17:13:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:12,678 INFO L462 AbstractCegarLoop]: Abstraction has 2001 states and 4500 transitions. [2019-12-18 17:13:12,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 4500 transitions. [2019-12-18 17:13:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 17:13:12,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:12,681 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-18 17:13:12,682 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:12,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:12,682 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-12-18 17:13:12,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:12,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879162216] [2019-12-18 17:13:12,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:12,786 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-18 17:13:12,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879162216] [2019-12-18 17:13:12,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:12,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:13:12,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567754838] [2019-12-18 17:13:12,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:13:12,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:12,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:13:12,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:13:12,788 INFO L87 Difference]: Start difference. First operand 2001 states and 4500 transitions. Second operand 5 states. [2019-12-18 17:13:13,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:13,035 INFO L93 Difference]: Finished difference Result 2378 states and 5234 transitions. [2019-12-18 17:13:13,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:13:13,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 17:13:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:13,042 INFO L225 Difference]: With dead ends: 2378 [2019-12-18 17:13:13,042 INFO L226 Difference]: Without dead ends: 2378 [2019-12-18 17:13:13,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:13:13,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2019-12-18 17:13:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 1851. [2019-12-18 17:13:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1851 states. [2019-12-18 17:13:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 4184 transitions. [2019-12-18 17:13:13,086 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 4184 transitions. Word has length 26 [2019-12-18 17:13:13,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:13,086 INFO L462 AbstractCegarLoop]: Abstraction has 1851 states and 4184 transitions. [2019-12-18 17:13:13,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:13:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 4184 transitions. [2019-12-18 17:13:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:13:13,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:13,089 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-18 17:13:13,089 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:13,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:13,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1750039425, now seen corresponding path program 1 times [2019-12-18 17:13:13,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:13,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591045563] [2019-12-18 17:13:13,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:13,163 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-18 17:13:13,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591045563] [2019-12-18 17:13:13,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:13,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:13:13,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327290610] [2019-12-18 17:13:13,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:13:13,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:13,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:13:13,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:13:13,166 INFO L87 Difference]: Start difference. First operand 1851 states and 4184 transitions. Second operand 5 states. [2019-12-18 17:13:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:13,712 INFO L93 Difference]: Finished difference Result 2697 states and 5966 transitions. [2019-12-18 17:13:13,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:13:13,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 17:13:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:13,722 INFO L225 Difference]: With dead ends: 2697 [2019-12-18 17:13:13,722 INFO L226 Difference]: Without dead ends: 2697 [2019-12-18 17:13:13,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:13:13,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-12-18 17:13:13,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2381. [2019-12-18 17:13:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2019-12-18 17:13:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 5342 transitions. [2019-12-18 17:13:13,772 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 5342 transitions. Word has length 27 [2019-12-18 17:13:13,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:13,773 INFO L462 AbstractCegarLoop]: Abstraction has 2381 states and 5342 transitions. [2019-12-18 17:13:13,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:13:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 5342 transitions. [2019-12-18 17:13:13,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 17:13:13,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:13,781 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-18 17:13:13,781 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:13,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:13,782 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-12-18 17:13:13,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:13,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651494763] [2019-12-18 17:13:13,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:13,835 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-18 17:13:13,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651494763] [2019-12-18 17:13:13,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:13,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:13:13,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314950762] [2019-12-18 17:13:13,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:13:13,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:13,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:13:13,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:13:13,837 INFO L87 Difference]: Start difference. First operand 2381 states and 5342 transitions. Second operand 4 states. [2019-12-18 17:13:13,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:13,853 INFO L93 Difference]: Finished difference Result 1330 states and 2854 transitions. [2019-12-18 17:13:13,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:13:13,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 17:13:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:13,857 INFO L225 Difference]: With dead ends: 1330 [2019-12-18 17:13:13,857 INFO L226 Difference]: Without dead ends: 1330 [2019-12-18 17:13:13,857 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-18 17:13:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-12-18 17:13:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1235. [2019-12-18 17:13:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2019-12-18 17:13:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 2679 transitions. [2019-12-18 17:13:13,881 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 2679 transitions. Word has length 28 [2019-12-18 17:13:13,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:13,882 INFO L462 AbstractCegarLoop]: Abstraction has 1235 states and 2679 transitions. [2019-12-18 17:13:13,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:13:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 2679 transitions. [2019-12-18 17:13:13,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 17:13:13,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:13,887 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-18 17:13:13,887 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:13,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:13,887 INFO L82 PathProgramCache]: Analyzing trace with hash -466202404, now seen corresponding path program 1 times [2019-12-18 17:13:13,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:13,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124461515] [2019-12-18 17:13:13,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:13,993 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-18 17:13:13,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124461515] [2019-12-18 17:13:13,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:13,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:13:13,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532058729] [2019-12-18 17:13:13,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:13:13,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:13,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:13:13,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:13:13,996 INFO L87 Difference]: Start difference. First operand 1235 states and 2679 transitions. Second operand 7 states. [2019-12-18 17:13:14,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:14,320 INFO L93 Difference]: Finished difference Result 3273 states and 6927 transitions. [2019-12-18 17:13:14,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 17:13:14,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 17:13:14,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:14,325 INFO L225 Difference]: With dead ends: 3273 [2019-12-18 17:13:14,325 INFO L226 Difference]: Without dead ends: 2143 [2019-12-18 17:13:14,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:13:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2019-12-18 17:13:14,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1275. [2019-12-18 17:13:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-12-18 17:13:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 2768 transitions. [2019-12-18 17:13:14,357 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 2768 transitions. Word has length 50 [2019-12-18 17:13:14,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:14,357 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 2768 transitions. [2019-12-18 17:13:14,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:13:14,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2768 transitions. [2019-12-18 17:13:14,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 17:13:14,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:14,361 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-18 17:13:14,361 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:14,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:14,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1410793752, now seen corresponding path program 2 times [2019-12-18 17:13:14,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:14,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17814190] [2019-12-18 17:13:14,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:14,425 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-18 17:13:14,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17814190] [2019-12-18 17:13:14,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:14,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:13:14,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047858831] [2019-12-18 17:13:14,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:14,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:14,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:14,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:14,427 INFO L87 Difference]: Start difference. First operand 1275 states and 2768 transitions. Second operand 3 states. [2019-12-18 17:13:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:14,474 INFO L93 Difference]: Finished difference Result 1629 states and 3493 transitions. [2019-12-18 17:13:14,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:14,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-18 17:13:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:14,480 INFO L225 Difference]: With dead ends: 1629 [2019-12-18 17:13:14,480 INFO L226 Difference]: Without dead ends: 1629 [2019-12-18 17:13:14,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-18 17:13:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-12-18 17:13:14,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1344. [2019-12-18 17:13:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1344 states. [2019-12-18 17:13:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2924 transitions. [2019-12-18 17:13:14,505 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2924 transitions. Word has length 50 [2019-12-18 17:13:14,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:14,506 INFO L462 AbstractCegarLoop]: Abstraction has 1344 states and 2924 transitions. [2019-12-18 17:13:14,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2924 transitions. [2019-12-18 17:13:14,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 17:13:14,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:14,510 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-18 17:13:14,510 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:14,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:14,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1876939711, now seen corresponding path program 1 times [2019-12-18 17:13:14,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:14,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474725004] [2019-12-18 17:13:14,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:14,791 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-18 17:13:14,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474725004] [2019-12-18 17:13:14,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:14,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:13:14,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674280796] [2019-12-18 17:13:14,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:13:14,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:14,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:13:14,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:13:14,793 INFO L87 Difference]: Start difference. First operand 1344 states and 2924 transitions. Second operand 11 states. [2019-12-18 17:13:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:15,813 INFO L93 Difference]: Finished difference Result 1933 states and 4015 transitions. [2019-12-18 17:13:15,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 17:13:15,814 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2019-12-18 17:13:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:15,819 INFO L225 Difference]: With dead ends: 1933 [2019-12-18 17:13:15,819 INFO L226 Difference]: Without dead ends: 1933 [2019-12-18 17:13:15,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-18 17:13:15,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-12-18 17:13:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1254. [2019-12-18 17:13:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2019-12-18 17:13:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 2686 transitions. [2019-12-18 17:13:15,850 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 2686 transitions. Word has length 51 [2019-12-18 17:13:15,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:15,850 INFO L462 AbstractCegarLoop]: Abstraction has 1254 states and 2686 transitions. [2019-12-18 17:13:15,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:13:15,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 2686 transitions. [2019-12-18 17:13:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 17:13:15,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:15,854 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-18 17:13:15,854 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:15,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:15,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1053790121, now seen corresponding path program 2 times [2019-12-18 17:13:15,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:15,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114772113] [2019-12-18 17:13:15,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:15,920 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-18 17:13:15,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114772113] [2019-12-18 17:13:15,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:15,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:13:15,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940170839] [2019-12-18 17:13:15,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:15,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:15,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:15,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:15,922 INFO L87 Difference]: Start difference. First operand 1254 states and 2686 transitions. Second operand 3 states. [2019-12-18 17:13:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:15,939 INFO L93 Difference]: Finished difference Result 1253 states and 2684 transitions. [2019-12-18 17:13:15,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:15,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 17:13:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:15,943 INFO L225 Difference]: With dead ends: 1253 [2019-12-18 17:13:15,943 INFO L226 Difference]: Without dead ends: 1253 [2019-12-18 17:13:15,944 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-18 17:13:15,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2019-12-18 17:13:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 995. [2019-12-18 17:13:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-12-18 17:13:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2166 transitions. [2019-12-18 17:13:15,976 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 2166 transitions. Word has length 51 [2019-12-18 17:13:15,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:15,977 INFO L462 AbstractCegarLoop]: Abstraction has 995 states and 2166 transitions. [2019-12-18 17:13:15,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 2166 transitions. [2019-12-18 17:13:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 17:13:15,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:15,980 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-18 17:13:15,980 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:15,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:15,981 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 1 times [2019-12-18 17:13:15,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:15,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604838019] [2019-12-18 17:13:15,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:13:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:13:16,158 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:13:16,159 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:13:16,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t899~0.base_35| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t899~0.base_35| 4) |v_#length_15|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t899~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t899~0.base_35|) |v_ULTIMATE.start_main_~#t899~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_ULTIMATE.start_main_~#t899~0.offset_24| 0) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t899~0.base_35|) 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t899~0.base_35|) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t899~0.base=|v_ULTIMATE.start_main_~#t899~0.base_35|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, ULTIMATE.start_main_~#t900~0.base=|v_ULTIMATE.start_main_~#t900~0.base_17|, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ULTIMATE.start_main_~#t900~0.offset=|v_ULTIMATE.start_main_~#t900~0.offset_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ULTIMATE.start_main_~#t899~0.offset=|v_ULTIMATE.start_main_~#t899~0.offset_24|, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t899~0.base, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t900~0.base, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t900~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t899~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 17:13:16,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t900~0.base_13| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t900~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t900~0.base_13|) |v_ULTIMATE.start_main_~#t900~0.offset_11| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t900~0.base_13|) (= |v_ULTIMATE.start_main_~#t900~0.offset_11| 0) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t900~0.base_13|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t900~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t900~0.base_13| 1) |v_#valid_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t900~0.base=|v_ULTIMATE.start_main_~#t900~0.base_13|, ULTIMATE.start_main_~#t900~0.offset=|v_ULTIMATE.start_main_~#t900~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t900~0.base, ULTIMATE.start_main_~#t900~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 17:13:16,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= 1 ~z$w_buff0_used~0_Out-710653951) (= ~z$w_buff1~0_Out-710653951 ~z$w_buff0~0_In-710653951) (= ~z$w_buff1_used~0_Out-710653951 ~z$w_buff0_used~0_In-710653951) (= P0Thread1of1ForFork0_~arg.offset_Out-710653951 |P0Thread1of1ForFork0_#in~arg.offset_In-710653951|) (= P0Thread1of1ForFork0_~arg.base_Out-710653951 |P0Thread1of1ForFork0_#in~arg.base_In-710653951|) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-710653951| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-710653951) (= 1 ~z$w_buff0~0_Out-710653951) (= (mod ~z$w_buff1_used~0_Out-710653951 256) 0) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-710653951|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-710653951|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-710653951, ~z$w_buff0~0=~z$w_buff0~0_In-710653951, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-710653951|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-710653951|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-710653951, ~z$w_buff0~0=~z$w_buff0~0_Out-710653951, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-710653951, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-710653951, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-710653951|, ~z$w_buff1~0=~z$w_buff1~0_Out-710653951, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-710653951, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-710653951|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-710653951} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:13:16,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-92224594 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_In-92224594| |P1Thread1of1ForFork1_#t~ite23_Out-92224594|) (= ~z$w_buff1_used~0_In-92224594 |P1Thread1of1ForFork1_#t~ite24_Out-92224594|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-92224594| ~z$w_buff1_used~0_In-92224594) (= |P1Thread1of1ForFork1_#t~ite23_Out-92224594| |P1Thread1of1ForFork1_#t~ite24_Out-92224594|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-92224594 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-92224594 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In-92224594 256) 0)) (= (mod ~z$w_buff0_used~0_In-92224594 256) 0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-92224594, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-92224594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-92224594, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-92224594|, ~weak$$choice2~0=~weak$$choice2~0_In-92224594, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-92224594} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-92224594, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-92224594, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-92224594|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-92224594, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-92224594|, ~weak$$choice2~0=~weak$$choice2~0_In-92224594, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-92224594} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-18 17:13:16,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite29_47| |v_P1Thread1of1ForFork1_#t~ite29_46|) (= |v_P1Thread1of1ForFork1_#t~ite28_51| |v_P1Thread1of1ForFork1_#t~ite28_50|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_40|) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_47|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_51|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_46|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_40|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_26|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_50|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_31|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 17:13:16,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 17:13:16,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-562680963 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-562680963 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-562680963| ~z$w_buff0_used~0_In-562680963) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-562680963| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-562680963, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-562680963} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-562680963|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-562680963, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-562680963} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 17:13:16,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In273389236 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In273389236 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In273389236 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In273389236 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out273389236| ~z$w_buff1_used~0_In273389236) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out273389236| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In273389236, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In273389236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In273389236, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In273389236} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out273389236|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In273389236, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In273389236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In273389236, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In273389236} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 17:13:16,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In163635240 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In163635240 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In163635240 ~z$r_buff0_thd1~0_Out163635240)) (and (= 0 ~z$r_buff0_thd1~0_Out163635240) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In163635240, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In163635240} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In163635240, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out163635240|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out163635240} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:13:16,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1027351102 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-1027351102 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1027351102 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1027351102 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1027351102| ~z$r_buff1_thd1~0_In-1027351102) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1027351102| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1027351102, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1027351102, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1027351102, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1027351102} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1027351102, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1027351102|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1027351102, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1027351102, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1027351102} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 17:13:16,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out163909120| |P1Thread1of1ForFork1_#t~ite32_Out163909120|)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In163909120 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In163909120 256)))) (or (and .cse0 (= ~z$w_buff1~0_In163909120 |P1Thread1of1ForFork1_#t~ite32_Out163909120|) (not .cse1) (not .cse2)) (and .cse0 (= ~z~0_In163909120 |P1Thread1of1ForFork1_#t~ite32_Out163909120|) (or .cse2 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In163909120, ~z$w_buff1_used~0=~z$w_buff1_used~0_In163909120, ~z$w_buff1~0=~z$w_buff1~0_In163909120, ~z~0=~z~0_In163909120} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In163909120, ~z$w_buff1_used~0=~z$w_buff1_used~0_In163909120, ~z$w_buff1~0=~z$w_buff1~0_In163909120, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out163909120|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out163909120|, ~z~0=~z~0_In163909120} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 17:13:16,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-637942078 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-637942078 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-637942078 |P1Thread1of1ForFork1_#t~ite34_Out-637942078|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-637942078|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-637942078, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-637942078} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-637942078, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-637942078|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-637942078} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 17:13:16,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1706979013 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1706979013 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1706979013 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In1706979013 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out1706979013| ~z$w_buff1_used~0_In1706979013)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out1706979013| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1706979013, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1706979013, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1706979013, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1706979013} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1706979013, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1706979013, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1706979013, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1706979013|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1706979013} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 17:13:16,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-429324194 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-429324194 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-429324194| 0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-429324194 |P1Thread1of1ForFork1_#t~ite36_Out-429324194|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-429324194, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-429324194} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-429324194, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-429324194, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-429324194|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 17:13:16,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-396728142 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-396728142 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-396728142 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-396728142 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out-396728142| ~z$r_buff1_thd2~0_In-396728142)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite37_Out-396728142| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-396728142, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-396728142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-396728142, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-396728142} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-396728142, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-396728142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-396728142, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-396728142, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-396728142|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 17:13:16,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 17:13:16,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= v_~z$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{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 17:13:16,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= 2 v_~__unbuffered_cnt~0_22) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~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-18 17:13:16,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1590992232 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1590992232 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1590992232 |ULTIMATE.start_main_#t~ite40_Out-1590992232|)) (and (= ~z~0_In-1590992232 |ULTIMATE.start_main_#t~ite40_Out-1590992232|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1590992232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1590992232, ~z$w_buff1~0=~z$w_buff1~0_In-1590992232, ~z~0=~z~0_In-1590992232} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1590992232|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1590992232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1590992232, ~z$w_buff1~0=~z$w_buff1~0_In-1590992232, ~z~0=~z~0_In-1590992232} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 17:13:16,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-18 17:13:16,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1321597222 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1321597222 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1321597222 |ULTIMATE.start_main_#t~ite42_Out-1321597222|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1321597222|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1321597222, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1321597222} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1321597222, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1321597222, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1321597222|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:13:16,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1868755498 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1868755498 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1868755498 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1868755498 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1868755498|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1868755498 |ULTIMATE.start_main_#t~ite43_Out1868755498|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1868755498, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1868755498, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1868755498, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1868755498} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1868755498, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1868755498, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1868755498, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1868755498, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1868755498|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 17:13:16,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1503367082 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1503367082 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1503367082| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1503367082| ~z$r_buff0_thd0~0_In-1503367082) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1503367082, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1503367082} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1503367082, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1503367082, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1503367082|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 17:13:16,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In1391175749 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1391175749 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1391175749 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1391175749 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out1391175749| ~z$r_buff1_thd0~0_In1391175749)) (and (= |ULTIMATE.start_main_#t~ite45_Out1391175749| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1391175749, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1391175749, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1391175749, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1391175749} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1391175749, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1391175749, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1391175749, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1391175749, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1391175749|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:13:16,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= 1 v_~__unbuffered_p1_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:13:16,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:13:16 BasicIcfg [2019-12-18 17:13:16,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:13:16,276 INFO L168 Benchmark]: Toolchain (without parser) took 14662.18 ms. Allocated memory was 144.2 MB in the beginning and 469.2 MB in the end (delta: 325.1 MB). Free memory was 98.5 MB in the beginning and 241.7 MB in the end (delta: -143.2 MB). Peak memory consumption was 181.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:16,276 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 144.2 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 17:13:16,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.21 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 98.5 MB in the beginning and 155.4 MB in the end (delta: -56.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:16,278 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.61 ms. Allocated memory is still 201.3 MB. Free memory was 155.4 MB in the beginning and 152.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:16,278 INFO L168 Benchmark]: Boogie Preprocessor took 38.26 ms. Allocated memory is still 201.3 MB. Free memory was 152.5 MB in the beginning and 150.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:16,279 INFO L168 Benchmark]: RCFGBuilder took 819.87 ms. Allocated memory is still 201.3 MB. Free memory was 150.6 MB in the beginning and 106.4 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:16,280 INFO L168 Benchmark]: TraceAbstraction took 12973.41 ms. Allocated memory was 201.3 MB in the beginning and 469.2 MB in the end (delta: 267.9 MB). Free memory was 105.5 MB in the beginning and 241.7 MB in the end (delta: -136.2 MB). Peak memory consumption was 131.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:16,284 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 144.2 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 765.21 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 98.5 MB in the beginning and 155.4 MB in the end (delta: -56.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.61 ms. Allocated memory is still 201.3 MB. Free memory was 155.4 MB in the beginning and 152.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.26 ms. Allocated memory is still 201.3 MB. Free memory was 152.5 MB in the beginning and 150.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 819.87 ms. Allocated memory is still 201.3 MB. Free memory was 150.6 MB in the beginning and 106.4 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12973.41 ms. Allocated memory was 201.3 MB in the beginning and 469.2 MB in the end (delta: 267.9 MB). Free memory was 105.5 MB in the beginning and 241.7 MB in the end (delta: -136.2 MB). Peak memory consumption was 131.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t899, ((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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t900, ((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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z 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=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$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=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) 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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) 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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) 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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z 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=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) 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=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) 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=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.6s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1795 SDtfs, 1455 SDslu, 3393 SDs, 0 SdLazy, 2116 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 21 SyntacticMatches, 11 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8766occurred 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.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 4186 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 441 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 50091 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...