/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/mix016_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:29:44,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:29:44,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:29:44,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:29:44,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:29:44,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:29:44,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:29:44,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:29:44,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:29:44,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:29:44,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:29:44,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:29:44,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:29:44,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:29:44,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:29:44,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:29:44,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:29:44,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:29:44,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:29:44,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:29:44,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:29:44,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:29:44,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:29:44,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:29:44,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:29:44,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:29:44,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:29:44,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:29:44,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:29:44,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:29:44,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:29:44,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:29:44,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:29:44,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:29:44,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:29:44,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:29:44,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:29:44,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:29:44,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:29:44,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:29:44,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:29:44,551 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 16:29:44,564 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:29:44,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:29:44,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:29:44,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:29:44,569 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:29:44,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:29:44,570 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:29:44,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:29:44,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:29:44,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:29:44,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:29:44,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:29:44,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:29:44,571 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:29:44,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:29:44,571 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:29:44,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:29:44,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:29:44,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:29:44,572 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:29:44,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:29:44,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:29:44,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:29:44,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:29:44,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:29:44,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:29:44,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:29:44,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:29:44,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:29:44,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:29:44,877 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:29:44,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:29:44,882 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:29:44,882 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:29:44,883 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.oepc.i [2019-12-18 16:29:44,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16c9231a5/33643a3cc268499c955395c316ae18fc/FLAG9e8023c7f [2019-12-18 16:29:45,521 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:29:45,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.oepc.i [2019-12-18 16:29:45,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16c9231a5/33643a3cc268499c955395c316ae18fc/FLAG9e8023c7f [2019-12-18 16:29:45,773 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16c9231a5/33643a3cc268499c955395c316ae18fc [2019-12-18 16:29:45,784 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:29:45,786 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:29:45,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:29:45,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:29:45,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:29:45,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:29:45" (1/1) ... [2019-12-18 16:29:45,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd22070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:45, skipping insertion in model container [2019-12-18 16:29:45,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:29:45" (1/1) ... [2019-12-18 16:29:45,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:29:45,867 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:29:46,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:29:46,431 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:29:46,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:29:46,585 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:29:46,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:46 WrapperNode [2019-12-18 16:29:46,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:29:46,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:29:46,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:29:46,587 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:29:46,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:46" (1/1) ... [2019-12-18 16:29:46,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:46" (1/1) ... [2019-12-18 16:29:46,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:29:46,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:29:46,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:29:46,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:29:46,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:46" (1/1) ... [2019-12-18 16:29:46,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:46" (1/1) ... [2019-12-18 16:29:46,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:46" (1/1) ... [2019-12-18 16:29:46,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:46" (1/1) ... [2019-12-18 16:29:46,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:46" (1/1) ... [2019-12-18 16:29:46,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:46" (1/1) ... [2019-12-18 16:29:46,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:46" (1/1) ... [2019-12-18 16:29:46,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:29:46,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:29:46,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:29:46,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:29:46,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:46" (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 16:29:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:29:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:29:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:29:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:29:46,765 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:29:46,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:29:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:29:46,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:29:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:29:46,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:29:46,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:29:46,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:29:46,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:29:46,772 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 16:29:47,542 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:29:47,543 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:29:47,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:29:47 BoogieIcfgContainer [2019-12-18 16:29:47,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:29:47,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:29:47,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:29:47,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:29:47,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:29:45" (1/3) ... [2019-12-18 16:29:47,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1882a579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:29:47, skipping insertion in model container [2019-12-18 16:29:47,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:46" (2/3) ... [2019-12-18 16:29:47,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1882a579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:29:47, skipping insertion in model container [2019-12-18 16:29:47,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:29:47" (3/3) ... [2019-12-18 16:29:47,554 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_power.oepc.i [2019-12-18 16:29:47,566 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:29:47,566 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:29:47,580 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:29:47,581 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:29:47,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,643 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,643 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,643 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,644 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,644 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,656 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,657 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,668 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,668 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,712 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,714 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,722 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,722 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,724 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,724 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:47,744 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:29:47,764 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:29:47,764 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:29:47,765 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:29:47,765 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:29:47,765 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:29:47,765 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:29:47,765 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:29:47,765 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:29:47,781 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 16:29:47,783 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 16:29:47,872 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 16:29:47,872 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:29:47,895 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:29:47,922 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 16:29:47,976 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 16:29:47,976 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:29:47,986 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:29:48,009 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 16:29:48,010 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:29:53,002 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-18 16:29:53,117 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-18 16:29:53,344 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 16:29:53,471 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 16:29:53,503 INFO L206 etLargeBlockEncoding]: Checked pairs total: 89688 [2019-12-18 16:29:53,503 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 16:29:53,507 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-18 16:30:09,782 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106864 states. [2019-12-18 16:30:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 106864 states. [2019-12-18 16:30:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 16:30:09,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:09,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 16:30:09,793 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:09,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:09,799 INFO L82 PathProgramCache]: Analyzing trace with hash 921701, now seen corresponding path program 1 times [2019-12-18 16:30:09,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:09,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785449659] [2019-12-18 16:30:09,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:10,056 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 16:30:10,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785449659] [2019-12-18 16:30:10,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:10,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:30:10,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58591384] [2019-12-18 16:30:10,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:30:10,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:10,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:30:10,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:30:10,086 INFO L87 Difference]: Start difference. First operand 106864 states. Second operand 3 states. [2019-12-18 16:30:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:11,754 INFO L93 Difference]: Finished difference Result 106034 states and 453004 transitions. [2019-12-18 16:30:11,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:30:11,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 16:30:11,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:12,515 INFO L225 Difference]: With dead ends: 106034 [2019-12-18 16:30:12,516 INFO L226 Difference]: Without dead ends: 99950 [2019-12-18 16:30:12,519 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 16:30:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99950 states. [2019-12-18 16:30:24,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99950 to 99950. [2019-12-18 16:30:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99950 states. [2019-12-18 16:30:24,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99950 states to 99950 states and 426445 transitions. [2019-12-18 16:30:24,599 INFO L78 Accepts]: Start accepts. Automaton has 99950 states and 426445 transitions. Word has length 3 [2019-12-18 16:30:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:24,599 INFO L462 AbstractCegarLoop]: Abstraction has 99950 states and 426445 transitions. [2019-12-18 16:30:24,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:30:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 99950 states and 426445 transitions. [2019-12-18 16:30:24,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 16:30:24,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:24,605 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:30:24,605 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:24,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:24,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1680645281, now seen corresponding path program 1 times [2019-12-18 16:30:24,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:24,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23781986] [2019-12-18 16:30:24,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:24,735 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 16:30:24,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23781986] [2019-12-18 16:30:24,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:24,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:30:24,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614564355] [2019-12-18 16:30:24,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:30:24,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:24,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:30:24,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:30:24,738 INFO L87 Difference]: Start difference. First operand 99950 states and 426445 transitions. Second operand 4 states. [2019-12-18 16:30:29,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:29,788 INFO L93 Difference]: Finished difference Result 159384 states and 652094 transitions. [2019-12-18 16:30:29,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:30:29,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 16:30:29,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:30,492 INFO L225 Difference]: With dead ends: 159384 [2019-12-18 16:30:30,492 INFO L226 Difference]: Without dead ends: 159335 [2019-12-18 16:30:30,493 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 16:30:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159335 states. [2019-12-18 16:30:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159335 to 143879. [2019-12-18 16:30:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143879 states. [2019-12-18 16:30:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143879 states to 143879 states and 597281 transitions. [2019-12-18 16:30:44,996 INFO L78 Accepts]: Start accepts. Automaton has 143879 states and 597281 transitions. Word has length 11 [2019-12-18 16:30:44,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:44,996 INFO L462 AbstractCegarLoop]: Abstraction has 143879 states and 597281 transitions. [2019-12-18 16:30:44,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:30:44,996 INFO L276 IsEmpty]: Start isEmpty. Operand 143879 states and 597281 transitions. [2019-12-18 16:30:45,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:30:45,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:45,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:30:45,006 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:45,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:45,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1535099311, now seen corresponding path program 1 times [2019-12-18 16:30:45,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:45,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449259922] [2019-12-18 16:30:45,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:45,154 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 16:30:45,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449259922] [2019-12-18 16:30:45,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:45,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:30:45,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368112976] [2019-12-18 16:30:45,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:30:45,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:45,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:30:45,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:30:45,157 INFO L87 Difference]: Start difference. First operand 143879 states and 597281 transitions. Second operand 4 states. [2019-12-18 16:30:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:52,417 INFO L93 Difference]: Finished difference Result 202801 states and 822791 transitions. [2019-12-18 16:30:52,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:30:52,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 16:30:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:53,065 INFO L225 Difference]: With dead ends: 202801 [2019-12-18 16:30:53,065 INFO L226 Difference]: Without dead ends: 202745 [2019-12-18 16:30:53,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 16:30:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202745 states. [2019-12-18 16:31:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202745 to 170256. [2019-12-18 16:31:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170256 states. [2019-12-18 16:31:01,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170256 states to 170256 states and 703222 transitions. [2019-12-18 16:31:01,907 INFO L78 Accepts]: Start accepts. Automaton has 170256 states and 703222 transitions. Word has length 13 [2019-12-18 16:31:01,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:01,908 INFO L462 AbstractCegarLoop]: Abstraction has 170256 states and 703222 transitions. [2019-12-18 16:31:01,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:31:01,908 INFO L276 IsEmpty]: Start isEmpty. Operand 170256 states and 703222 transitions. [2019-12-18 16:31:01,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:31:01,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:01,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:01,917 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:01,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:01,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1228744872, now seen corresponding path program 1 times [2019-12-18 16:31:01,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:01,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498613594] [2019-12-18 16:31:01,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:02,017 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 16:31:02,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498613594] [2019-12-18 16:31:02,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:02,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:31:02,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115270853] [2019-12-18 16:31:02,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:31:02,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:02,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:31:02,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:31:02,019 INFO L87 Difference]: Start difference. First operand 170256 states and 703222 transitions. Second operand 4 states. [2019-12-18 16:31:10,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:10,039 INFO L93 Difference]: Finished difference Result 214467 states and 881100 transitions. [2019-12-18 16:31:10,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:31:10,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:31:10,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:10,710 INFO L225 Difference]: With dead ends: 214467 [2019-12-18 16:31:10,710 INFO L226 Difference]: Without dead ends: 214467 [2019-12-18 16:31:10,710 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 16:31:15,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214467 states. [2019-12-18 16:31:19,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214467 to 183252. [2019-12-18 16:31:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183252 states. [2019-12-18 16:31:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183252 states to 183252 states and 757164 transitions. [2019-12-18 16:31:20,070 INFO L78 Accepts]: Start accepts. Automaton has 183252 states and 757164 transitions. Word has length 16 [2019-12-18 16:31:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:20,070 INFO L462 AbstractCegarLoop]: Abstraction has 183252 states and 757164 transitions. [2019-12-18 16:31:20,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:31:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 183252 states and 757164 transitions. [2019-12-18 16:31:20,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:31:20,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:20,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:20,081 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:20,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:20,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1228651655, now seen corresponding path program 1 times [2019-12-18 16:31:20,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:20,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493623828] [2019-12-18 16:31:20,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:20,155 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 16:31:20,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493623828] [2019-12-18 16:31:20,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:20,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:31:20,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815021543] [2019-12-18 16:31:20,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:31:20,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:20,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:31:20,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:31:20,157 INFO L87 Difference]: Start difference. First operand 183252 states and 757164 transitions. Second operand 4 states. [2019-12-18 16:31:26,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:26,884 INFO L93 Difference]: Finished difference Result 223450 states and 919042 transitions. [2019-12-18 16:31:26,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:31:26,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:31:26,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:27,564 INFO L225 Difference]: With dead ends: 223450 [2019-12-18 16:31:27,565 INFO L226 Difference]: Without dead ends: 223450 [2019-12-18 16:31:27,565 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 16:31:37,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223450 states. [2019-12-18 16:31:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223450 to 182620. [2019-12-18 16:31:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182620 states. [2019-12-18 16:31:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182620 states to 182620 states and 754482 transitions. [2019-12-18 16:31:41,715 INFO L78 Accepts]: Start accepts. Automaton has 182620 states and 754482 transitions. Word has length 16 [2019-12-18 16:31:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:41,715 INFO L462 AbstractCegarLoop]: Abstraction has 182620 states and 754482 transitions. [2019-12-18 16:31:41,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:31:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 182620 states and 754482 transitions. [2019-12-18 16:31:41,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 16:31:41,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:41,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:41,731 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:41,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:41,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1477868963, now seen corresponding path program 1 times [2019-12-18 16:31:41,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:41,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958774093] [2019-12-18 16:31:41,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:41,793 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 16:31:41,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958774093] [2019-12-18 16:31:41,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:41,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:31:41,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057291091] [2019-12-18 16:31:41,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:31:41,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:41,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:31:41,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:31:41,796 INFO L87 Difference]: Start difference. First operand 182620 states and 754482 transitions. Second operand 3 states. [2019-12-18 16:31:49,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:49,491 INFO L93 Difference]: Finished difference Result 182256 states and 753055 transitions. [2019-12-18 16:31:49,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:31:49,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 16:31:49,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:50,027 INFO L225 Difference]: With dead ends: 182256 [2019-12-18 16:31:50,027 INFO L226 Difference]: Without dead ends: 182256 [2019-12-18 16:31:50,028 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 16:31:54,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182256 states. [2019-12-18 16:31:56,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182256 to 182256. [2019-12-18 16:31:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182256 states. [2019-12-18 16:31:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182256 states to 182256 states and 753055 transitions. [2019-12-18 16:31:58,329 INFO L78 Accepts]: Start accepts. Automaton has 182256 states and 753055 transitions. Word has length 18 [2019-12-18 16:31:58,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:58,329 INFO L462 AbstractCegarLoop]: Abstraction has 182256 states and 753055 transitions. [2019-12-18 16:31:58,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:31:58,329 INFO L276 IsEmpty]: Start isEmpty. Operand 182256 states and 753055 transitions. [2019-12-18 16:31:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 16:31:58,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:58,345 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:58,345 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:58,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:58,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1719186322, now seen corresponding path program 1 times [2019-12-18 16:31:58,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:58,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641431994] [2019-12-18 16:31:58,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:58,434 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 16:31:58,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641431994] [2019-12-18 16:31:58,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:58,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:31:58,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494170698] [2019-12-18 16:31:58,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:31:58,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:58,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:31:58,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:31:58,436 INFO L87 Difference]: Start difference. First operand 182256 states and 753055 transitions. Second operand 3 states. [2019-12-18 16:32:05,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:05,505 INFO L93 Difference]: Finished difference Result 171684 states and 701366 transitions. [2019-12-18 16:32:05,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:32:05,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 16:32:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:05,974 INFO L225 Difference]: With dead ends: 171684 [2019-12-18 16:32:05,974 INFO L226 Difference]: Without dead ends: 171684 [2019-12-18 16:32:05,974 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 16:32:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171684 states. [2019-12-18 16:32:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171684 to 168552. [2019-12-18 16:32:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168552 states. [2019-12-18 16:32:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168552 states to 168552 states and 689782 transitions. [2019-12-18 16:32:13,904 INFO L78 Accepts]: Start accepts. Automaton has 168552 states and 689782 transitions. Word has length 19 [2019-12-18 16:32:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:13,905 INFO L462 AbstractCegarLoop]: Abstraction has 168552 states and 689782 transitions. [2019-12-18 16:32:13,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:32:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand 168552 states and 689782 transitions. [2019-12-18 16:32:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 16:32:13,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:13,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:32:13,919 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:13,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:13,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2011667091, now seen corresponding path program 1 times [2019-12-18 16:32:13,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:13,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526574801] [2019-12-18 16:32:13,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:13,989 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 16:32:13,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526574801] [2019-12-18 16:32:13,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:13,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:13,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218507932] [2019-12-18 16:32:13,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:32:13,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:13,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:32:13,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:32:13,992 INFO L87 Difference]: Start difference. First operand 168552 states and 689782 transitions. Second operand 4 states. [2019-12-18 16:32:14,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:14,190 INFO L93 Difference]: Finished difference Result 43415 states and 148945 transitions. [2019-12-18 16:32:14,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:32:14,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 16:32:14,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:14,248 INFO L225 Difference]: With dead ends: 43415 [2019-12-18 16:32:14,248 INFO L226 Difference]: Without dead ends: 33284 [2019-12-18 16:32:14,249 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 16:32:14,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33284 states. [2019-12-18 16:32:14,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33284 to 33284. [2019-12-18 16:32:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33284 states. [2019-12-18 16:32:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33284 states to 33284 states and 107536 transitions. [2019-12-18 16:32:14,770 INFO L78 Accepts]: Start accepts. Automaton has 33284 states and 107536 transitions. Word has length 19 [2019-12-18 16:32:14,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:14,771 INFO L462 AbstractCegarLoop]: Abstraction has 33284 states and 107536 transitions. [2019-12-18 16:32:14,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:32:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 33284 states and 107536 transitions. [2019-12-18 16:32:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:32:14,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:14,776 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] [2019-12-18 16:32:14,776 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:14,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:14,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1838789338, now seen corresponding path program 1 times [2019-12-18 16:32:14,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:14,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725805724] [2019-12-18 16:32:14,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:14,871 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 16:32:14,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725805724] [2019-12-18 16:32:14,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:14,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:14,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314910847] [2019-12-18 16:32:14,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:32:14,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:14,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:32:14,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:32:14,873 INFO L87 Difference]: Start difference. First operand 33284 states and 107536 transitions. Second operand 5 states. [2019-12-18 16:32:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:15,514 INFO L93 Difference]: Finished difference Result 51113 states and 162480 transitions. [2019-12-18 16:32:15,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:32:15,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:32:15,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:17,944 INFO L225 Difference]: With dead ends: 51113 [2019-12-18 16:32:17,944 INFO L226 Difference]: Without dead ends: 51057 [2019-12-18 16:32:17,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:32:18,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51057 states. [2019-12-18 16:32:18,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51057 to 34974. [2019-12-18 16:32:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34974 states. [2019-12-18 16:32:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34974 states to 34974 states and 113053 transitions. [2019-12-18 16:32:18,631 INFO L78 Accepts]: Start accepts. Automaton has 34974 states and 113053 transitions. Word has length 22 [2019-12-18 16:32:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:18,632 INFO L462 AbstractCegarLoop]: Abstraction has 34974 states and 113053 transitions. [2019-12-18 16:32:18,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:32:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 34974 states and 113053 transitions. [2019-12-18 16:32:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:32:18,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:18,638 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] [2019-12-18 16:32:18,638 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:18,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1838882555, now seen corresponding path program 1 times [2019-12-18 16:32:18,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:18,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932404415] [2019-12-18 16:32:18,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:18,738 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 16:32:18,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932404415] [2019-12-18 16:32:18,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:18,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:18,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935450672] [2019-12-18 16:32:18,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:32:18,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:18,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:32:18,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:32:18,741 INFO L87 Difference]: Start difference. First operand 34974 states and 113053 transitions. Second operand 5 states. [2019-12-18 16:32:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:19,361 INFO L93 Difference]: Finished difference Result 52028 states and 165097 transitions. [2019-12-18 16:32:19,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:32:19,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:32:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:19,439 INFO L225 Difference]: With dead ends: 52028 [2019-12-18 16:32:19,439 INFO L226 Difference]: Without dead ends: 51972 [2019-12-18 16:32:19,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:32:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51972 states. [2019-12-18 16:32:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51972 to 32731. [2019-12-18 16:32:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32731 states. [2019-12-18 16:32:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32731 states to 32731 states and 105533 transitions. [2019-12-18 16:32:20,398 INFO L78 Accepts]: Start accepts. Automaton has 32731 states and 105533 transitions. Word has length 22 [2019-12-18 16:32:20,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:20,398 INFO L462 AbstractCegarLoop]: Abstraction has 32731 states and 105533 transitions. [2019-12-18 16:32:20,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:32:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 32731 states and 105533 transitions. [2019-12-18 16:32:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:32:20,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:20,407 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] [2019-12-18 16:32:20,407 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:20,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:20,407 INFO L82 PathProgramCache]: Analyzing trace with hash 320469370, now seen corresponding path program 1 times [2019-12-18 16:32:20,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:20,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727976228] [2019-12-18 16:32:20,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:20,500 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 16:32:20,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727976228] [2019-12-18 16:32:20,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:20,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:20,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61351314] [2019-12-18 16:32:20,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:32:20,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:20,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:32:20,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:32:20,503 INFO L87 Difference]: Start difference. First operand 32731 states and 105533 transitions. Second operand 5 states. [2019-12-18 16:32:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:21,082 INFO L93 Difference]: Finished difference Result 47457 states and 149711 transitions. [2019-12-18 16:32:21,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:32:21,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 16:32:21,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:21,155 INFO L225 Difference]: With dead ends: 47457 [2019-12-18 16:32:21,155 INFO L226 Difference]: Without dead ends: 47444 [2019-12-18 16:32:21,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 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 16:32:21,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47444 states. [2019-12-18 16:32:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47444 to 38683. [2019-12-18 16:32:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38683 states. [2019-12-18 16:32:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38683 states to 38683 states and 124370 transitions. [2019-12-18 16:32:22,326 INFO L78 Accepts]: Start accepts. Automaton has 38683 states and 124370 transitions. Word has length 25 [2019-12-18 16:32:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:22,327 INFO L462 AbstractCegarLoop]: Abstraction has 38683 states and 124370 transitions. [2019-12-18 16:32:22,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:32:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 38683 states and 124370 transitions. [2019-12-18 16:32:22,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:32:22,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:22,339 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 16:32:22,340 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:22,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:22,340 INFO L82 PathProgramCache]: Analyzing trace with hash 270212897, now seen corresponding path program 1 times [2019-12-18 16:32:22,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:22,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719475165] [2019-12-18 16:32:22,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:22,386 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 16:32:22,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719475165] [2019-12-18 16:32:22,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:22,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:22,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450356694] [2019-12-18 16:32:22,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:32:22,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:22,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:32:22,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:32:22,389 INFO L87 Difference]: Start difference. First operand 38683 states and 124370 transitions. Second operand 3 states. [2019-12-18 16:32:22,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:22,602 INFO L93 Difference]: Finished difference Result 59121 states and 189037 transitions. [2019-12-18 16:32:22,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:32:22,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 16:32:22,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:22,702 INFO L225 Difference]: With dead ends: 59121 [2019-12-18 16:32:22,702 INFO L226 Difference]: Without dead ends: 59121 [2019-12-18 16:32:22,702 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 16:32:22,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59121 states. [2019-12-18 16:32:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59121 to 45711. [2019-12-18 16:32:23,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45711 states. [2019-12-18 16:32:23,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45711 states to 45711 states and 147221 transitions. [2019-12-18 16:32:23,602 INFO L78 Accepts]: Start accepts. Automaton has 45711 states and 147221 transitions. Word has length 27 [2019-12-18 16:32:23,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:23,602 INFO L462 AbstractCegarLoop]: Abstraction has 45711 states and 147221 transitions. [2019-12-18 16:32:23,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:32:23,602 INFO L276 IsEmpty]: Start isEmpty. Operand 45711 states and 147221 transitions. [2019-12-18 16:32:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:32:23,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:23,618 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 16:32:23,618 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:23,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:23,619 INFO L82 PathProgramCache]: Analyzing trace with hash 2064759266, now seen corresponding path program 1 times [2019-12-18 16:32:23,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:23,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140851479] [2019-12-18 16:32:23,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:23,663 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 16:32:23,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140851479] [2019-12-18 16:32:23,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:23,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:23,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826456900] [2019-12-18 16:32:23,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:32:23,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:23,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:32:23,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:32:23,665 INFO L87 Difference]: Start difference. First operand 45711 states and 147221 transitions. Second operand 3 states. [2019-12-18 16:32:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:23,964 INFO L93 Difference]: Finished difference Result 59121 states and 184317 transitions. [2019-12-18 16:32:23,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:32:23,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 16:32:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:24,068 INFO L225 Difference]: With dead ends: 59121 [2019-12-18 16:32:24,068 INFO L226 Difference]: Without dead ends: 59121 [2019-12-18 16:32:24,069 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 16:32:24,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59121 states. [2019-12-18 16:32:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59121 to 45711. [2019-12-18 16:32:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45711 states. [2019-12-18 16:32:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45711 states to 45711 states and 142501 transitions. [2019-12-18 16:32:25,171 INFO L78 Accepts]: Start accepts. Automaton has 45711 states and 142501 transitions. Word has length 27 [2019-12-18 16:32:25,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:25,171 INFO L462 AbstractCegarLoop]: Abstraction has 45711 states and 142501 transitions. [2019-12-18 16:32:25,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:32:25,171 INFO L276 IsEmpty]: Start isEmpty. Operand 45711 states and 142501 transitions. [2019-12-18 16:32:25,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:32:25,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:25,185 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 16:32:25,185 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:25,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:25,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2010439622, now seen corresponding path program 1 times [2019-12-18 16:32:25,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:25,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408488907] [2019-12-18 16:32:25,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:25,272 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 16:32:25,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408488907] [2019-12-18 16:32:25,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:25,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:25,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923923501] [2019-12-18 16:32:25,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:32:25,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:25,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:32:25,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:32:25,275 INFO L87 Difference]: Start difference. First operand 45711 states and 142501 transitions. Second operand 5 states. [2019-12-18 16:32:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:25,730 INFO L93 Difference]: Finished difference Result 56372 states and 173835 transitions. [2019-12-18 16:32:25,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:32:25,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 16:32:25,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:25,829 INFO L225 Difference]: With dead ends: 56372 [2019-12-18 16:32:25,830 INFO L226 Difference]: Without dead ends: 56196 [2019-12-18 16:32:25,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 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 16:32:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56196 states. [2019-12-18 16:32:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56196 to 47904. [2019-12-18 16:32:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47904 states. [2019-12-18 16:32:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47904 states to 47904 states and 149182 transitions. [2019-12-18 16:32:27,016 INFO L78 Accepts]: Start accepts. Automaton has 47904 states and 149182 transitions. Word has length 27 [2019-12-18 16:32:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:27,016 INFO L462 AbstractCegarLoop]: Abstraction has 47904 states and 149182 transitions. [2019-12-18 16:32:27,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:32:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 47904 states and 149182 transitions. [2019-12-18 16:32:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:32:27,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:27,034 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 16:32:27,035 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:27,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:27,035 INFO L82 PathProgramCache]: Analyzing trace with hash 773295241, now seen corresponding path program 1 times [2019-12-18 16:32:27,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:27,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875052244] [2019-12-18 16:32:27,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:27,124 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 16:32:27,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875052244] [2019-12-18 16:32:27,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:27,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:27,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645393157] [2019-12-18 16:32:27,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:32:27,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:27,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:32:27,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:32:27,126 INFO L87 Difference]: Start difference. First operand 47904 states and 149182 transitions. Second operand 5 states. [2019-12-18 16:32:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:27,608 INFO L93 Difference]: Finished difference Result 58142 states and 179062 transitions. [2019-12-18 16:32:27,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:32:27,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 16:32:27,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:27,709 INFO L225 Difference]: With dead ends: 58142 [2019-12-18 16:32:27,710 INFO L226 Difference]: Without dead ends: 57958 [2019-12-18 16:32:27,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 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 16:32:27,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57958 states. [2019-12-18 16:32:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57958 to 47592. [2019-12-18 16:32:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47592 states. [2019-12-18 16:32:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47592 states to 47592 states and 148093 transitions. [2019-12-18 16:32:28,991 INFO L78 Accepts]: Start accepts. Automaton has 47592 states and 148093 transitions. Word has length 28 [2019-12-18 16:32:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:28,991 INFO L462 AbstractCegarLoop]: Abstraction has 47592 states and 148093 transitions. [2019-12-18 16:32:28,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:32:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 47592 states and 148093 transitions. [2019-12-18 16:32:29,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 16:32:29,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:29,006 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] [2019-12-18 16:32:29,006 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:29,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:29,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1820575072, now seen corresponding path program 1 times [2019-12-18 16:32:29,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:29,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143846887] [2019-12-18 16:32:29,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:29,076 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 16:32:29,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143846887] [2019-12-18 16:32:29,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:29,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:32:29,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882424968] [2019-12-18 16:32:29,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:32:29,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:29,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:32:29,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:32:29,080 INFO L87 Difference]: Start difference. First operand 47592 states and 148093 transitions. Second operand 5 states. [2019-12-18 16:32:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:29,219 INFO L93 Difference]: Finished difference Result 21069 states and 62976 transitions. [2019-12-18 16:32:29,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:32:29,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 16:32:29,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:29,257 INFO L225 Difference]: With dead ends: 21069 [2019-12-18 16:32:29,258 INFO L226 Difference]: Without dead ends: 18454 [2019-12-18 16:32:29,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:32:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18454 states. [2019-12-18 16:32:29,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18454 to 17375. [2019-12-18 16:32:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17375 states. [2019-12-18 16:32:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17375 states to 17375 states and 51733 transitions. [2019-12-18 16:32:29,652 INFO L78 Accepts]: Start accepts. Automaton has 17375 states and 51733 transitions. Word has length 30 [2019-12-18 16:32:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:29,652 INFO L462 AbstractCegarLoop]: Abstraction has 17375 states and 51733 transitions. [2019-12-18 16:32:29,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:32:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 17375 states and 51733 transitions. [2019-12-18 16:32:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 16:32:29,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:29,672 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] [2019-12-18 16:32:29,672 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:29,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:29,673 INFO L82 PathProgramCache]: Analyzing trace with hash -809721720, now seen corresponding path program 1 times [2019-12-18 16:32:29,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:29,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380112527] [2019-12-18 16:32:29,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:29,763 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 16:32:29,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380112527] [2019-12-18 16:32:29,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:29,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:32:29,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217974078] [2019-12-18 16:32:29,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:32:29,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:29,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:32:29,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:32:29,766 INFO L87 Difference]: Start difference. First operand 17375 states and 51733 transitions. Second operand 6 states. [2019-12-18 16:32:30,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:30,440 INFO L93 Difference]: Finished difference Result 22016 states and 64715 transitions. [2019-12-18 16:32:30,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:32:30,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 16:32:30,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:30,469 INFO L225 Difference]: With dead ends: 22016 [2019-12-18 16:32:30,469 INFO L226 Difference]: Without dead ends: 21702 [2019-12-18 16:32:30,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:32:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21702 states. [2019-12-18 16:32:30,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21702 to 17450. [2019-12-18 16:32:30,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17450 states. [2019-12-18 16:32:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17450 states to 17450 states and 51962 transitions. [2019-12-18 16:32:30,737 INFO L78 Accepts]: Start accepts. Automaton has 17450 states and 51962 transitions. Word has length 33 [2019-12-18 16:32:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:30,737 INFO L462 AbstractCegarLoop]: Abstraction has 17450 states and 51962 transitions. [2019-12-18 16:32:30,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:32:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 17450 states and 51962 transitions. [2019-12-18 16:32:30,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 16:32:30,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:30,752 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] [2019-12-18 16:32:30,752 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:30,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:30,753 INFO L82 PathProgramCache]: Analyzing trace with hash -752360441, now seen corresponding path program 1 times [2019-12-18 16:32:30,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:30,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935616522] [2019-12-18 16:32:30,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:30,839 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 16:32:30,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935616522] [2019-12-18 16:32:30,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:30,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:32:30,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020287336] [2019-12-18 16:32:30,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:32:30,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:30,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:32:30,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:32:30,841 INFO L87 Difference]: Start difference. First operand 17450 states and 51962 transitions. Second operand 6 states. [2019-12-18 16:32:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:31,521 INFO L93 Difference]: Finished difference Result 21180 states and 62232 transitions. [2019-12-18 16:32:31,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:32:31,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 16:32:31,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:31,549 INFO L225 Difference]: With dead ends: 21180 [2019-12-18 16:32:31,549 INFO L226 Difference]: Without dead ends: 20805 [2019-12-18 16:32:31,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:32:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20805 states. [2019-12-18 16:32:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20805 to 16323. [2019-12-18 16:32:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16323 states. [2019-12-18 16:32:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16323 states to 16323 states and 48617 transitions. [2019-12-18 16:32:31,807 INFO L78 Accepts]: Start accepts. Automaton has 16323 states and 48617 transitions. Word has length 34 [2019-12-18 16:32:31,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:31,808 INFO L462 AbstractCegarLoop]: Abstraction has 16323 states and 48617 transitions. [2019-12-18 16:32:31,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:32:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 16323 states and 48617 transitions. [2019-12-18 16:32:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 16:32:31,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:31,827 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] [2019-12-18 16:32:31,827 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:31,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:31,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1200265194, now seen corresponding path program 1 times [2019-12-18 16:32:31,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:31,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266218020] [2019-12-18 16:32:31,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:32,039 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 16:32:32,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266218020] [2019-12-18 16:32:32,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:32,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:32:32,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494228647] [2019-12-18 16:32:32,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:32:32,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:32,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:32:32,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:32:32,041 INFO L87 Difference]: Start difference. First operand 16323 states and 48617 transitions. Second operand 5 states. [2019-12-18 16:32:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:32,672 INFO L93 Difference]: Finished difference Result 24319 states and 71696 transitions. [2019-12-18 16:32:32,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:32:32,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 16:32:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:32,712 INFO L225 Difference]: With dead ends: 24319 [2019-12-18 16:32:32,712 INFO L226 Difference]: Without dead ends: 24319 [2019-12-18 16:32:32,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 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 16:32:32,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24319 states. [2019-12-18 16:32:32,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24319 to 19422. [2019-12-18 16:32:32,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19422 states. [2019-12-18 16:32:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19422 states to 19422 states and 57992 transitions. [2019-12-18 16:32:33,025 INFO L78 Accepts]: Start accepts. Automaton has 19422 states and 57992 transitions. Word has length 41 [2019-12-18 16:32:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:33,025 INFO L462 AbstractCegarLoop]: Abstraction has 19422 states and 57992 transitions. [2019-12-18 16:32:33,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:32:33,025 INFO L276 IsEmpty]: Start isEmpty. Operand 19422 states and 57992 transitions. [2019-12-18 16:32:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 16:32:33,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:33,046 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] [2019-12-18 16:32:33,046 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:33,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:33,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1472692188, now seen corresponding path program 2 times [2019-12-18 16:32:33,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:33,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030438423] [2019-12-18 16:32:33,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:33,104 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 16:32:33,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030438423] [2019-12-18 16:32:33,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:33,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:32:33,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728976491] [2019-12-18 16:32:33,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:32:33,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:33,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:32:33,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:32:33,106 INFO L87 Difference]: Start difference. First operand 19422 states and 57992 transitions. Second operand 3 states. [2019-12-18 16:32:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:33,169 INFO L93 Difference]: Finished difference Result 16323 states and 47993 transitions. [2019-12-18 16:32:33,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:32:33,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 16:32:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:33,189 INFO L225 Difference]: With dead ends: 16323 [2019-12-18 16:32:33,190 INFO L226 Difference]: Without dead ends: 16323 [2019-12-18 16:32:33,190 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 16:32:33,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16323 states. [2019-12-18 16:32:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16323 to 16073. [2019-12-18 16:32:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16073 states. [2019-12-18 16:32:33,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16073 states to 16073 states and 47295 transitions. [2019-12-18 16:32:33,404 INFO L78 Accepts]: Start accepts. Automaton has 16073 states and 47295 transitions. Word has length 41 [2019-12-18 16:32:33,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:33,405 INFO L462 AbstractCegarLoop]: Abstraction has 16073 states and 47295 transitions. [2019-12-18 16:32:33,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:32:33,405 INFO L276 IsEmpty]: Start isEmpty. Operand 16073 states and 47295 transitions. [2019-12-18 16:32:33,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 16:32:33,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:33,420 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] [2019-12-18 16:32:33,420 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:33,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:33,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1875088873, now seen corresponding path program 1 times [2019-12-18 16:32:33,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:33,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026156592] [2019-12-18 16:32:33,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:33,498 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 16:32:33,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026156592] [2019-12-18 16:32:33,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:33,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:32:33,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475788583] [2019-12-18 16:32:33,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:32:33,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:33,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:32:33,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:32:33,500 INFO L87 Difference]: Start difference. First operand 16073 states and 47295 transitions. Second operand 6 states. [2019-12-18 16:32:33,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:33,605 INFO L93 Difference]: Finished difference Result 14802 states and 44567 transitions. [2019-12-18 16:32:33,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:32:33,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 16:32:33,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:33,631 INFO L225 Difference]: With dead ends: 14802 [2019-12-18 16:32:33,631 INFO L226 Difference]: Without dead ends: 14673 [2019-12-18 16:32:33,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:32:33,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14673 states. [2019-12-18 16:32:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14673 to 13253. [2019-12-18 16:32:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13253 states. [2019-12-18 16:32:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13253 states to 13253 states and 40241 transitions. [2019-12-18 16:32:33,920 INFO L78 Accepts]: Start accepts. Automaton has 13253 states and 40241 transitions. Word has length 42 [2019-12-18 16:32:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:33,921 INFO L462 AbstractCegarLoop]: Abstraction has 13253 states and 40241 transitions. [2019-12-18 16:32:33,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:32:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 13253 states and 40241 transitions. [2019-12-18 16:32:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:32:33,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:33,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:32:33,940 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:33,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:33,940 INFO L82 PathProgramCache]: Analyzing trace with hash 208708978, now seen corresponding path program 1 times [2019-12-18 16:32:33,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:33,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346155190] [2019-12-18 16:32:33,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:34,029 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 16:32:34,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346155190] [2019-12-18 16:32:34,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:34,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:32:34,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533898110] [2019-12-18 16:32:34,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:32:34,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:34,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:32:34,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:32:34,031 INFO L87 Difference]: Start difference. First operand 13253 states and 40241 transitions. Second operand 3 states. [2019-12-18 16:32:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:34,125 INFO L93 Difference]: Finished difference Result 15934 states and 48414 transitions. [2019-12-18 16:32:34,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:32:34,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 16:32:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:34,145 INFO L225 Difference]: With dead ends: 15934 [2019-12-18 16:32:34,145 INFO L226 Difference]: Without dead ends: 15934 [2019-12-18 16:32:34,146 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 16:32:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15934 states. [2019-12-18 16:32:34,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15934 to 12716. [2019-12-18 16:32:34,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12716 states. [2019-12-18 16:32:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12716 states to 12716 states and 38916 transitions. [2019-12-18 16:32:34,351 INFO L78 Accepts]: Start accepts. Automaton has 12716 states and 38916 transitions. Word has length 66 [2019-12-18 16:32:34,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:34,351 INFO L462 AbstractCegarLoop]: Abstraction has 12716 states and 38916 transitions. [2019-12-18 16:32:34,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:32:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 12716 states and 38916 transitions. [2019-12-18 16:32:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:32:34,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:34,364 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:32:34,364 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:34,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:34,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1405178173, now seen corresponding path program 1 times [2019-12-18 16:32:34,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:34,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606530457] [2019-12-18 16:32:34,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:34,464 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 16:32:34,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606530457] [2019-12-18 16:32:34,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:34,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:32:34,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369040798] [2019-12-18 16:32:34,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:32:34,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:34,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:32:34,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:32:34,466 INFO L87 Difference]: Start difference. First operand 12716 states and 38916 transitions. Second operand 8 states. [2019-12-18 16:32:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:35,544 INFO L93 Difference]: Finished difference Result 52854 states and 158370 transitions. [2019-12-18 16:32:35,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:32:35,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-18 16:32:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:35,622 INFO L225 Difference]: With dead ends: 52854 [2019-12-18 16:32:35,622 INFO L226 Difference]: Without dead ends: 38614 [2019-12-18 16:32:35,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 16:32:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38614 states. [2019-12-18 16:32:36,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38614 to 15312. [2019-12-18 16:32:36,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15312 states. [2019-12-18 16:32:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15312 states to 15312 states and 46947 transitions. [2019-12-18 16:32:36,063 INFO L78 Accepts]: Start accepts. Automaton has 15312 states and 46947 transitions. Word has length 67 [2019-12-18 16:32:36,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:36,063 INFO L462 AbstractCegarLoop]: Abstraction has 15312 states and 46947 transitions. [2019-12-18 16:32:36,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:32:36,064 INFO L276 IsEmpty]: Start isEmpty. Operand 15312 states and 46947 transitions. [2019-12-18 16:32:36,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:32:36,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:36,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:32:36,078 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:36,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:36,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1914727739, now seen corresponding path program 2 times [2019-12-18 16:32:36,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:36,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635152023] [2019-12-18 16:32:36,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:36,140 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 16:32:36,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635152023] [2019-12-18 16:32:36,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:36,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:32:36,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966712862] [2019-12-18 16:32:36,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:32:36,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:36,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:32:36,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:32:36,144 INFO L87 Difference]: Start difference. First operand 15312 states and 46947 transitions. Second operand 4 states. [2019-12-18 16:32:36,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:36,248 INFO L93 Difference]: Finished difference Result 15140 states and 46276 transitions. [2019-12-18 16:32:36,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:32:36,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-18 16:32:36,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:36,274 INFO L225 Difference]: With dead ends: 15140 [2019-12-18 16:32:36,274 INFO L226 Difference]: Without dead ends: 15140 [2019-12-18 16:32:36,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 16:32:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15140 states. [2019-12-18 16:32:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15140 to 14042. [2019-12-18 16:32:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14042 states. [2019-12-18 16:32:36,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14042 states to 14042 states and 42871 transitions. [2019-12-18 16:32:36,499 INFO L78 Accepts]: Start accepts. Automaton has 14042 states and 42871 transitions. Word has length 67 [2019-12-18 16:32:36,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:36,499 INFO L462 AbstractCegarLoop]: Abstraction has 14042 states and 42871 transitions. [2019-12-18 16:32:36,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:32:36,499 INFO L276 IsEmpty]: Start isEmpty. Operand 14042 states and 42871 transitions. [2019-12-18 16:32:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:32:36,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:36,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:32:36,516 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:36,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:36,516 INFO L82 PathProgramCache]: Analyzing trace with hash 817808390, now seen corresponding path program 1 times [2019-12-18 16:32:36,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:36,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069751560] [2019-12-18 16:32:36,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:32:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:32:36,665 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:32:36,665 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:32:36,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L827: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= v_~z$r_buff1_thd1~0_114 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~z$r_buff0_thd3~0_325) (= v_~z$mem_tmp~0_16 0) (= 0 v_~z$r_buff1_thd3~0_218) (= |v_#NULL.offset_3| 0) (= v_~z$read_delayed~0_8 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t409~0.base_44| 4)) (= 0 v_~weak$$choice0~0_15) (= v_~z$w_buff1~0_167 0) (= v_~z$r_buff0_thd0~0_136 0) (= v_~x~0_84 0) (= v_~z$r_buff0_thd1~0_185 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_46) (= 0 v_~weak$$choice2~0_93) (= 0 v_~__unbuffered_p1_EAX~0_60) (= v_~z$w_buff0~0_229 0) (= 0 v_~__unbuffered_p0_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_63) (= v_~z$r_buff0_thd2~0_132 0) (= v_~z~0_167 0) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t409~0.base_44| 1)) (= v_~main$tmp_guard0~0_44 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t409~0.base_44| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t409~0.base_44|) |v_ULTIMATE.start_main_~#t409~0.offset_30| 0)) |v_#memory_int_21|) (= v_~y~0_39 0) (= v_~z$w_buff1_used~0_386 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t409~0.base_44|) (= (select .cse0 |v_ULTIMATE.start_main_~#t409~0.base_44|) 0) (= v_~__unbuffered_p2_EBX~0_54 0) (= v_~z$r_buff1_thd0~0_148 0) (= 0 |v_#NULL.base_3|) (= v_~z$w_buff0_used~0_680 0) (= v_~z$r_buff1_thd2~0_108 0) (= 0 |v_ULTIMATE.start_main_~#t409~0.offset_30|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t411~0.base=|v_ULTIMATE.start_main_~#t411~0.base_24|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_108, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_86|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_44|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_140|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_82|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_136, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_95, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_~#t410~0.offset=|v_ULTIMATE.start_main_~#t410~0.offset_30|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_11|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t410~0.base=|v_ULTIMATE.start_main_~#t410~0.base_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_114, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_325, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~x~0=v_~x~0_84, ULTIMATE.start_main_~#t409~0.base=|v_ULTIMATE.start_main_~#t409~0.base_44|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_103|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_42|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_148, ULTIMATE.start_main_~#t409~0.offset=|v_ULTIMATE.start_main_~#t409~0.offset_30|, ULTIMATE.start_main_~#t411~0.offset=|v_ULTIMATE.start_main_~#t411~0.offset_19|, ~y~0=v_~y~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_132, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_680, ~z$w_buff0~0=v_~z$w_buff0~0_229, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_218, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_93, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_185} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t411~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t410~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t410~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t409~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t409~0.offset, ULTIMATE.start_main_~#t411~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:32:36,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L748: Formula: (and (= ~z$r_buff1_thd2~0_Out42487028 ~z$r_buff0_thd2~0_In42487028) (= ~z$r_buff0_thd3~0_In42487028 ~z$r_buff1_thd3~0_Out42487028) (= 1 ~z$r_buff0_thd1~0_Out42487028) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In42487028 0)) (= ~z$r_buff1_thd0~0_Out42487028 ~z$r_buff0_thd0~0_In42487028) (= ~z$r_buff0_thd1~0_In42487028 ~z$r_buff1_thd1~0_Out42487028) (= ~__unbuffered_p0_EAX~0_Out42487028 ~x~0_In42487028)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In42487028, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In42487028, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In42487028, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In42487028, ~x~0=~x~0_In42487028, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In42487028} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out42487028, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In42487028, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out42487028, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out42487028, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out42487028, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out42487028, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In42487028, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In42487028, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out42487028, ~x~0=~x~0_In42487028, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In42487028} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:32:36,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L827-1-->L829: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t410~0.base_13|) 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t410~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t410~0.base_13| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t410~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t410~0.base_13|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t410~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t410~0.base_13|) |v_ULTIMATE.start_main_~#t410~0.offset_11| 1))) (= |v_ULTIMATE.start_main_~#t410~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t410~0.offset=|v_ULTIMATE.start_main_~#t410~0.offset_11|, ULTIMATE.start_main_~#t410~0.base=|v_ULTIMATE.start_main_~#t410~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t410~0.offset, ULTIMATE.start_main_~#t410~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 16:32:36,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-2-->L768-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork2_#t~ite10_Out-1228899801| |P1Thread1of1ForFork2_#t~ite9_Out-1228899801|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1228899801 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1228899801 256)))) (or (and (not .cse0) .cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out-1228899801| ~z$w_buff1~0_In-1228899801) (not .cse2)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1228899801| ~z~0_In-1228899801) .cse1 (or .cse2 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1228899801, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1228899801, ~z$w_buff1~0=~z$w_buff1~0_In-1228899801, ~z~0=~z~0_In-1228899801} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1228899801|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1228899801, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1228899801|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1228899801, ~z$w_buff1~0=~z$w_buff1~0_In-1228899801, ~z~0=~z~0_In-1228899801} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 16:32:36,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-908365916 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-908365916 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-908365916| ~z$w_buff0_used~0_In-908365916) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-908365916|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-908365916, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-908365916} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-908365916, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-908365916|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-908365916} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 16:32:36,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In642290425 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In642290425 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In642290425 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In642290425 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out642290425| ~z$w_buff1_used~0_In642290425) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out642290425| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In642290425, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In642290425, ~z$w_buff1_used~0=~z$w_buff1_used~0_In642290425, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In642290425} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In642290425, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In642290425, ~z$w_buff1_used~0=~z$w_buff1_used~0_In642290425, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out642290425|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In642290425} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 16:32:36,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L829-1-->L831: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t411~0.base_10|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t411~0.base_10|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t411~0.base_10| 1)) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t411~0.base_10|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t411~0.base_10| 4) |v_#length_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t411~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t411~0.base_10|) |v_ULTIMATE.start_main_~#t411~0.offset_9| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t411~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t411~0.base=|v_ULTIMATE.start_main_~#t411~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t411~0.offset=|v_ULTIMATE.start_main_~#t411~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t411~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t411~0.offset, #length] because there is no mapped edge [2019-12-18 16:32:36,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L793-->L793-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1149227264 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In-1149227264| |P2Thread1of1ForFork0_#t~ite20_Out-1149227264|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out-1149227264| ~z$w_buff0~0_In-1149227264)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1149227264 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-1149227264 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1149227264 256)) (and (= (mod ~z$w_buff1_used~0_In-1149227264 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite20_Out-1149227264| ~z$w_buff0~0_In-1149227264) (= |P2Thread1of1ForFork0_#t~ite21_Out-1149227264| |P2Thread1of1ForFork0_#t~ite20_Out-1149227264|) .cse0))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1149227264, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1149227264, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1149227264, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1149227264, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1149227264, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1149227264|, ~weak$$choice2~0=~weak$$choice2~0_In-1149227264} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1149227264|, ~z$w_buff0~0=~z$w_buff0~0_In-1149227264, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1149227264, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1149227264, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1149227264, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1149227264, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1149227264|, ~weak$$choice2~0=~weak$$choice2~0_In-1149227264} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 16:32:36,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L794-->L794-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-742463499 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_In-742463499| |P2Thread1of1ForFork0_#t~ite23_Out-742463499|) (not .cse0) (= ~z$w_buff1~0_In-742463499 |P2Thread1of1ForFork0_#t~ite24_Out-742463499|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out-742463499| |P2Thread1of1ForFork0_#t~ite24_Out-742463499|) (= ~z$w_buff1~0_In-742463499 |P2Thread1of1ForFork0_#t~ite23_Out-742463499|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-742463499 256)))) (or (= (mod ~z$w_buff0_used~0_In-742463499 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-742463499 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-742463499 256)))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-742463499, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-742463499, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-742463499|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-742463499, ~z$w_buff1~0=~z$w_buff1~0_In-742463499, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-742463499, ~weak$$choice2~0=~weak$$choice2~0_In-742463499} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-742463499, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-742463499|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-742463499, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-742463499|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-742463499, ~z$w_buff1~0=~z$w_buff1~0_In-742463499, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-742463499, ~weak$$choice2~0=~weak$$choice2~0_In-742463499} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 16:32:36,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L797-->L798: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_160 v_~z$r_buff0_thd3~0_161)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_161, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_8|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_160, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_12|, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 16:32:36,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L800-->L804: Formula: (and (= v_~z~0_54 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 16:32:36,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L804-2-->L804-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In614618866 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In614618866 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out614618866| ~z~0_In614618866)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out614618866| ~z$w_buff1~0_In614618866) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In614618866, ~z$w_buff1_used~0=~z$w_buff1_used~0_In614618866, ~z$w_buff1~0=~z$w_buff1~0_In614618866, ~z~0=~z~0_In614618866} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out614618866|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In614618866, ~z$w_buff1_used~0=~z$w_buff1_used~0_In614618866, ~z$w_buff1~0=~z$w_buff1~0_In614618866, ~z~0=~z~0_In614618866} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 16:32:36,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L804-4-->L805: Formula: (= v_~z~0_30 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|, ~z~0=v_~z~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-18 16:32:36,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-379319578 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-379319578 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-379319578|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-379319578 |P2Thread1of1ForFork0_#t~ite40_Out-379319578|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-379319578, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-379319578} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-379319578, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-379319578|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-379319578} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 16:32:36,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1497367153 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1497367153 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-1497367153 |P1Thread1of1ForFork2_#t~ite13_Out-1497367153|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1497367153|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1497367153, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1497367153} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1497367153, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1497367153|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1497367153} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 16:32:36,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1321669729 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1321669729 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1321669729|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1321669729 |P0Thread1of1ForFork1_#t~ite5_Out1321669729|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1321669729, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1321669729} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1321669729|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1321669729, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1321669729} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 16:32:36,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1718619258 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1718619258 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1718619258 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In1718619258 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out1718619258| ~z$w_buff1_used~0_In1718619258) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out1718619258| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1718619258, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1718619258, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1718619258, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1718619258} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1718619258, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1718619258|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1718619258, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1718619258, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1718619258} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 16:32:36,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L751-->L752: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2138072958 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In2138072958 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out2138072958 ~z$r_buff0_thd1~0_In2138072958)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out2138072958 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2138072958, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2138072958} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2138072958, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2138072958|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2138072958} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:32:36,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2070966984 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-2070966984 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2070966984 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-2070966984 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-2070966984|)) (and (= ~z$r_buff1_thd1~0_In-2070966984 |P0Thread1of1ForFork1_#t~ite8_Out-2070966984|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2070966984, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2070966984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2070966984, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2070966984} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-2070966984|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2070966984, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2070966984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2070966984, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2070966984} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 16:32:36,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L752-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_77 |v_P0Thread1of1ForFork1_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_23|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_77, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:32:36,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L806-->L806-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In472045153 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In472045153 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In472045153 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In472045153 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out472045153| ~z$w_buff1_used~0_In472045153) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite41_Out472045153| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In472045153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In472045153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In472045153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In472045153} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In472045153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In472045153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In472045153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In472045153, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out472045153|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 16:32:36,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1478266112 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1478266112 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out1478266112| ~z$r_buff0_thd3~0_In1478266112) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1478266112| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1478266112, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1478266112} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1478266112, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1478266112, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1478266112|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 16:32:36,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1401527786 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1401527786 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1401527786 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1401527786 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In1401527786 |P2Thread1of1ForFork0_#t~ite43_Out1401527786|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1401527786|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1401527786, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1401527786, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1401527786, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1401527786} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1401527786|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1401527786, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1401527786, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1401527786, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1401527786} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 16:32:36,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L808-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= v_~z$r_buff1_thd3~0_131 |v_P2Thread1of1ForFork0_#t~ite43_26|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 16:32:36,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-59984649 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-59984649 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-59984649 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-59984649 256) 0))) (or (and (= ~z$r_buff1_thd2~0_In-59984649 |P1Thread1of1ForFork2_#t~ite14_Out-59984649|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-59984649|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-59984649, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-59984649, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-59984649, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-59984649} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-59984649, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-59984649, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-59984649, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-59984649|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-59984649} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 16:32:36,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L772-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P1Thread1of1ForFork2_#t~ite14_26| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_26|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_25|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 16:32:36,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L835-->L837-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_51 256)) (= 0 (mod v_~z$w_buff0_used~0_293 256))) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 16:32:36,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L837-2-->L837-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1017164919 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1017164919 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1017164919| ~z$w_buff1~0_In-1017164919) (not .cse1)) (and (= ~z~0_In-1017164919 |ULTIMATE.start_main_#t~ite47_Out-1017164919|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1017164919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1017164919, ~z$w_buff1~0=~z$w_buff1~0_In-1017164919, ~z~0=~z~0_In-1017164919} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1017164919, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1017164919|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1017164919, ~z$w_buff1~0=~z$w_buff1~0_In-1017164919, ~z~0=~z~0_In-1017164919} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 16:32:36,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L837-4-->L838: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_14|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-18 16:32:36,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In809597669 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In809597669 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out809597669| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out809597669| ~z$w_buff0_used~0_In809597669) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In809597669, ~z$w_buff0_used~0=~z$w_buff0_used~0_In809597669} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In809597669, ~z$w_buff0_used~0=~z$w_buff0_used~0_In809597669, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out809597669|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 16:32:36,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-63676668 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-63676668 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-63676668 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-63676668 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-63676668| 0)) (and (= |ULTIMATE.start_main_#t~ite50_Out-63676668| ~z$w_buff1_used~0_In-63676668) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-63676668, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-63676668, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-63676668, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-63676668} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-63676668|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-63676668, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-63676668, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-63676668, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-63676668} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 16:32:36,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In670993497 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In670993497 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out670993497| 0)) (and (= ~z$r_buff0_thd0~0_In670993497 |ULTIMATE.start_main_#t~ite51_Out670993497|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In670993497, ~z$w_buff0_used~0=~z$w_buff0_used~0_In670993497} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In670993497, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out670993497|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In670993497} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 16:32:36,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-595031217 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-595031217 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-595031217 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-595031217 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-595031217 |ULTIMATE.start_main_#t~ite52_Out-595031217|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-595031217| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-595031217, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-595031217, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-595031217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-595031217} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-595031217|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-595031217, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-595031217, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-595031217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-595031217} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 16:32:36,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L841-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p0_EAX~0_72) (= v_~z$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_~__unbuffered_p2_EBX~0_32 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~main$tmp_guard1~0_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:32:36,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:32:36 BasicIcfg [2019-12-18 16:32:36,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:32:36,801 INFO L168 Benchmark]: Toolchain (without parser) took 171015.86 ms. Allocated memory was 137.4 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 101.0 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 16:32:36,802 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 16:32:36,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.71 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.6 MB in the beginning and 154.9 MB in the end (delta: -54.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-18 16:32:36,803 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.81 ms. Allocated memory is still 201.3 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:32:36,803 INFO L168 Benchmark]: Boogie Preprocessor took 37.85 ms. Allocated memory is still 201.3 MB. Free memory was 152.2 MB in the beginning and 149.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:32:36,803 INFO L168 Benchmark]: RCFGBuilder took 854.86 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 99.2 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 16:32:36,804 INFO L168 Benchmark]: TraceAbstraction took 169254.33 ms. Allocated memory was 201.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 16:32:36,807 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.46 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 798.71 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.6 MB in the beginning and 154.9 MB in the end (delta: -54.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.81 ms. Allocated memory is still 201.3 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.85 ms. Allocated memory is still 201.3 MB. Free memory was 152.2 MB in the beginning and 149.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 854.86 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 99.2 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 169254.33 ms. Allocated memory was 201.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 7082 VarBasedMoverChecksPositive, 219 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 89688 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L827] FCALL, FORK 0 pthread_create(&t409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L829] FCALL, FORK 0 pthread_create(&t410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L762] 2 x = 1 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L768] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L768] 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) [L769] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L831] FCALL, FORK 0 pthread_create(&t411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 [L785] 3 __unbuffered_p2_EAX = y [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 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 [L771] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] 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_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 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) [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 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 [L805] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L806] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L807] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L838] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L839] 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 [L840] 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 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 168.9s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 58.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4239 SDtfs, 4761 SDslu, 7783 SDs, 0 SdLazy, 4151 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 35 SyntacticMatches, 14 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183252occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 85.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 256683 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 781 NumberOfCodeBlocks, 781 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 690 ConstructedInterpolants, 0 QuantifiedInterpolants, 89534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...