/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/mix006_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:13:57,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:13:57,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:13:57,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:13:57,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:13:57,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:13:57,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:13:57,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:13:57,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:13:57,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:13:57,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:13:57,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:13:57,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:13:57,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:13:57,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:13:57,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:13:57,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:13:57,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:13:57,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:13:57,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:13:57,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:13:57,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:13:57,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:13:57,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:13:57,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:13:57,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:13:57,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:13:57,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:13:57,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:13:57,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:13:57,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:13:57,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:13:57,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:13:57,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:13:57,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:13:57,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:13:57,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:13:57,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:13:57,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:13:57,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:13:57,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:13:57,506 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:13:57,527 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:13:57,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:13:57,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:13:57,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:13:57,529 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:13:57,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:13:57,530 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:13:57,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:13:57,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:13:57,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:13:57,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:13:57,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:13:57,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:13:57,531 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:13:57,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:13:57,531 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:13:57,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:13:57,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:13:57,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:13:57,533 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:13:57,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:13:57,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:13:57,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:13:57,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:13:57,534 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:13:57,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:13:57,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:13:57,535 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:13:57,535 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:13:57,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:13:57,851 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:13:57,854 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:13:57,856 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:13:57,856 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:13:57,857 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i [2019-12-27 01:13:57,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d0b6c79/0f5ac49438134df1b77989f1f1f9fd8d/FLAG5a319608f [2019-12-27 01:13:58,520 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:13:58,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i [2019-12-27 01:13:58,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d0b6c79/0f5ac49438134df1b77989f1f1f9fd8d/FLAG5a319608f [2019-12-27 01:13:58,781 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d0b6c79/0f5ac49438134df1b77989f1f1f9fd8d [2019-12-27 01:13:58,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:13:58,793 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:13:58,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:13:58,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:13:58,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:13:58,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:13:58" (1/1) ... [2019-12-27 01:13:58,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1335d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:58, skipping insertion in model container [2019-12-27 01:13:58,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:13:58" (1/1) ... [2019-12-27 01:13:58,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:13:58,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:13:59,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:13:59,435 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:13:59,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:13:59,591 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:13:59,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:59 WrapperNode [2019-12-27 01:13:59,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:13:59,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:13:59,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:13:59,593 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:13:59,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:59" (1/1) ... [2019-12-27 01:13:59,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:59" (1/1) ... [2019-12-27 01:13:59,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:13:59,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:13:59,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:13:59,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:13:59,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:59" (1/1) ... [2019-12-27 01:13:59,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:59" (1/1) ... [2019-12-27 01:13:59,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:59" (1/1) ... [2019-12-27 01:13:59,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:59" (1/1) ... [2019-12-27 01:13:59,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:59" (1/1) ... [2019-12-27 01:13:59,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:59" (1/1) ... [2019-12-27 01:13:59,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:59" (1/1) ... [2019-12-27 01:13:59,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:13:59,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:13:59,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:13:59,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:13:59,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:13:59,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:13:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:13:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:13:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:13:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:13:59,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:13:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:13:59,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:13:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:13:59,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:13:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:13:59,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:13:59,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:13:59,792 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:14:00,575 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:14:00,575 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:14:00,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:14:00 BoogieIcfgContainer [2019-12-27 01:14:00,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:14:00,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:14:00,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:14:00,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:14:00,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:13:58" (1/3) ... [2019-12-27 01:14:00,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703496aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:14:00, skipping insertion in model container [2019-12-27 01:14:00,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:59" (2/3) ... [2019-12-27 01:14:00,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703496aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:14:00, skipping insertion in model container [2019-12-27 01:14:00,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:14:00" (3/3) ... [2019-12-27 01:14:00,585 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_pso.oepc.i [2019-12-27 01:14:00,596 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:14:00,596 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:14:00,604 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:14:00,605 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:14:00,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,648 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,648 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,649 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,649 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,649 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,658 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,658 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,683 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,684 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,711 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,713 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,720 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,723 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,723 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:14:00,739 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:14:00,760 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:14:00,760 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:14:00,760 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:14:00,760 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:14:00,760 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:14:00,760 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:14:00,761 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:14:00,761 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:14:00,777 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 01:14:00,779 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 01:14:00,910 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 01:14:00,910 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:14:00,927 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. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:14:00,949 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 01:14:01,008 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 01:14:01,009 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:14:01,015 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. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:14:01,036 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:14:01,037 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:14:06,564 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 01:14:06,686 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 01:14:06,715 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78628 [2019-12-27 01:14:06,716 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 01:14:06,720 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 01:14:24,643 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 110182 states. [2019-12-27 01:14:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 110182 states. [2019-12-27 01:14:24,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:14:24,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:24,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:14:24,653 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-27 01:14:24,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:24,661 INFO L82 PathProgramCache]: Analyzing trace with hash 917838, now seen corresponding path program 1 times [2019-12-27 01:14:24,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:24,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325237069] [2019-12-27 01:14:24,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:24,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:24,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325237069] [2019-12-27 01:14:24,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:24,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:14:24,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25097664] [2019-12-27 01:14:24,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:14:24,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:24,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:14:24,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:14:24,922 INFO L87 Difference]: Start difference. First operand 110182 states. Second operand 3 states. [2019-12-27 01:14:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:28,298 INFO L93 Difference]: Finished difference Result 109312 states and 463550 transitions. [2019-12-27 01:14:28,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:14:28,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:14:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:28,905 INFO L225 Difference]: With dead ends: 109312 [2019-12-27 01:14:28,905 INFO L226 Difference]: Without dead ends: 102592 [2019-12-27 01:14:28,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:14:33,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102592 states. [2019-12-27 01:14:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102592 to 102592. [2019-12-27 01:14:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102592 states. [2019-12-27 01:14:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102592 states to 102592 states and 434430 transitions. [2019-12-27 01:14:40,191 INFO L78 Accepts]: Start accepts. Automaton has 102592 states and 434430 transitions. Word has length 3 [2019-12-27 01:14:40,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:40,191 INFO L462 AbstractCegarLoop]: Abstraction has 102592 states and 434430 transitions. [2019-12-27 01:14:40,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:14:40,191 INFO L276 IsEmpty]: Start isEmpty. Operand 102592 states and 434430 transitions. [2019-12-27 01:14:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:14:40,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:40,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:14:40,195 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-27 01:14:40,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:40,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1857942485, now seen corresponding path program 1 times [2019-12-27 01:14:40,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:40,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773653443] [2019-12-27 01:14:40,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:40,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773653443] [2019-12-27 01:14:40,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:40,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:14:40,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090864532] [2019-12-27 01:14:40,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:14:40,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:40,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:14:40,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:14:40,343 INFO L87 Difference]: Start difference. First operand 102592 states and 434430 transitions. Second operand 4 states. [2019-12-27 01:14:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:45,938 INFO L93 Difference]: Finished difference Result 159508 states and 648686 transitions. [2019-12-27 01:14:45,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:14:45,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:14:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:46,695 INFO L225 Difference]: With dead ends: 159508 [2019-12-27 01:14:46,696 INFO L226 Difference]: Without dead ends: 159459 [2019-12-27 01:14:46,697 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-27 01:14:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159459 states. [2019-12-27 01:14:54,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159459 to 146095. [2019-12-27 01:14:54,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146095 states. [2019-12-27 01:14:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146095 states to 146095 states and 601450 transitions. [2019-12-27 01:14:55,360 INFO L78 Accepts]: Start accepts. Automaton has 146095 states and 601450 transitions. Word has length 11 [2019-12-27 01:14:55,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:55,361 INFO L462 AbstractCegarLoop]: Abstraction has 146095 states and 601450 transitions. [2019-12-27 01:14:55,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:14:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 146095 states and 601450 transitions. [2019-12-27 01:14:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:14:55,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:55,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:14:55,369 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-27 01:14:55,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:55,369 INFO L82 PathProgramCache]: Analyzing trace with hash 230844073, now seen corresponding path program 1 times [2019-12-27 01:14:55,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:55,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839801920] [2019-12-27 01:14:55,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:55,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839801920] [2019-12-27 01:14:55,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:55,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:14:55,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837523049] [2019-12-27 01:14:55,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:14:55,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:55,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:14:55,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:14:55,429 INFO L87 Difference]: Start difference. First operand 146095 states and 601450 transitions. Second operand 3 states. [2019-12-27 01:14:55,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:55,565 INFO L93 Difference]: Finished difference Result 32284 states and 104220 transitions. [2019-12-27 01:14:55,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:14:55,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:14:55,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:55,626 INFO L225 Difference]: With dead ends: 32284 [2019-12-27 01:14:55,627 INFO L226 Difference]: Without dead ends: 32284 [2019-12-27 01:14:55,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:14:55,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32284 states. [2019-12-27 01:14:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32284 to 32284. [2019-12-27 01:14:56,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32284 states. [2019-12-27 01:15:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32284 states to 32284 states and 104220 transitions. [2019-12-27 01:15:00,873 INFO L78 Accepts]: Start accepts. Automaton has 32284 states and 104220 transitions. Word has length 13 [2019-12-27 01:15:00,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:00,874 INFO L462 AbstractCegarLoop]: Abstraction has 32284 states and 104220 transitions. [2019-12-27 01:15:00,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:15:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 32284 states and 104220 transitions. [2019-12-27 01:15:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:15:00,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:00,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:15:00,877 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-27 01:15:00,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:00,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1069845708, now seen corresponding path program 1 times [2019-12-27 01:15:00,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:00,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575882970] [2019-12-27 01:15:00,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:00,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575882970] [2019-12-27 01:15:00,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:00,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:15:00,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512856136] [2019-12-27 01:15:00,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:15:00,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:00,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:15:00,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:15:00,973 INFO L87 Difference]: Start difference. First operand 32284 states and 104220 transitions. Second operand 4 states. [2019-12-27 01:15:01,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:01,322 INFO L93 Difference]: Finished difference Result 40215 states and 129418 transitions. [2019-12-27 01:15:01,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:15:01,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:15:01,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:01,383 INFO L225 Difference]: With dead ends: 40215 [2019-12-27 01:15:01,384 INFO L226 Difference]: Without dead ends: 40215 [2019-12-27 01:15:01,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:15:01,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40215 states. [2019-12-27 01:15:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40215 to 36090. [2019-12-27 01:15:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36090 states. [2019-12-27 01:15:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36090 states to 36090 states and 116495 transitions. [2019-12-27 01:15:02,023 INFO L78 Accepts]: Start accepts. Automaton has 36090 states and 116495 transitions. Word has length 16 [2019-12-27 01:15:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:02,027 INFO L462 AbstractCegarLoop]: Abstraction has 36090 states and 116495 transitions. [2019-12-27 01:15:02,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:15:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 36090 states and 116495 transitions. [2019-12-27 01:15:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:15:02,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:02,055 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-27 01:15:02,055 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-27 01:15:02,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:02,055 INFO L82 PathProgramCache]: Analyzing trace with hash 6986775, now seen corresponding path program 1 times [2019-12-27 01:15:02,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:02,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768805249] [2019-12-27 01:15:02,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:02,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768805249] [2019-12-27 01:15:02,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:02,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:15:02,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190462336] [2019-12-27 01:15:02,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:15:02,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:02,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:15:02,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:15:02,216 INFO L87 Difference]: Start difference. First operand 36090 states and 116495 transitions. Second operand 5 states. [2019-12-27 01:15:02,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:02,848 INFO L93 Difference]: Finished difference Result 46566 states and 147831 transitions. [2019-12-27 01:15:02,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:15:02,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:15:02,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:02,939 INFO L225 Difference]: With dead ends: 46566 [2019-12-27 01:15:02,939 INFO L226 Difference]: Without dead ends: 46559 [2019-12-27 01:15:02,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:15:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46559 states. [2019-12-27 01:15:03,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46559 to 35784. [2019-12-27 01:15:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2019-12-27 01:15:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 115349 transitions. [2019-12-27 01:15:03,953 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 115349 transitions. Word has length 22 [2019-12-27 01:15:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:03,953 INFO L462 AbstractCegarLoop]: Abstraction has 35784 states and 115349 transitions. [2019-12-27 01:15:03,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:15:03,955 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 115349 transitions. [2019-12-27 01:15:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:15:03,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:03,967 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-27 01:15:03,967 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-27 01:15:03,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:03,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1437372217, now seen corresponding path program 1 times [2019-12-27 01:15:03,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:03,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286357257] [2019-12-27 01:15:03,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:04,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286357257] [2019-12-27 01:15:04,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:04,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:15:04,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395715432] [2019-12-27 01:15:04,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:15:04,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:04,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:15:04,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:15:04,034 INFO L87 Difference]: Start difference. First operand 35784 states and 115349 transitions. Second operand 4 states. [2019-12-27 01:15:04,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:04,093 INFO L93 Difference]: Finished difference Result 14498 states and 44125 transitions. [2019-12-27 01:15:04,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:15:04,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:15:04,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:04,115 INFO L225 Difference]: With dead ends: 14498 [2019-12-27 01:15:04,115 INFO L226 Difference]: Without dead ends: 14498 [2019-12-27 01:15:04,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:15:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2019-12-27 01:15:04,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 14254. [2019-12-27 01:15:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14254 states. [2019-12-27 01:15:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14254 states to 14254 states and 43429 transitions. [2019-12-27 01:15:04,332 INFO L78 Accepts]: Start accepts. Automaton has 14254 states and 43429 transitions. Word has length 25 [2019-12-27 01:15:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:04,332 INFO L462 AbstractCegarLoop]: Abstraction has 14254 states and 43429 transitions. [2019-12-27 01:15:04,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:15:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states and 43429 transitions. [2019-12-27 01:15:04,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:15:04,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:04,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:15:04,344 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-27 01:15:04,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:04,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1947963172, now seen corresponding path program 1 times [2019-12-27 01:15:04,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:04,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133820833] [2019-12-27 01:15:04,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:04,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133820833] [2019-12-27 01:15:04,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:04,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:15:04,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510473162] [2019-12-27 01:15:04,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:15:04,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:04,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:15:04,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:15:04,455 INFO L87 Difference]: Start difference. First operand 14254 states and 43429 transitions. Second operand 6 states. [2019-12-27 01:15:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:05,177 INFO L93 Difference]: Finished difference Result 39008 states and 118911 transitions. [2019-12-27 01:15:05,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:15:05,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 01:15:05,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:05,234 INFO L225 Difference]: With dead ends: 39008 [2019-12-27 01:15:05,234 INFO L226 Difference]: Without dead ends: 39008 [2019-12-27 01:15:05,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:15:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39008 states. [2019-12-27 01:15:05,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39008 to 21620. [2019-12-27 01:15:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21620 states. [2019-12-27 01:15:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 66985 transitions. [2019-12-27 01:15:05,855 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 66985 transitions. Word has length 27 [2019-12-27 01:15:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:05,855 INFO L462 AbstractCegarLoop]: Abstraction has 21620 states and 66985 transitions. [2019-12-27 01:15:05,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:15:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 66985 transitions. [2019-12-27 01:15:05,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:15:05,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:05,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:15:05,876 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-27 01:15:05,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:05,876 INFO L82 PathProgramCache]: Analyzing trace with hash -89566793, now seen corresponding path program 1 times [2019-12-27 01:15:05,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:05,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626233980] [2019-12-27 01:15:05,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:05,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:05,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626233980] [2019-12-27 01:15:05,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:05,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:15:05,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762910864] [2019-12-27 01:15:05,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:15:05,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:05,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:15:05,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:15:05,974 INFO L87 Difference]: Start difference. First operand 21620 states and 66985 transitions. Second operand 6 states. [2019-12-27 01:15:06,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:06,747 INFO L93 Difference]: Finished difference Result 43584 states and 132186 transitions. [2019-12-27 01:15:06,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:15:06,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 01:15:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:06,821 INFO L225 Difference]: With dead ends: 43584 [2019-12-27 01:15:06,821 INFO L226 Difference]: Without dead ends: 43584 [2019-12-27 01:15:06,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:15:06,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43584 states. [2019-12-27 01:15:07,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43584 to 21360. [2019-12-27 01:15:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21360 states. [2019-12-27 01:15:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21360 states to 21360 states and 66500 transitions. [2019-12-27 01:15:07,270 INFO L78 Accepts]: Start accepts. Automaton has 21360 states and 66500 transitions. Word has length 28 [2019-12-27 01:15:07,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:07,271 INFO L462 AbstractCegarLoop]: Abstraction has 21360 states and 66500 transitions. [2019-12-27 01:15:07,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:15:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 21360 states and 66500 transitions. [2019-12-27 01:15:07,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:15:07,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:07,293 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-27 01:15:07,294 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-27 01:15:07,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:07,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1720610055, now seen corresponding path program 1 times [2019-12-27 01:15:07,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:07,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997984702] [2019-12-27 01:15:07,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:07,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997984702] [2019-12-27 01:15:07,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:07,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:15:07,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569317639] [2019-12-27 01:15:07,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:15:07,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:07,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:15:07,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:15:07,387 INFO L87 Difference]: Start difference. First operand 21360 states and 66500 transitions. Second operand 7 states. [2019-12-27 01:15:08,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:08,957 INFO L93 Difference]: Finished difference Result 51613 states and 157651 transitions. [2019-12-27 01:15:08,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:15:08,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 01:15:08,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:09,034 INFO L225 Difference]: With dead ends: 51613 [2019-12-27 01:15:09,034 INFO L226 Difference]: Without dead ends: 51613 [2019-12-27 01:15:09,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:15:09,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51613 states. [2019-12-27 01:15:09,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51613 to 23540. [2019-12-27 01:15:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23540 states. [2019-12-27 01:15:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23540 states to 23540 states and 73219 transitions. [2019-12-27 01:15:09,588 INFO L78 Accepts]: Start accepts. Automaton has 23540 states and 73219 transitions. Word has length 33 [2019-12-27 01:15:09,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:09,588 INFO L462 AbstractCegarLoop]: Abstraction has 23540 states and 73219 transitions. [2019-12-27 01:15:09,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:15:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand 23540 states and 73219 transitions. [2019-12-27 01:15:09,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:15:09,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:09,614 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-27 01:15:09,615 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-27 01:15:09,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:09,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1518720007, now seen corresponding path program 2 times [2019-12-27 01:15:09,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:09,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889549495] [2019-12-27 01:15:09,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:09,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:09,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889549495] [2019-12-27 01:15:09,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:09,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:15:09,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413287491] [2019-12-27 01:15:09,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:15:09,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:09,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:15:09,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:15:09,726 INFO L87 Difference]: Start difference. First operand 23540 states and 73219 transitions. Second operand 8 states. [2019-12-27 01:15:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:11,957 INFO L93 Difference]: Finished difference Result 79921 states and 239364 transitions. [2019-12-27 01:15:11,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 01:15:11,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 01:15:11,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:12,113 INFO L225 Difference]: With dead ends: 79921 [2019-12-27 01:15:12,113 INFO L226 Difference]: Without dead ends: 79921 [2019-12-27 01:15:12,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2019-12-27 01:15:12,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79921 states. [2019-12-27 01:15:13,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79921 to 22493. [2019-12-27 01:15:13,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22493 states. [2019-12-27 01:15:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22493 states to 22493 states and 69836 transitions. [2019-12-27 01:15:13,138 INFO L78 Accepts]: Start accepts. Automaton has 22493 states and 69836 transitions. Word has length 33 [2019-12-27 01:15:13,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:13,138 INFO L462 AbstractCegarLoop]: Abstraction has 22493 states and 69836 transitions. [2019-12-27 01:15:13,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:15:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 22493 states and 69836 transitions. [2019-12-27 01:15:13,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:15:13,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:13,164 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-27 01:15:13,164 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-27 01:15:13,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:13,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2146187134, now seen corresponding path program 1 times [2019-12-27 01:15:13,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:13,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106487524] [2019-12-27 01:15:13,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:13,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106487524] [2019-12-27 01:15:13,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:13,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:15:13,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729772586] [2019-12-27 01:15:13,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:15:13,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:13,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:15:13,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:15:13,294 INFO L87 Difference]: Start difference. First operand 22493 states and 69836 transitions. Second operand 7 states. [2019-12-27 01:15:14,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:14,823 INFO L93 Difference]: Finished difference Result 45327 states and 136889 transitions. [2019-12-27 01:15:14,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:15:14,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 01:15:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:14,897 INFO L225 Difference]: With dead ends: 45327 [2019-12-27 01:15:14,897 INFO L226 Difference]: Without dead ends: 45327 [2019-12-27 01:15:14,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:15:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45327 states. [2019-12-27 01:15:15,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45327 to 20305. [2019-12-27 01:15:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20305 states. [2019-12-27 01:15:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20305 states to 20305 states and 63138 transitions. [2019-12-27 01:15:15,372 INFO L78 Accepts]: Start accepts. Automaton has 20305 states and 63138 transitions. Word has length 34 [2019-12-27 01:15:15,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:15,373 INFO L462 AbstractCegarLoop]: Abstraction has 20305 states and 63138 transitions. [2019-12-27 01:15:15,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:15:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 20305 states and 63138 transitions. [2019-12-27 01:15:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:15:15,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:15,391 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-27 01:15:15,391 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-27 01:15:15,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:15,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1401085166, now seen corresponding path program 2 times [2019-12-27 01:15:15,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:15,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083605419] [2019-12-27 01:15:15,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:15,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:15,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083605419] [2019-12-27 01:15:15,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:15,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:15:15,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297038298] [2019-12-27 01:15:15,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:15:15,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:15,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:15:15,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:15:15,507 INFO L87 Difference]: Start difference. First operand 20305 states and 63138 transitions. Second operand 8 states. [2019-12-27 01:15:17,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:17,505 INFO L93 Difference]: Finished difference Result 60447 states and 179980 transitions. [2019-12-27 01:15:17,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 01:15:17,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 01:15:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:17,652 INFO L225 Difference]: With dead ends: 60447 [2019-12-27 01:15:17,652 INFO L226 Difference]: Without dead ends: 60447 [2019-12-27 01:15:17,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2019-12-27 01:15:17,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60447 states. [2019-12-27 01:15:18,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60447 to 18462. [2019-12-27 01:15:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18462 states. [2019-12-27 01:15:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18462 states to 18462 states and 57434 transitions. [2019-12-27 01:15:18,596 INFO L78 Accepts]: Start accepts. Automaton has 18462 states and 57434 transitions. Word has length 34 [2019-12-27 01:15:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:18,597 INFO L462 AbstractCegarLoop]: Abstraction has 18462 states and 57434 transitions. [2019-12-27 01:15:18,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:15:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 18462 states and 57434 transitions. [2019-12-27 01:15:18,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:15:18,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:18,630 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] [2019-12-27 01:15:18,631 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-27 01:15:18,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:18,631 INFO L82 PathProgramCache]: Analyzing trace with hash 342833665, now seen corresponding path program 1 times [2019-12-27 01:15:18,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:18,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16458050] [2019-12-27 01:15:18,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:18,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16458050] [2019-12-27 01:15:18,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:18,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:15:18,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058155731] [2019-12-27 01:15:18,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:15:18,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:18,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:15:18,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:15:18,679 INFO L87 Difference]: Start difference. First operand 18462 states and 57434 transitions. Second operand 3 states. [2019-12-27 01:15:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:18,754 INFO L93 Difference]: Finished difference Result 18461 states and 57432 transitions. [2019-12-27 01:15:18,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:15:18,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:15:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:18,790 INFO L225 Difference]: With dead ends: 18461 [2019-12-27 01:15:18,790 INFO L226 Difference]: Without dead ends: 18461 [2019-12-27 01:15:18,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:15:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18461 states. [2019-12-27 01:15:19,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18461 to 18461. [2019-12-27 01:15:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18461 states. [2019-12-27 01:15:19,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18461 states to 18461 states and 57432 transitions. [2019-12-27 01:15:19,084 INFO L78 Accepts]: Start accepts. Automaton has 18461 states and 57432 transitions. Word has length 39 [2019-12-27 01:15:19,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:19,085 INFO L462 AbstractCegarLoop]: Abstraction has 18461 states and 57432 transitions. [2019-12-27 01:15:19,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:15:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 18461 states and 57432 transitions. [2019-12-27 01:15:19,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:15:19,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:19,108 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] [2019-12-27 01:15:19,108 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-27 01:15:19,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:19,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1054064562, now seen corresponding path program 1 times [2019-12-27 01:15:19,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:19,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367308827] [2019-12-27 01:15:19,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:19,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-27 01:15:19,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367308827] [2019-12-27 01:15:19,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:19,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:15:19,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843141420] [2019-12-27 01:15:19,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:15:19,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:19,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:15:19,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:15:19,156 INFO L87 Difference]: Start difference. First operand 18461 states and 57432 transitions. Second operand 3 states. [2019-12-27 01:15:19,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:19,310 INFO L93 Difference]: Finished difference Result 32125 states and 100306 transitions. [2019-12-27 01:15:19,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:15:19,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 01:15:19,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:19,351 INFO L225 Difference]: With dead ends: 32125 [2019-12-27 01:15:19,352 INFO L226 Difference]: Without dead ends: 16527 [2019-12-27 01:15:19,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:15:19,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16527 states. [2019-12-27 01:15:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16527 to 16461. [2019-12-27 01:15:19,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16461 states. [2019-12-27 01:15:19,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16461 states to 16461 states and 50424 transitions. [2019-12-27 01:15:19,758 INFO L78 Accepts]: Start accepts. Automaton has 16461 states and 50424 transitions. Word has length 40 [2019-12-27 01:15:19,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:19,758 INFO L462 AbstractCegarLoop]: Abstraction has 16461 states and 50424 transitions. [2019-12-27 01:15:19,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:15:19,758 INFO L276 IsEmpty]: Start isEmpty. Operand 16461 states and 50424 transitions. [2019-12-27 01:15:19,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:15:19,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:19,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:15:19,781 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-27 01:15:19,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:19,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1620503104, now seen corresponding path program 2 times [2019-12-27 01:15:19,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:19,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855036645] [2019-12-27 01:15:19,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:19,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855036645] [2019-12-27 01:15:19,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:19,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:15:19,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253956021] [2019-12-27 01:15:19,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:15:19,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:19,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:15:19,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:15:19,852 INFO L87 Difference]: Start difference. First operand 16461 states and 50424 transitions. Second operand 5 states. [2019-12-27 01:15:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:20,040 INFO L93 Difference]: Finished difference Result 15247 states and 47569 transitions. [2019-12-27 01:15:20,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:15:20,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:15:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:20,068 INFO L225 Difference]: With dead ends: 15247 [2019-12-27 01:15:20,068 INFO L226 Difference]: Without dead ends: 13633 [2019-12-27 01:15:20,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:15:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13633 states. [2019-12-27 01:15:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13633 to 13227. [2019-12-27 01:15:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13227 states. [2019-12-27 01:15:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13227 states to 13227 states and 42461 transitions. [2019-12-27 01:15:20,286 INFO L78 Accepts]: Start accepts. Automaton has 13227 states and 42461 transitions. Word has length 40 [2019-12-27 01:15:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:20,287 INFO L462 AbstractCegarLoop]: Abstraction has 13227 states and 42461 transitions. [2019-12-27 01:15:20,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:15:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 13227 states and 42461 transitions. [2019-12-27 01:15:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:15:20,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:20,306 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] [2019-12-27 01:15:20,306 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-27 01:15:20,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:20,306 INFO L82 PathProgramCache]: Analyzing trace with hash -558765540, now seen corresponding path program 1 times [2019-12-27 01:15:20,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:20,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386832496] [2019-12-27 01:15:20,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:20,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386832496] [2019-12-27 01:15:20,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:20,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:15:20,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419813035] [2019-12-27 01:15:20,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:15:20,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:20,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:15:20,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:15:20,451 INFO L87 Difference]: Start difference. First operand 13227 states and 42461 transitions. Second operand 9 states. [2019-12-27 01:15:22,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:22,364 INFO L93 Difference]: Finished difference Result 117215 states and 365774 transitions. [2019-12-27 01:15:22,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 01:15:22,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:15:22,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:22,515 INFO L225 Difference]: With dead ends: 117215 [2019-12-27 01:15:22,515 INFO L226 Difference]: Without dead ends: 85095 [2019-12-27 01:15:22,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=402, Invalid=1238, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 01:15:22,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85095 states. [2019-12-27 01:15:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85095 to 18741. [2019-12-27 01:15:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18741 states. [2019-12-27 01:15:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18741 states to 18741 states and 60743 transitions. [2019-12-27 01:15:23,663 INFO L78 Accepts]: Start accepts. Automaton has 18741 states and 60743 transitions. Word has length 64 [2019-12-27 01:15:23,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:23,664 INFO L462 AbstractCegarLoop]: Abstraction has 18741 states and 60743 transitions. [2019-12-27 01:15:23,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:15:23,664 INFO L276 IsEmpty]: Start isEmpty. Operand 18741 states and 60743 transitions. [2019-12-27 01:15:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:15:23,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:23,684 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] [2019-12-27 01:15:23,684 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-27 01:15:23,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:23,685 INFO L82 PathProgramCache]: Analyzing trace with hash -977893927, now seen corresponding path program 1 times [2019-12-27 01:15:23,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:23,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268394439] [2019-12-27 01:15:23,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:23,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268394439] [2019-12-27 01:15:23,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:23,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:15:23,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038504065] [2019-12-27 01:15:23,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:15:23,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:23,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:15:23,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:15:23,745 INFO L87 Difference]: Start difference. First operand 18741 states and 60743 transitions. Second operand 3 states. [2019-12-27 01:15:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:23,872 INFO L93 Difference]: Finished difference Result 23859 states and 74595 transitions. [2019-12-27 01:15:23,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:15:23,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:15:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:23,919 INFO L225 Difference]: With dead ends: 23859 [2019-12-27 01:15:23,919 INFO L226 Difference]: Without dead ends: 23445 [2019-12-27 01:15:23,920 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-27 01:15:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23445 states. [2019-12-27 01:15:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23445 to 18036. [2019-12-27 01:15:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18036 states. [2019-12-27 01:15:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18036 states to 18036 states and 57595 transitions. [2019-12-27 01:15:24,312 INFO L78 Accepts]: Start accepts. Automaton has 18036 states and 57595 transitions. Word has length 64 [2019-12-27 01:15:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:24,312 INFO L462 AbstractCegarLoop]: Abstraction has 18036 states and 57595 transitions. [2019-12-27 01:15:24,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:15:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 18036 states and 57595 transitions. [2019-12-27 01:15:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:15:24,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:24,333 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] [2019-12-27 01:15:24,333 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-27 01:15:24,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:24,333 INFO L82 PathProgramCache]: Analyzing trace with hash -329697764, now seen corresponding path program 2 times [2019-12-27 01:15:24,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:24,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029236342] [2019-12-27 01:15:24,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:24,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029236342] [2019-12-27 01:15:24,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:24,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:15:24,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10941133] [2019-12-27 01:15:24,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:15:24,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:24,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:15:24,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:15:24,447 INFO L87 Difference]: Start difference. First operand 18036 states and 57595 transitions. Second operand 9 states. [2019-12-27 01:15:26,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:26,367 INFO L93 Difference]: Finished difference Result 102329 states and 315713 transitions. [2019-12-27 01:15:26,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 01:15:26,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:15:26,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:26,499 INFO L225 Difference]: With dead ends: 102329 [2019-12-27 01:15:26,500 INFO L226 Difference]: Without dead ends: 78470 [2019-12-27 01:15:26,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 01:15:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78470 states. [2019-12-27 01:15:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78470 to 20282. [2019-12-27 01:15:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20282 states. [2019-12-27 01:15:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20282 states to 20282 states and 65103 transitions. [2019-12-27 01:15:27,599 INFO L78 Accepts]: Start accepts. Automaton has 20282 states and 65103 transitions. Word has length 64 [2019-12-27 01:15:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:27,599 INFO L462 AbstractCegarLoop]: Abstraction has 20282 states and 65103 transitions. [2019-12-27 01:15:27,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:15:27,599 INFO L276 IsEmpty]: Start isEmpty. Operand 20282 states and 65103 transitions. [2019-12-27 01:15:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:15:27,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:27,622 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] [2019-12-27 01:15:27,622 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-27 01:15:27,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:27,622 INFO L82 PathProgramCache]: Analyzing trace with hash 128153586, now seen corresponding path program 3 times [2019-12-27 01:15:27,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:27,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192998339] [2019-12-27 01:15:27,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:27,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192998339] [2019-12-27 01:15:27,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:27,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:15:27,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421356327] [2019-12-27 01:15:27,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:15:27,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:27,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:15:27,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:15:27,698 INFO L87 Difference]: Start difference. First operand 20282 states and 65103 transitions. Second operand 7 states. [2019-12-27 01:15:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:28,346 INFO L93 Difference]: Finished difference Result 60511 states and 188470 transitions. [2019-12-27 01:15:28,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:15:28,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:15:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:28,457 INFO L225 Difference]: With dead ends: 60511 [2019-12-27 01:15:28,457 INFO L226 Difference]: Without dead ends: 43702 [2019-12-27 01:15:28,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:15:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43702 states. [2019-12-27 01:15:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43702 to 24055. [2019-12-27 01:15:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24055 states. [2019-12-27 01:15:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24055 states to 24055 states and 77405 transitions. [2019-12-27 01:15:29,075 INFO L78 Accepts]: Start accepts. Automaton has 24055 states and 77405 transitions. Word has length 64 [2019-12-27 01:15:29,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:29,075 INFO L462 AbstractCegarLoop]: Abstraction has 24055 states and 77405 transitions. [2019-12-27 01:15:29,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:15:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 24055 states and 77405 transitions. [2019-12-27 01:15:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:15:29,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:29,107 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] [2019-12-27 01:15:29,107 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-27 01:15:29,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:29,107 INFO L82 PathProgramCache]: Analyzing trace with hash 792871072, now seen corresponding path program 4 times [2019-12-27 01:15:29,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:29,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037444252] [2019-12-27 01:15:29,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:29,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:29,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037444252] [2019-12-27 01:15:29,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:29,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:15:29,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014667554] [2019-12-27 01:15:29,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:15:29,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:29,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:15:29,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:15:29,187 INFO L87 Difference]: Start difference. First operand 24055 states and 77405 transitions. Second operand 7 states. [2019-12-27 01:15:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:29,797 INFO L93 Difference]: Finished difference Result 49580 states and 153914 transitions. [2019-12-27 01:15:29,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:15:29,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:15:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:29,911 INFO L225 Difference]: With dead ends: 49580 [2019-12-27 01:15:29,911 INFO L226 Difference]: Without dead ends: 45353 [2019-12-27 01:15:29,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:15:30,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45353 states. [2019-12-27 01:15:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45353 to 24263. [2019-12-27 01:15:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24263 states. [2019-12-27 01:15:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24263 states to 24263 states and 78043 transitions. [2019-12-27 01:15:31,111 INFO L78 Accepts]: Start accepts. Automaton has 24263 states and 78043 transitions. Word has length 64 [2019-12-27 01:15:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:31,111 INFO L462 AbstractCegarLoop]: Abstraction has 24263 states and 78043 transitions. [2019-12-27 01:15:31,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:15:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 24263 states and 78043 transitions. [2019-12-27 01:15:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:15:31,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:31,142 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] [2019-12-27 01:15:31,142 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-27 01:15:31,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:31,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1295242324, now seen corresponding path program 5 times [2019-12-27 01:15:31,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:31,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258724575] [2019-12-27 01:15:31,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:31,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258724575] [2019-12-27 01:15:31,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:31,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:15:31,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658784381] [2019-12-27 01:15:31,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:15:31,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:31,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:15:31,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:15:31,226 INFO L87 Difference]: Start difference. First operand 24263 states and 78043 transitions. Second operand 3 states. [2019-12-27 01:15:31,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:31,309 INFO L93 Difference]: Finished difference Result 20604 states and 64770 transitions. [2019-12-27 01:15:31,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:15:31,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:15:31,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:31,341 INFO L225 Difference]: With dead ends: 20604 [2019-12-27 01:15:31,341 INFO L226 Difference]: Without dead ends: 20604 [2019-12-27 01:15:31,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:15:31,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20604 states. [2019-12-27 01:15:31,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20604 to 19152. [2019-12-27 01:15:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19152 states. [2019-12-27 01:15:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19152 states to 19152 states and 60037 transitions. [2019-12-27 01:15:31,650 INFO L78 Accepts]: Start accepts. Automaton has 19152 states and 60037 transitions. Word has length 64 [2019-12-27 01:15:31,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:31,650 INFO L462 AbstractCegarLoop]: Abstraction has 19152 states and 60037 transitions. [2019-12-27 01:15:31,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:15:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 19152 states and 60037 transitions. [2019-12-27 01:15:31,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:15:31,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:15:31,672 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-27 01:15:31,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:31,672 INFO L82 PathProgramCache]: Analyzing trace with hash -646853691, now seen corresponding path program 1 times [2019-12-27 01:15:31,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:31,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781064602] [2019-12-27 01:15:31,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:31,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781064602] [2019-12-27 01:15:31,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:31,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:15:31,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4794811] [2019-12-27 01:15:31,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:15:31,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:31,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:15:31,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:15:31,727 INFO L87 Difference]: Start difference. First operand 19152 states and 60037 transitions. Second operand 3 states. [2019-12-27 01:15:31,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:31,859 INFO L93 Difference]: Finished difference Result 22794 states and 70667 transitions. [2019-12-27 01:15:31,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:15:31,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:15:31,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:31,894 INFO L225 Difference]: With dead ends: 22794 [2019-12-27 01:15:31,894 INFO L226 Difference]: Without dead ends: 22794 [2019-12-27 01:15:31,894 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-27 01:15:31,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22794 states. [2019-12-27 01:15:32,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22794 to 20146. [2019-12-27 01:15:32,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20146 states. [2019-12-27 01:15:32,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20146 states to 20146 states and 63035 transitions. [2019-12-27 01:15:32,255 INFO L78 Accepts]: Start accepts. Automaton has 20146 states and 63035 transitions. Word has length 65 [2019-12-27 01:15:32,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:32,255 INFO L462 AbstractCegarLoop]: Abstraction has 20146 states and 63035 transitions. [2019-12-27 01:15:32,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:15:32,255 INFO L276 IsEmpty]: Start isEmpty. Operand 20146 states and 63035 transitions. [2019-12-27 01:15:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:15:32,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:32,278 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-27 01:15:32,278 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-27 01:15:32,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:32,279 INFO L82 PathProgramCache]: Analyzing trace with hash 882937623, now seen corresponding path program 1 times [2019-12-27 01:15:32,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:32,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076006170] [2019-12-27 01:15:32,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:32,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:32,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076006170] [2019-12-27 01:15:32,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:32,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:15:32,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181495831] [2019-12-27 01:15:32,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:15:32,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:32,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:15:32,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:15:32,413 INFO L87 Difference]: Start difference. First operand 20146 states and 63035 transitions. Second operand 9 states. [2019-12-27 01:15:33,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:33,867 INFO L93 Difference]: Finished difference Result 77803 states and 235162 transitions. [2019-12-27 01:15:33,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:15:33,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 01:15:33,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:33,976 INFO L225 Difference]: With dead ends: 77803 [2019-12-27 01:15:33,976 INFO L226 Difference]: Without dead ends: 73784 [2019-12-27 01:15:33,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2019-12-27 01:15:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73784 states. [2019-12-27 01:15:34,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73784 to 20713. [2019-12-27 01:15:34,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20713 states. [2019-12-27 01:15:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20713 states to 20713 states and 64891 transitions. [2019-12-27 01:15:34,987 INFO L78 Accepts]: Start accepts. Automaton has 20713 states and 64891 transitions. Word has length 66 [2019-12-27 01:15:34,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:34,987 INFO L462 AbstractCegarLoop]: Abstraction has 20713 states and 64891 transitions. [2019-12-27 01:15:34,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:15:34,987 INFO L276 IsEmpty]: Start isEmpty. Operand 20713 states and 64891 transitions. [2019-12-27 01:15:35,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:15:35,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:35,011 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-27 01:15:35,012 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-27 01:15:35,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:35,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1442275055, now seen corresponding path program 1 times [2019-12-27 01:15:35,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:35,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582612815] [2019-12-27 01:15:35,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:35,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582612815] [2019-12-27 01:15:35,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:35,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 01:15:35,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162603666] [2019-12-27 01:15:35,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 01:15:35,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:35,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 01:15:35,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:15:35,414 INFO L87 Difference]: Start difference. First operand 20713 states and 64891 transitions. Second operand 14 states. [2019-12-27 01:15:43,130 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-12-27 01:15:43,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:43,626 INFO L93 Difference]: Finished difference Result 73590 states and 218877 transitions. [2019-12-27 01:15:43,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-12-27 01:15:43,626 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 01:15:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:43,727 INFO L225 Difference]: With dead ends: 73590 [2019-12-27 01:15:43,728 INFO L226 Difference]: Without dead ends: 73408 [2019-12-27 01:15:43,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2778 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1419, Invalid=6413, Unknown=0, NotChecked=0, Total=7832 [2019-12-27 01:15:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73408 states. [2019-12-27 01:15:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73408 to 28163. [2019-12-27 01:15:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28163 states. [2019-12-27 01:15:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28163 states to 28163 states and 87511 transitions. [2019-12-27 01:15:44,540 INFO L78 Accepts]: Start accepts. Automaton has 28163 states and 87511 transitions. Word has length 66 [2019-12-27 01:15:44,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:44,540 INFO L462 AbstractCegarLoop]: Abstraction has 28163 states and 87511 transitions. [2019-12-27 01:15:44,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 01:15:44,540 INFO L276 IsEmpty]: Start isEmpty. Operand 28163 states and 87511 transitions. [2019-12-27 01:15:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:15:44,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:44,575 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-27 01:15:44,575 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-27 01:15:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:44,576 INFO L82 PathProgramCache]: Analyzing trace with hash -544773579, now seen corresponding path program 2 times [2019-12-27 01:15:44,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:44,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764994257] [2019-12-27 01:15:44,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:44,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764994257] [2019-12-27 01:15:44,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:44,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:15:44,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017225276] [2019-12-27 01:15:44,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:15:44,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:44,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:15:44,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:15:44,642 INFO L87 Difference]: Start difference. First operand 28163 states and 87511 transitions. Second operand 3 states. [2019-12-27 01:15:44,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:44,786 INFO L93 Difference]: Finished difference Result 28163 states and 87510 transitions. [2019-12-27 01:15:44,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:15:44,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 01:15:44,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:44,849 INFO L225 Difference]: With dead ends: 28163 [2019-12-27 01:15:44,849 INFO L226 Difference]: Without dead ends: 28163 [2019-12-27 01:15:44,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:15:44,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28163 states. [2019-12-27 01:15:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28163 to 18943. [2019-12-27 01:15:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18943 states. [2019-12-27 01:15:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18943 states to 18943 states and 59000 transitions. [2019-12-27 01:15:45,265 INFO L78 Accepts]: Start accepts. Automaton has 18943 states and 59000 transitions. Word has length 66 [2019-12-27 01:15:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:45,265 INFO L462 AbstractCegarLoop]: Abstraction has 18943 states and 59000 transitions. [2019-12-27 01:15:45,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:15:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 18943 states and 59000 transitions. [2019-12-27 01:15:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:15:45,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:45,285 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-27 01:15:45,285 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:15:45,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:45,286 INFO L82 PathProgramCache]: Analyzing trace with hash 763340387, now seen corresponding path program 1 times [2019-12-27 01:15:45,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:45,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343724288] [2019-12-27 01:15:45,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:15:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:15:45,400 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:15:45,400 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:15:45,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~z$r_buff0_thd3~0_367) (= v_~z$r_buff0_thd0~0_147 0) (= v_~z$w_buff0_used~0_850 0) (= v_~z$w_buff0~0_393 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_322) (= |v_ULTIMATE.start_main_~#t159~0.offset_17| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t159~0.base_27| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t159~0.base_27|) |v_ULTIMATE.start_main_~#t159~0.offset_17| 0)) |v_#memory_int_19|) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t159~0.base_27| 1)) (= v_~weak$$choice2~0_147 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t159~0.base_27|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd1~0_158 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t159~0.base_27|)) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_168 0) (= v_~z$w_buff1_used~0_568 0) (= v_~main$tmp_guard1~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_41) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_26) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= v_~z$r_buff0_thd1~0_210 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t159~0.base_27| 4)) (= 0 v_~x~0_154) (= v_~z$r_buff0_thd2~0_129 0) (= 0 v_~__unbuffered_cnt~0_88) (= v_~z~0_181 0) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= v_~y~0_31 0) (= v_~z$r_buff1_thd0~0_191 0) (= v_~z$w_buff1~0_253 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t161~0.offset=|v_ULTIMATE.start_main_~#t161~0.offset_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_168, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_61|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_191|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_568, ULTIMATE.start_main_~#t159~0.base=|v_ULTIMATE.start_main_~#t159~0.base_27|, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ULTIMATE.start_main_~#t160~0.base=|v_ULTIMATE.start_main_~#t160~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_158, ~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_367, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~x~0=v_~x~0_154, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_253, ULTIMATE.start_main_~#t161~0.base=|v_ULTIMATE.start_main_~#t161~0.base_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_39|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t160~0.offset=|v_ULTIMATE.start_main_~#t160~0.offset_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_191, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_129, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_850, ~z$w_buff0~0=v_~z$w_buff0~0_393, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_322, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t159~0.offset=|v_ULTIMATE.start_main_~#t159~0.offset_17|, ~z~0=v_~z~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_210} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t161~0.offset, ~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_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t159~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_~#t160~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ULTIMATE.start_main_~#t161~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t160~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~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, ULTIMATE.start_main_~#t159~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:15:45,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L830-1-->L832: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t160~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t160~0.base_11|) |v_ULTIMATE.start_main_~#t160~0.offset_9| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t160~0.base_11| 0)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t160~0.base_11| 1) |v_#valid_35|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t160~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t160~0.offset_9|) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t160~0.base_11|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t160~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t160~0.base=|v_ULTIMATE.start_main_~#t160~0.base_11|, ULTIMATE.start_main_~#t160~0.offset=|v_ULTIMATE.start_main_~#t160~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t160~0.base, ULTIMATE.start_main_~#t160~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 01:15:45,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= v_~z$r_buff0_thd0~0_17 v_~z$r_buff1_thd0~0_13) (= 1 v_~x~0_6) (= v_~z$r_buff0_thd1~0_21 1) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_31) (= v_~z$r_buff0_thd1~0_22 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_31, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_13, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_21, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~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, ~x~0] because there is no mapped edge [2019-12-27 01:15:45,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In903278430 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In903278430 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out903278430| ~z~0_In903278430) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out903278430| ~z$w_buff1~0_In903278430) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In903278430, ~z$w_buff1_used~0=~z$w_buff1_used~0_In903278430, ~z$w_buff1~0=~z$w_buff1~0_In903278430, ~z~0=~z~0_In903278430} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out903278430|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In903278430, ~z$w_buff1_used~0=~z$w_buff1_used~0_In903278430, ~z$w_buff1~0=~z$w_buff1~0_In903278430, ~z~0=~z~0_In903278430} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 01:15:45,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~z~0_27) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_17|, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 01:15:45,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-395427709 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-395427709 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-395427709| ~z$w_buff0_used~0_In-395427709) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-395427709| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-395427709, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-395427709} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-395427709, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-395427709|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-395427709} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:15:45,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1342203798 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-1342203798 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1342203798 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1342203798 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1342203798| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1342203798| ~z$w_buff1_used~0_In-1342203798)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1342203798, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1342203798, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1342203798, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1342203798} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1342203798, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1342203798, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1342203798, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1342203798|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1342203798} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:15:45,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t161~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t161~0.base_9|) |v_ULTIMATE.start_main_~#t161~0.offset_8| 2))) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t161~0.base_9|) 0) (not (= |v_ULTIMATE.start_main_~#t161~0.base_9| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t161~0.base_9|) (= |v_ULTIMATE.start_main_~#t161~0.offset_8| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t161~0.base_9| 1) |v_#valid_27|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t161~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t161~0.offset=|v_ULTIMATE.start_main_~#t161~0.offset_8|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t161~0.base=|v_ULTIMATE.start_main_~#t161~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t161~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t161~0.base, #length] because there is no mapped edge [2019-12-27 01:15:45,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In927579973 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In927579973 256)))) (or (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In927579973 256))) (and .cse0 (= (mod ~z$w_buff1_used~0_In927579973 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In927579973 256)))) .cse1 (= ~z$w_buff0~0_In927579973 |P2Thread1of1ForFork0_#t~ite20_Out927579973|) (= |P2Thread1of1ForFork0_#t~ite21_Out927579973| |P2Thread1of1ForFork0_#t~ite20_Out927579973|)) (and (= ~z$w_buff0~0_In927579973 |P2Thread1of1ForFork0_#t~ite21_Out927579973|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite20_In927579973| |P2Thread1of1ForFork0_#t~ite20_Out927579973|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In927579973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In927579973, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In927579973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In927579973, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In927579973, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In927579973|, ~weak$$choice2~0=~weak$$choice2~0_In927579973} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out927579973|, ~z$w_buff0~0=~z$w_buff0~0_In927579973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In927579973, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In927579973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In927579973, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In927579973, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out927579973|, ~weak$$choice2~0=~weak$$choice2~0_In927579973} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 01:15:45,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-943559416 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-943559416 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-943559416 |P1Thread1of1ForFork2_#t~ite13_Out-943559416|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-943559416|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-943559416, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-943559416} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-943559416, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-943559416|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-943559416} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:15:45,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-490798445 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-490798445 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-490798445 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-490798445 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-490798445|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In-490798445 |P1Thread1of1ForFork2_#t~ite14_Out-490798445|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-490798445, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-490798445, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-490798445, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-490798445} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-490798445, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-490798445, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-490798445, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-490798445|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-490798445} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:15:45,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L775-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P1Thread1of1ForFork2_#t~ite14_32| 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_44, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} 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_43, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, 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-27 01:15:45,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1405383401 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out-1405383401| |P2Thread1of1ForFork0_#t~ite23_Out-1405383401|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1405383401 256) 0))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In-1405383401 256) 0)) (= (mod ~z$w_buff0_used~0_In-1405383401 256) 0) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-1405383401 256) 0)))) .cse1 (= ~z$w_buff1~0_In-1405383401 |P2Thread1of1ForFork0_#t~ite23_Out-1405383401|)) (and (= |P2Thread1of1ForFork0_#t~ite23_In-1405383401| |P2Thread1of1ForFork0_#t~ite23_Out-1405383401|) (not .cse1) (= ~z$w_buff1~0_In-1405383401 |P2Thread1of1ForFork0_#t~ite24_Out-1405383401|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405383401, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1405383401, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1405383401|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1405383401, ~z$w_buff1~0=~z$w_buff1~0_In-1405383401, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1405383401, ~weak$$choice2~0=~weak$$choice2~0_In-1405383401} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405383401, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1405383401|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1405383401, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1405383401|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1405383401, ~z$w_buff1~0=~z$w_buff1~0_In-1405383401, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1405383401, ~weak$$choice2~0=~weak$$choice2~0_In-1405383401} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 01:15:45,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L798-->L798-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-509713029 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_Out-509713029| |P2Thread1of1ForFork0_#t~ite27_Out-509713029|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-509713029 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In-509713029 256) 0) .cse0) (and (= (mod ~z$w_buff1_used~0_In-509713029 256) 0) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-509713029 256)))) .cse1 (= |P2Thread1of1ForFork0_#t~ite26_Out-509713029| ~z$w_buff0_used~0_In-509713029)) (and (= |P2Thread1of1ForFork0_#t~ite26_In-509713029| |P2Thread1of1ForFork0_#t~ite26_Out-509713029|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite27_Out-509713029| ~z$w_buff0_used~0_In-509713029)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-509713029|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-509713029, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-509713029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-509713029, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-509713029, ~weak$$choice2~0=~weak$$choice2~0_In-509713029} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-509713029|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-509713029|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-509713029, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-509713029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-509713029, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-509713029, ~weak$$choice2~0=~weak$$choice2~0_In-509713029} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 01:15:45,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff0_thd3~0_66)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 01:15:45,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= v_~z~0_50 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 01:15:45,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In990311906 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In990311906 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out990311906| 0)) (and (= ~z$w_buff0_used~0_In990311906 |P0Thread1of1ForFork1_#t~ite5_Out990311906|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In990311906, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In990311906} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out990311906|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In990311906, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In990311906} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:15:45,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In254040585 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In254040585 256)))) (or (and (= ~z$w_buff1~0_In254040585 |P2Thread1of1ForFork0_#t~ite38_Out254040585|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In254040585 |P2Thread1of1ForFork0_#t~ite38_Out254040585|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In254040585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In254040585, ~z$w_buff1~0=~z$w_buff1~0_In254040585, ~z~0=~z~0_In254040585} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out254040585|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In254040585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In254040585, ~z$w_buff1~0=~z$w_buff1~0_In254040585, ~z~0=~z~0_In254040585} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:15:45,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd1~0_In1376560748 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1376560748 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In1376560748 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1376560748 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1376560748|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1376560748 |P0Thread1of1ForFork1_#t~ite6_Out1376560748|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1376560748, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1376560748, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1376560748, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1376560748} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1376560748, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1376560748|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1376560748, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1376560748, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1376560748} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:15:45,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-350022799 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-350022799 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In-350022799 ~z$r_buff0_thd1~0_Out-350022799) (or .cse0 .cse1)) (and (= 0 ~z$r_buff0_thd1~0_Out-350022799) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-350022799, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-350022799} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-350022799, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-350022799|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-350022799} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:15:45,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1630352703 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1630352703 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In1630352703 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1630352703 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1630352703|)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out1630352703| ~z$r_buff1_thd1~0_In1630352703) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1630352703, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1630352703, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1630352703, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1630352703} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1630352703|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1630352703, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1630352703, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1630352703, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1630352703} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:15:45,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L752-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_32|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_31|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} 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-27 01:15:45,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 01:15:45,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1068373522 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1068373522 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-1068373522| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1068373522 |P2Thread1of1ForFork0_#t~ite40_Out-1068373522|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1068373522, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1068373522} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1068373522, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1068373522|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1068373522} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:15:45,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In783052533 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In783052533 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In783052533 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In783052533 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out783052533|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In783052533 |P2Thread1of1ForFork0_#t~ite41_Out783052533|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In783052533, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In783052533, ~z$w_buff1_used~0=~z$w_buff1_used~0_In783052533, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In783052533} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In783052533, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In783052533, ~z$w_buff1_used~0=~z$w_buff1_used~0_In783052533, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In783052533, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out783052533|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:15:45,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In575523056 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In575523056 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out575523056|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out575523056| ~z$r_buff0_thd3~0_In575523056)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In575523056, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In575523056} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In575523056, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In575523056, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out575523056|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:15:45,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-211930288 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-211930288 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-211930288 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-211930288 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-211930288| 0)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-211930288| ~z$r_buff1_thd3~0_In-211930288) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-211930288, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-211930288, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-211930288, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-211930288} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-211930288|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-211930288, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-211930288, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-211930288, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-211930288} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:15:45,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_121 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_121, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, 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-27 01:15:45,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:15:45,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-621233626 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-621233626 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out-621233626| |ULTIMATE.start_main_#t~ite48_Out-621233626|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-621233626| ~z$w_buff1~0_In-621233626) (not .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite47_Out-621233626| ~z~0_In-621233626) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-621233626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-621233626, ~z$w_buff1~0=~z$w_buff1~0_In-621233626, ~z~0=~z~0_In-621233626} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-621233626, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-621233626|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-621233626, ~z$w_buff1~0=~z$w_buff1~0_In-621233626, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-621233626|, ~z~0=~z~0_In-621233626} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 01:15:45,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In922240871 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In922240871 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In922240871 |ULTIMATE.start_main_#t~ite49_Out922240871|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out922240871|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In922240871, ~z$w_buff0_used~0=~z$w_buff0_used~0_In922240871} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In922240871, ~z$w_buff0_used~0=~z$w_buff0_used~0_In922240871, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out922240871|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:15:45,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1328542918 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1328542918 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1328542918 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1328542918 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1328542918 |ULTIMATE.start_main_#t~ite50_Out1328542918|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite50_Out1328542918| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1328542918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1328542918, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1328542918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1328542918} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1328542918|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1328542918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1328542918, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1328542918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1328542918} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:15:45,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1263288374 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1263288374 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1263288374|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In1263288374 |ULTIMATE.start_main_#t~ite51_Out1263288374|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1263288374, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1263288374} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1263288374, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1263288374|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1263288374} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:15:45,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1398369955 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1398369955 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1398369955 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1398369955 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out1398369955|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1398369955 |ULTIMATE.start_main_#t~ite52_Out1398369955|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1398369955, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1398369955, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1398369955, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1398369955} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1398369955|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1398369955, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1398369955, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1398369955, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1398369955} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:15:45,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 2 v_~__unbuffered_p1_EAX~0_22) (= v_~x~0_65 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= v_~z$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~__unbuffered_p1_EBX~0_23 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_101, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65, 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-27 01:15:45,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:15:45 BasicIcfg [2019-12-27 01:15:45,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:15:45,543 INFO L168 Benchmark]: Toolchain (without parser) took 106750.36 ms. Allocated memory was 144.7 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.9 MB in the beginning and 1.0 GB in the end (delta: -939.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 01:15:45,543 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 01:15:45,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.78 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.5 MB in the beginning and 155.7 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:15:45,544 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.48 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:15:45,545 INFO L168 Benchmark]: Boogie Preprocessor took 41.73 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:15:45,545 INFO L168 Benchmark]: RCFGBuilder took 869.42 ms. Allocated memory is still 202.4 MB. Free memory was 150.3 MB in the beginning and 99.7 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:15:45,551 INFO L168 Benchmark]: TraceAbstraction took 104963.52 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.7 MB in the beginning and 1.0 GB in the end (delta: -940.1 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 01:15:45,554 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.23 ms. Allocated memory is still 144.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.78 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.5 MB in the beginning and 155.7 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.48 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.73 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 869.42 ms. Allocated memory is still 202.4 MB. Free memory was 150.3 MB in the beginning and 99.7 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104963.52 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.7 MB in the beginning and 1.0 GB in the end (delta: -940.1 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7398 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 70 SemBasedMoverChecksPositive, 270 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 78628 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t159, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L832] FCALL, FORK 0 pthread_create(&t160, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=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 [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = x [L768] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=2, 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] [L771] 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_p1_EAX=2, __unbuffered_p1_EBX=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=2, 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] [L772] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L834] FCALL, FORK 0 pthread_create(&t161, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=2, 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] [L785] 3 y = 1 [L788] 3 __unbuffered_p2_EAX = y [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 z$flush_delayed = weak$$choice2 [L794] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, x=2, 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] 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_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, x=2, 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 = !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) [L796] 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)) [L773] 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 [L774] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, x=2, 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_buff1=0, z$w_buff1_used=0] [L797] 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)) [L798] 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)) [L799] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, 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=2, 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_buff1=0, z$w_buff1_used=0] [L799] 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)) [L801] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, 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=2, 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_buff1=0, z$w_buff1_used=0] [L801] 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)) [L802] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, x=2, 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_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) [L807] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, x=2, 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_buff1=0, z$w_buff1_used=0] [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 [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 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 [L810] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, x=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 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 [L843] 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: 104.6s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 37.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6079 SDtfs, 10697 SDslu, 18611 SDs, 0 SdLazy, 12139 SolverSat, 876 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 46 SyntacticMatches, 18 SemanticMatches, 347 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4428 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146095occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 503424 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1112 NumberOfCodeBlocks, 1112 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1020 ConstructedInterpolants, 0 QuantifiedInterpolants, 203935 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...