/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:45:47,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:45:47,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:45:47,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:45:47,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:45:47,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:45:47,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:45:47,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:45:47,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:45:47,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:45:47,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:45:47,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:45:47,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:45:47,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:45:47,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:45:47,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:45:47,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:45:47,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:45:47,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:45:47,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:45:47,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:45:47,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:45:47,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:45:47,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:45:47,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:45:47,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:45:47,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:45:47,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:45:47,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:45:47,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:45:47,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:45:47,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:45:47,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:45:47,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:45:47,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:45:47,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:45:47,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:45:47,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:45:47,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:45:47,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:45:47,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:45:47,471 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-VariableLbe.epf [2019-12-18 20:45:47,486 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:45:47,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:45:47,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:45:47,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:45:47,487 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:45:47,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:45:47,488 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:45:47,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:45:47,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:45:47,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:45:47,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:45:47,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:45:47,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:45:47,489 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:45:47,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:45:47,490 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:45:47,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:45:47,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:45:47,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:45:47,490 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:45:47,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:45:47,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:45:47,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:45:47,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:45:47,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:45:47,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:45:47,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:45:47,492 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:45:47,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:45:47,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:45:47,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:45:47,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:45:47,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:45:47,776 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:45:47,776 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:45:47,777 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i [2019-12-18 20:45:47,855 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e56fb900/9c5b87a7f2d74765b5ba46391b99c6b8/FLAG82a0271a1 [2019-12-18 20:45:48,417 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:45:48,418 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i [2019-12-18 20:45:48,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e56fb900/9c5b87a7f2d74765b5ba46391b99c6b8/FLAG82a0271a1 [2019-12-18 20:45:48,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e56fb900/9c5b87a7f2d74765b5ba46391b99c6b8 [2019-12-18 20:45:48,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:45:48,689 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:45:48,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:45:48,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:45:48,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:45:48,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:45:48" (1/1) ... [2019-12-18 20:45:48,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@417d8fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:48, skipping insertion in model container [2019-12-18 20:45:48,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:45:48" (1/1) ... [2019-12-18 20:45:48,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:45:48,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:45:49,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:45:49,295 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:45:49,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:45:49,441 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:45:49,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:49 WrapperNode [2019-12-18 20:45:49,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:45:49,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:45:49,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:45:49,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:45:49,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:49" (1/1) ... [2019-12-18 20:45:49,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:49" (1/1) ... [2019-12-18 20:45:49,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:45:49,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:45:49,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:45:49,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:45:49,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:49" (1/1) ... [2019-12-18 20:45:49,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:49" (1/1) ... [2019-12-18 20:45:49,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:49" (1/1) ... [2019-12-18 20:45:49,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:49" (1/1) ... [2019-12-18 20:45:49,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:49" (1/1) ... [2019-12-18 20:45:49,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:49" (1/1) ... [2019-12-18 20:45:49,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:49" (1/1) ... [2019-12-18 20:45:49,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:45:49,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:45:49,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:45:49,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:45:49,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:45:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:45:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:45:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:45:49,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:45:49,654 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:45:49,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:45:49,654 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:45:49,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:45:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:45:49,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:45:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:45:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:45:49,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:45:49,657 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:45:50,455 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:45:50,456 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:45:50,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:45:50 BoogieIcfgContainer [2019-12-18 20:45:50,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:45:50,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:45:50,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:45:50,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:45:50,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:45:48" (1/3) ... [2019-12-18 20:45:50,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6b099e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:45:50, skipping insertion in model container [2019-12-18 20:45:50,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:49" (2/3) ... [2019-12-18 20:45:50,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6b099e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:45:50, skipping insertion in model container [2019-12-18 20:45:50,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:45:50" (3/3) ... [2019-12-18 20:45:50,466 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc.i [2019-12-18 20:45:50,474 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:45:50,475 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:45:50,483 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:45:50,484 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:45:50,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,527 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,527 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,527 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,528 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,528 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,536 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,553 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,562 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,562 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,589 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,591 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,599 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,599 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,601 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,601 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:50,620 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:45:50,640 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:45:50,641 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:45:50,641 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:45:50,641 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:45:50,641 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:45:50,641 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:45:50,641 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:45:50,641 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:45:50,659 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 20:45:50,661 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 20:45:50,752 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 20:45:50,752 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:45:50,775 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:45:50,806 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 20:45:50,853 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 20:45:50,854 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:45:50,862 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:45:50,885 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 20:45:50,886 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:45:54,371 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 20:45:54,526 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 20:45:54,548 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82648 [2019-12-18 20:45:54,549 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 20:45:54,552 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 106 transitions [2019-12-18 20:46:17,399 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-18 20:46:17,401 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-18 20:46:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:46:17,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:17,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:46:17,408 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:17,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:17,414 INFO L82 PathProgramCache]: Analyzing trace with hash 914072, now seen corresponding path program 1 times [2019-12-18 20:46:17,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:17,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187389683] [2019-12-18 20:46:17,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:46:17,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187389683] [2019-12-18 20:46:17,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:17,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:46:17,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842946495] [2019-12-18 20:46:17,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:46:17,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:17,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:46:17,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:46:17,687 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-18 20:46:21,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:21,958 INFO L93 Difference]: Finished difference Result 128056 states and 545104 transitions. [2019-12-18 20:46:21,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:46:21,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:46:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:22,957 INFO L225 Difference]: With dead ends: 128056 [2019-12-18 20:46:22,957 INFO L226 Difference]: Without dead ends: 120020 [2019-12-18 20:46:22,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:46:28,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120020 states. [2019-12-18 20:46:33,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120020 to 120020. [2019-12-18 20:46:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120020 states. [2019-12-18 20:46:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120020 states to 120020 states and 510230 transitions. [2019-12-18 20:46:33,499 INFO L78 Accepts]: Start accepts. Automaton has 120020 states and 510230 transitions. Word has length 3 [2019-12-18 20:46:33,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:33,499 INFO L462 AbstractCegarLoop]: Abstraction has 120020 states and 510230 transitions. [2019-12-18 20:46:33,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:46:33,500 INFO L276 IsEmpty]: Start isEmpty. Operand 120020 states and 510230 transitions. [2019-12-18 20:46:33,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:46:33,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:33,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:33,505 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:33,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:33,506 INFO L82 PathProgramCache]: Analyzing trace with hash 634457403, now seen corresponding path program 1 times [2019-12-18 20:46:33,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:33,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315730749] [2019-12-18 20:46:33,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:46:33,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315730749] [2019-12-18 20:46:33,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:33,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:46:33,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052229253] [2019-12-18 20:46:33,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:46:33,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:33,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:46:33,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:46:33,633 INFO L87 Difference]: Start difference. First operand 120020 states and 510230 transitions. Second operand 4 states. [2019-12-18 20:46:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:38,914 INFO L93 Difference]: Finished difference Result 186650 states and 761123 transitions. [2019-12-18 20:46:38,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:46:38,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:46:38,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:39,563 INFO L225 Difference]: With dead ends: 186650 [2019-12-18 20:46:39,563 INFO L226 Difference]: Without dead ends: 186601 [2019-12-18 20:46:39,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:46:46,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186601 states. [2019-12-18 20:46:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186601 to 170989. [2019-12-18 20:46:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170989 states. [2019-12-18 20:46:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170989 states to 170989 states and 706730 transitions. [2019-12-18 20:46:50,638 INFO L78 Accepts]: Start accepts. Automaton has 170989 states and 706730 transitions. Word has length 11 [2019-12-18 20:46:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:50,639 INFO L462 AbstractCegarLoop]: Abstraction has 170989 states and 706730 transitions. [2019-12-18 20:46:50,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:46:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 170989 states and 706730 transitions. [2019-12-18 20:46:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:46:50,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:50,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:50,646 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:50,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:50,646 INFO L82 PathProgramCache]: Analyzing trace with hash 401091072, now seen corresponding path program 1 times [2019-12-18 20:46:50,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:50,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602204105] [2019-12-18 20:46:50,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:46:50,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602204105] [2019-12-18 20:46:50,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:50,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:46:50,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736028100] [2019-12-18 20:46:50,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:46:50,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:50,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:46:50,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:46:50,714 INFO L87 Difference]: Start difference. First operand 170989 states and 706730 transitions. Second operand 3 states. [2019-12-18 20:46:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:50,849 INFO L93 Difference]: Finished difference Result 36488 states and 117956 transitions. [2019-12-18 20:46:50,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:46:50,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:46:50,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:56,436 INFO L225 Difference]: With dead ends: 36488 [2019-12-18 20:46:56,436 INFO L226 Difference]: Without dead ends: 36488 [2019-12-18 20:46:56,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:46:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36488 states. [2019-12-18 20:46:57,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36488 to 36488. [2019-12-18 20:46:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36488 states. [2019-12-18 20:46:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36488 states to 36488 states and 117956 transitions. [2019-12-18 20:46:57,127 INFO L78 Accepts]: Start accepts. Automaton has 36488 states and 117956 transitions. Word has length 13 [2019-12-18 20:46:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:57,128 INFO L462 AbstractCegarLoop]: Abstraction has 36488 states and 117956 transitions. [2019-12-18 20:46:57,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:46:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 36488 states and 117956 transitions. [2019-12-18 20:46:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:46:57,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:57,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:57,133 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:57,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:57,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1042189126, now seen corresponding path program 1 times [2019-12-18 20:46:57,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:57,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209176308] [2019-12-18 20:46:57,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:46:57,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209176308] [2019-12-18 20:46:57,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:57,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:46:57,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649795547] [2019-12-18 20:46:57,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:46:57,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:57,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:46:57,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:46:57,271 INFO L87 Difference]: Start difference. First operand 36488 states and 117956 transitions. Second operand 5 states. [2019-12-18 20:46:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:57,827 INFO L93 Difference]: Finished difference Result 49379 states and 157671 transitions. [2019-12-18 20:46:57,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:46:57,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 20:46:57,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:57,980 INFO L225 Difference]: With dead ends: 49379 [2019-12-18 20:46:57,981 INFO L226 Difference]: Without dead ends: 49379 [2019-12-18 20:46:57,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:46:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49379 states. [2019-12-18 20:46:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49379 to 41803. [2019-12-18 20:46:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41803 states. [2019-12-18 20:46:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41803 states to 41803 states and 134583 transitions. [2019-12-18 20:46:59,136 INFO L78 Accepts]: Start accepts. Automaton has 41803 states and 134583 transitions. Word has length 16 [2019-12-18 20:46:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:59,136 INFO L462 AbstractCegarLoop]: Abstraction has 41803 states and 134583 transitions. [2019-12-18 20:46:59,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:46:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 41803 states and 134583 transitions. [2019-12-18 20:46:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:46:59,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:59,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:59,148 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:59,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:59,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1062845656, now seen corresponding path program 1 times [2019-12-18 20:46:59,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:59,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313819033] [2019-12-18 20:46:59,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:46:59,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313819033] [2019-12-18 20:46:59,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:59,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:46:59,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153606566] [2019-12-18 20:46:59,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:46:59,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:59,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:46:59,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:46:59,266 INFO L87 Difference]: Start difference. First operand 41803 states and 134583 transitions. Second operand 6 states. [2019-12-18 20:47:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:00,217 INFO L93 Difference]: Finished difference Result 61952 states and 194620 transitions. [2019-12-18 20:47:00,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:47:00,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 20:47:00,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:00,343 INFO L225 Difference]: With dead ends: 61952 [2019-12-18 20:47:00,343 INFO L226 Difference]: Without dead ends: 61945 [2019-12-18 20:47:00,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:47:00,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61945 states. [2019-12-18 20:47:01,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61945 to 42202. [2019-12-18 20:47:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42202 states. [2019-12-18 20:47:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42202 states to 42202 states and 134980 transitions. [2019-12-18 20:47:01,697 INFO L78 Accepts]: Start accepts. Automaton has 42202 states and 134980 transitions. Word has length 22 [2019-12-18 20:47:01,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:01,698 INFO L462 AbstractCegarLoop]: Abstraction has 42202 states and 134980 transitions. [2019-12-18 20:47:01,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:47:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 42202 states and 134980 transitions. [2019-12-18 20:47:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:47:01,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:01,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:47:01,713 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:01,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:01,713 INFO L82 PathProgramCache]: Analyzing trace with hash 389254536, now seen corresponding path program 1 times [2019-12-18 20:47:01,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:01,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129434435] [2019-12-18 20:47:01,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:01,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129434435] [2019-12-18 20:47:01,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:01,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:47:01,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090499615] [2019-12-18 20:47:01,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:47:01,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:01,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:47:01,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:47:01,765 INFO L87 Difference]: Start difference. First operand 42202 states and 134980 transitions. Second operand 4 states. [2019-12-18 20:47:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:01,833 INFO L93 Difference]: Finished difference Result 17764 states and 53552 transitions. [2019-12-18 20:47:01,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:47:01,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:47:01,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:01,859 INFO L225 Difference]: With dead ends: 17764 [2019-12-18 20:47:01,859 INFO L226 Difference]: Without dead ends: 17764 [2019-12-18 20:47:01,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:47:01,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17764 states. [2019-12-18 20:47:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17764 to 17380. [2019-12-18 20:47:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17380 states. [2019-12-18 20:47:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17380 states to 17380 states and 52512 transitions. [2019-12-18 20:47:02,127 INFO L78 Accepts]: Start accepts. Automaton has 17380 states and 52512 transitions. Word has length 25 [2019-12-18 20:47:02,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:02,127 INFO L462 AbstractCegarLoop]: Abstraction has 17380 states and 52512 transitions. [2019-12-18 20:47:02,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:47:02,127 INFO L276 IsEmpty]: Start isEmpty. Operand 17380 states and 52512 transitions. [2019-12-18 20:47:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:47:02,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:02,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:47:02,140 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:02,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:02,140 INFO L82 PathProgramCache]: Analyzing trace with hash -565342962, now seen corresponding path program 1 times [2019-12-18 20:47:02,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:02,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443479701] [2019-12-18 20:47:02,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:02,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:02,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443479701] [2019-12-18 20:47:02,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:02,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:47:02,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695616215] [2019-12-18 20:47:02,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:47:02,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:02,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:47:02,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:47:02,221 INFO L87 Difference]: Start difference. First operand 17380 states and 52512 transitions. Second operand 6 states. [2019-12-18 20:47:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:02,785 INFO L93 Difference]: Finished difference Result 24778 states and 73126 transitions. [2019-12-18 20:47:02,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 20:47:02,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 20:47:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:02,821 INFO L225 Difference]: With dead ends: 24778 [2019-12-18 20:47:02,821 INFO L226 Difference]: Without dead ends: 24778 [2019-12-18 20:47:02,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:47:02,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24778 states. [2019-12-18 20:47:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24778 to 19837. [2019-12-18 20:47:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19837 states. [2019-12-18 20:47:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19837 states to 19837 states and 59751 transitions. [2019-12-18 20:47:03,158 INFO L78 Accepts]: Start accepts. Automaton has 19837 states and 59751 transitions. Word has length 27 [2019-12-18 20:47:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:03,159 INFO L462 AbstractCegarLoop]: Abstraction has 19837 states and 59751 transitions. [2019-12-18 20:47:03,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:47:03,159 INFO L276 IsEmpty]: Start isEmpty. Operand 19837 states and 59751 transitions. [2019-12-18 20:47:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:47:03,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:03,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:47:03,179 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:03,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:03,179 INFO L82 PathProgramCache]: Analyzing trace with hash -26145312, now seen corresponding path program 1 times [2019-12-18 20:47:03,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:03,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067369015] [2019-12-18 20:47:03,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:03,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067369015] [2019-12-18 20:47:03,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:03,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:47:03,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292473768] [2019-12-18 20:47:03,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:47:03,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:03,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:47:03,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:47:03,292 INFO L87 Difference]: Start difference. First operand 19837 states and 59751 transitions. Second operand 7 states. [2019-12-18 20:47:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:04,557 INFO L93 Difference]: Finished difference Result 27047 states and 79356 transitions. [2019-12-18 20:47:04,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 20:47:04,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 20:47:04,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:04,595 INFO L225 Difference]: With dead ends: 27047 [2019-12-18 20:47:04,595 INFO L226 Difference]: Without dead ends: 27047 [2019-12-18 20:47:04,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:47:04,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27047 states. [2019-12-18 20:47:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27047 to 18334. [2019-12-18 20:47:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18334 states. [2019-12-18 20:47:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18334 states to 18334 states and 55114 transitions. [2019-12-18 20:47:04,942 INFO L78 Accepts]: Start accepts. Automaton has 18334 states and 55114 transitions. Word has length 33 [2019-12-18 20:47:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:04,942 INFO L462 AbstractCegarLoop]: Abstraction has 18334 states and 55114 transitions. [2019-12-18 20:47:04,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:47:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 18334 states and 55114 transitions. [2019-12-18 20:47:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:47:04,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:04,968 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-18 20:47:04,968 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:04,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:04,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1777489015, now seen corresponding path program 1 times [2019-12-18 20:47:04,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:04,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578955461] [2019-12-18 20:47:04,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:05,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:05,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578955461] [2019-12-18 20:47:05,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:05,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:47:05,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764459831] [2019-12-18 20:47:05,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:47:05,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:05,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:47:05,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:05,045 INFO L87 Difference]: Start difference. First operand 18334 states and 55114 transitions. Second operand 3 states. [2019-12-18 20:47:05,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:05,118 INFO L93 Difference]: Finished difference Result 18333 states and 55112 transitions. [2019-12-18 20:47:05,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:47:05,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:47:05,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:05,155 INFO L225 Difference]: With dead ends: 18333 [2019-12-18 20:47:05,155 INFO L226 Difference]: Without dead ends: 18333 [2019-12-18 20:47:05,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18333 states. [2019-12-18 20:47:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18333 to 18333. [2019-12-18 20:47:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18333 states. [2019-12-18 20:47:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18333 states to 18333 states and 55112 transitions. [2019-12-18 20:47:05,507 INFO L78 Accepts]: Start accepts. Automaton has 18333 states and 55112 transitions. Word has length 39 [2019-12-18 20:47:05,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:05,507 INFO L462 AbstractCegarLoop]: Abstraction has 18333 states and 55112 transitions. [2019-12-18 20:47:05,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:47:05,507 INFO L276 IsEmpty]: Start isEmpty. Operand 18333 states and 55112 transitions. [2019-12-18 20:47:05,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:47:05,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:05,531 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-18 20:47:05,531 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:05,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:05,532 INFO L82 PathProgramCache]: Analyzing trace with hash 51869366, now seen corresponding path program 1 times [2019-12-18 20:47:05,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:05,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234761883] [2019-12-18 20:47:05,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:05,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234761883] [2019-12-18 20:47:05,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:05,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:47:05,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958681357] [2019-12-18 20:47:05,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:47:05,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:05,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:47:05,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:47:05,607 INFO L87 Difference]: Start difference. First operand 18333 states and 55112 transitions. Second operand 4 states. [2019-12-18 20:47:05,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:05,741 INFO L93 Difference]: Finished difference Result 30242 states and 91634 transitions. [2019-12-18 20:47:05,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:47:05,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 20:47:05,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:05,776 INFO L225 Difference]: With dead ends: 30242 [2019-12-18 20:47:05,776 INFO L226 Difference]: Without dead ends: 15767 [2019-12-18 20:47:05,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:47:05,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15767 states. [2019-12-18 20:47:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15767 to 15693. [2019-12-18 20:47:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15693 states. [2019-12-18 20:47:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15693 states to 15693 states and 46442 transitions. [2019-12-18 20:47:06,125 INFO L78 Accepts]: Start accepts. Automaton has 15693 states and 46442 transitions. Word has length 40 [2019-12-18 20:47:06,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:06,125 INFO L462 AbstractCegarLoop]: Abstraction has 15693 states and 46442 transitions. [2019-12-18 20:47:06,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:47:06,125 INFO L276 IsEmpty]: Start isEmpty. Operand 15693 states and 46442 transitions. [2019-12-18 20:47:06,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:47:06,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:06,141 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-18 20:47:06,141 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:06,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:06,141 INFO L82 PathProgramCache]: Analyzing trace with hash 573984020, now seen corresponding path program 2 times [2019-12-18 20:47:06,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:06,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307279645] [2019-12-18 20:47:06,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:06,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307279645] [2019-12-18 20:47:06,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:06,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:47:06,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863358183] [2019-12-18 20:47:06,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:47:06,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:06,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:47:06,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:06,203 INFO L87 Difference]: Start difference. First operand 15693 states and 46442 transitions. Second operand 3 states. [2019-12-18 20:47:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:06,302 INFO L93 Difference]: Finished difference Result 25156 states and 74663 transitions. [2019-12-18 20:47:06,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:47:06,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 20:47:06,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:06,325 INFO L225 Difference]: With dead ends: 25156 [2019-12-18 20:47:06,326 INFO L226 Difference]: Without dead ends: 11596 [2019-12-18 20:47:06,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11596 states. [2019-12-18 20:47:06,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11596 to 11531. [2019-12-18 20:47:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11531 states. [2019-12-18 20:47:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11531 states to 11531 states and 33132 transitions. [2019-12-18 20:47:06,655 INFO L78 Accepts]: Start accepts. Automaton has 11531 states and 33132 transitions. Word has length 40 [2019-12-18 20:47:06,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:06,655 INFO L462 AbstractCegarLoop]: Abstraction has 11531 states and 33132 transitions. [2019-12-18 20:47:06,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:47:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 11531 states and 33132 transitions. [2019-12-18 20:47:06,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:47:06,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:06,667 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-18 20:47:06,667 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:06,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:06,668 INFO L82 PathProgramCache]: Analyzing trace with hash 974597418, now seen corresponding path program 3 times [2019-12-18 20:47:06,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:06,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796878961] [2019-12-18 20:47:06,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:06,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796878961] [2019-12-18 20:47:06,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:06,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:47:06,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278529022] [2019-12-18 20:47:06,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:47:06,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:06,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:47:06,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:47:06,747 INFO L87 Difference]: Start difference. First operand 11531 states and 33132 transitions. Second operand 5 states. [2019-12-18 20:47:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:06,824 INFO L93 Difference]: Finished difference Result 10699 states and 31268 transitions. [2019-12-18 20:47:06,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:47:06,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:47:06,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:06,841 INFO L225 Difference]: With dead ends: 10699 [2019-12-18 20:47:06,841 INFO L226 Difference]: Without dead ends: 6792 [2019-12-18 20:47:06,842 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-18 20:47:06,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6792 states. [2019-12-18 20:47:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6792 to 6792. [2019-12-18 20:47:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6792 states. [2019-12-18 20:47:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6792 states to 6792 states and 22017 transitions. [2019-12-18 20:47:07,031 INFO L78 Accepts]: Start accepts. Automaton has 6792 states and 22017 transitions. Word has length 40 [2019-12-18 20:47:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:07,031 INFO L462 AbstractCegarLoop]: Abstraction has 6792 states and 22017 transitions. [2019-12-18 20:47:07,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:47:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 6792 states and 22017 transitions. [2019-12-18 20:47:07,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:47:07,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:07,043 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-18 20:47:07,044 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:07,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:07,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1875886253, now seen corresponding path program 1 times [2019-12-18 20:47:07,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:07,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988837402] [2019-12-18 20:47:07,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:07,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988837402] [2019-12-18 20:47:07,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:07,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:47:07,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667749259] [2019-12-18 20:47:07,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:47:07,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:07,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:47:07,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:47:07,159 INFO L87 Difference]: Start difference. First operand 6792 states and 22017 transitions. Second operand 7 states. [2019-12-18 20:47:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:07,481 INFO L93 Difference]: Finished difference Result 13682 states and 43391 transitions. [2019-12-18 20:47:07,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:47:07,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 20:47:07,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:07,500 INFO L225 Difference]: With dead ends: 13682 [2019-12-18 20:47:07,501 INFO L226 Difference]: Without dead ends: 10287 [2019-12-18 20:47:07,501 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-18 20:47:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10287 states. [2019-12-18 20:47:07,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10287 to 8280. [2019-12-18 20:47:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8280 states. [2019-12-18 20:47:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8280 states to 8280 states and 26738 transitions. [2019-12-18 20:47:07,696 INFO L78 Accepts]: Start accepts. Automaton has 8280 states and 26738 transitions. Word has length 64 [2019-12-18 20:47:07,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:07,696 INFO L462 AbstractCegarLoop]: Abstraction has 8280 states and 26738 transitions. [2019-12-18 20:47:07,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:47:07,697 INFO L276 IsEmpty]: Start isEmpty. Operand 8280 states and 26738 transitions. [2019-12-18 20:47:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:47:07,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:07,707 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-18 20:47:07,707 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:07,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:07,708 INFO L82 PathProgramCache]: Analyzing trace with hash -233855723, now seen corresponding path program 2 times [2019-12-18 20:47:07,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:07,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378907585] [2019-12-18 20:47:07,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:07,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378907585] [2019-12-18 20:47:07,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:07,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:47:07,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894523383] [2019-12-18 20:47:07,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:47:07,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:07,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:47:07,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:47:07,806 INFO L87 Difference]: Start difference. First operand 8280 states and 26738 transitions. Second operand 7 states. [2019-12-18 20:47:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:08,102 INFO L93 Difference]: Finished difference Result 15353 states and 48447 transitions. [2019-12-18 20:47:08,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:47:08,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 20:47:08,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:08,122 INFO L225 Difference]: With dead ends: 15353 [2019-12-18 20:47:08,122 INFO L226 Difference]: Without dead ends: 11623 [2019-12-18 20:47:08,122 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-18 20:47:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-18 20:47:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 9382. [2019-12-18 20:47:08,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9382 states. [2019-12-18 20:47:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9382 states to 9382 states and 30156 transitions. [2019-12-18 20:47:08,464 INFO L78 Accepts]: Start accepts. Automaton has 9382 states and 30156 transitions. Word has length 64 [2019-12-18 20:47:08,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:08,465 INFO L462 AbstractCegarLoop]: Abstraction has 9382 states and 30156 transitions. [2019-12-18 20:47:08,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:47:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 9382 states and 30156 transitions. [2019-12-18 20:47:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:47:08,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:08,487 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-18 20:47:08,487 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:08,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:08,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1270827741, now seen corresponding path program 3 times [2019-12-18 20:47:08,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:08,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180142306] [2019-12-18 20:47:08,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:08,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-18 20:47:08,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180142306] [2019-12-18 20:47:08,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:08,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:47:08,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502322339] [2019-12-18 20:47:08,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:47:08,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:08,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:47:08,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:47:08,643 INFO L87 Difference]: Start difference. First operand 9382 states and 30156 transitions. Second operand 9 states. [2019-12-18 20:47:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:10,229 INFO L93 Difference]: Finished difference Result 53485 states and 171065 transitions. [2019-12-18 20:47:10,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 20:47:10,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 20:47:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:10,318 INFO L225 Difference]: With dead ends: 53485 [2019-12-18 20:47:10,318 INFO L226 Difference]: Without dead ends: 43652 [2019-12-18 20:47:10,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=322, Invalid=868, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 20:47:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43652 states. [2019-12-18 20:47:10,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43652 to 9634. [2019-12-18 20:47:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9634 states. [2019-12-18 20:47:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9634 states to 9634 states and 31168 transitions. [2019-12-18 20:47:10,859 INFO L78 Accepts]: Start accepts. Automaton has 9634 states and 31168 transitions. Word has length 64 [2019-12-18 20:47:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:10,859 INFO L462 AbstractCegarLoop]: Abstraction has 9634 states and 31168 transitions. [2019-12-18 20:47:10,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:47:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 9634 states and 31168 transitions. [2019-12-18 20:47:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:47:10,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:10,872 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-18 20:47:10,872 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:10,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:10,873 INFO L82 PathProgramCache]: Analyzing trace with hash 917508348, now seen corresponding path program 1 times [2019-12-18 20:47:10,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:10,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931149684] [2019-12-18 20:47:10,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:10,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931149684] [2019-12-18 20:47:10,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:10,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:47:10,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947131924] [2019-12-18 20:47:10,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:47:10,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:10,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:47:10,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:10,924 INFO L87 Difference]: Start difference. First operand 9634 states and 31168 transitions. Second operand 3 states. [2019-12-18 20:47:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:11,011 INFO L93 Difference]: Finished difference Result 13619 states and 44172 transitions. [2019-12-18 20:47:11,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:47:11,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 20:47:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:11,032 INFO L225 Difference]: With dead ends: 13619 [2019-12-18 20:47:11,032 INFO L226 Difference]: Without dead ends: 13619 [2019-12-18 20:47:11,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:11,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13619 states. [2019-12-18 20:47:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13619 to 11423. [2019-12-18 20:47:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11423 states. [2019-12-18 20:47:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11423 states to 11423 states and 37451 transitions. [2019-12-18 20:47:11,247 INFO L78 Accepts]: Start accepts. Automaton has 11423 states and 37451 transitions. Word has length 64 [2019-12-18 20:47:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:11,247 INFO L462 AbstractCegarLoop]: Abstraction has 11423 states and 37451 transitions. [2019-12-18 20:47:11,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:47:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 11423 states and 37451 transitions. [2019-12-18 20:47:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:47:11,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:11,261 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-18 20:47:11,261 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:11,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1537602983, now seen corresponding path program 4 times [2019-12-18 20:47:11,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:11,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960040464] [2019-12-18 20:47:11,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:11,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960040464] [2019-12-18 20:47:11,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:11,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:47:11,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906190795] [2019-12-18 20:47:11,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:47:11,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:11,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:47:11,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:47:11,368 INFO L87 Difference]: Start difference. First operand 11423 states and 37451 transitions. Second operand 9 states. [2019-12-18 20:47:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:12,587 INFO L93 Difference]: Finished difference Result 45185 states and 141607 transitions. [2019-12-18 20:47:12,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:47:12,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 20:47:12,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:12,648 INFO L225 Difference]: With dead ends: 45185 [2019-12-18 20:47:12,649 INFO L226 Difference]: Without dead ends: 40231 [2019-12-18 20:47:12,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2019-12-18 20:47:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40231 states. [2019-12-18 20:47:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40231 to 11451. [2019-12-18 20:47:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11451 states. [2019-12-18 20:47:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11451 states to 11451 states and 37605 transitions. [2019-12-18 20:47:13,046 INFO L78 Accepts]: Start accepts. Automaton has 11451 states and 37605 transitions. Word has length 64 [2019-12-18 20:47:13,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:13,046 INFO L462 AbstractCegarLoop]: Abstraction has 11451 states and 37605 transitions. [2019-12-18 20:47:13,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:47:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 11451 states and 37605 transitions. [2019-12-18 20:47:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:47:13,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:13,060 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-18 20:47:13,060 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:13,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:13,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1888227633, now seen corresponding path program 5 times [2019-12-18 20:47:13,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:13,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881347230] [2019-12-18 20:47:13,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:13,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881347230] [2019-12-18 20:47:13,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:13,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:47:13,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004467705] [2019-12-18 20:47:13,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:47:13,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:13,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:47:13,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:13,131 INFO L87 Difference]: Start difference. First operand 11451 states and 37605 transitions. Second operand 3 states. [2019-12-18 20:47:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:13,232 INFO L93 Difference]: Finished difference Result 13625 states and 44189 transitions. [2019-12-18 20:47:13,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:47:13,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 20:47:13,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:13,252 INFO L225 Difference]: With dead ends: 13625 [2019-12-18 20:47:13,252 INFO L226 Difference]: Without dead ends: 13625 [2019-12-18 20:47:13,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:13,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13625 states. [2019-12-18 20:47:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13625 to 12377. [2019-12-18 20:47:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12377 states. [2019-12-18 20:47:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12377 states to 12377 states and 40445 transitions. [2019-12-18 20:47:13,610 INFO L78 Accepts]: Start accepts. Automaton has 12377 states and 40445 transitions. Word has length 64 [2019-12-18 20:47:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:13,610 INFO L462 AbstractCegarLoop]: Abstraction has 12377 states and 40445 transitions. [2019-12-18 20:47:13,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:47:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 12377 states and 40445 transitions. [2019-12-18 20:47:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:47:13,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:13,625 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-18 20:47:13,625 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:13,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:13,625 INFO L82 PathProgramCache]: Analyzing trace with hash 614331262, now seen corresponding path program 1 times [2019-12-18 20:47:13,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:13,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372933282] [2019-12-18 20:47:13,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:13,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372933282] [2019-12-18 20:47:13,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:13,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:47:13,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845941211] [2019-12-18 20:47:13,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:47:13,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:13,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:47:13,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:13,669 INFO L87 Difference]: Start difference. First operand 12377 states and 40445 transitions. Second operand 3 states. [2019-12-18 20:47:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:13,834 INFO L93 Difference]: Finished difference Result 18388 states and 59830 transitions. [2019-12-18 20:47:13,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:47:13,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 20:47:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:13,876 INFO L225 Difference]: With dead ends: 18388 [2019-12-18 20:47:13,876 INFO L226 Difference]: Without dead ends: 18388 [2019-12-18 20:47:13,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18388 states. [2019-12-18 20:47:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18388 to 12948. [2019-12-18 20:47:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12948 states. [2019-12-18 20:47:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12948 states to 12948 states and 42250 transitions. [2019-12-18 20:47:14,160 INFO L78 Accepts]: Start accepts. Automaton has 12948 states and 42250 transitions. Word has length 65 [2019-12-18 20:47:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:14,160 INFO L462 AbstractCegarLoop]: Abstraction has 12948 states and 42250 transitions. [2019-12-18 20:47:14,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:47:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 12948 states and 42250 transitions. [2019-12-18 20:47:14,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:47:14,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:14,175 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-18 20:47:14,176 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:14,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:14,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1069012218, now seen corresponding path program 2 times [2019-12-18 20:47:14,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:14,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574033597] [2019-12-18 20:47:14,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:14,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574033597] [2019-12-18 20:47:14,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:14,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:47:14,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766972877] [2019-12-18 20:47:14,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:47:14,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:14,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:47:14,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:47:14,296 INFO L87 Difference]: Start difference. First operand 12948 states and 42250 transitions. Second operand 9 states. [2019-12-18 20:47:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:15,299 INFO L93 Difference]: Finished difference Result 39920 states and 125028 transitions. [2019-12-18 20:47:15,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 20:47:15,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 20:47:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:15,351 INFO L225 Difference]: With dead ends: 39920 [2019-12-18 20:47:15,351 INFO L226 Difference]: Without dead ends: 36380 [2019-12-18 20:47:15,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-12-18 20:47:15,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36380 states. [2019-12-18 20:47:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36380 to 12318. [2019-12-18 20:47:15,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12318 states. [2019-12-18 20:47:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12318 states to 12318 states and 39954 transitions. [2019-12-18 20:47:15,727 INFO L78 Accepts]: Start accepts. Automaton has 12318 states and 39954 transitions. Word has length 65 [2019-12-18 20:47:15,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:15,727 INFO L462 AbstractCegarLoop]: Abstraction has 12318 states and 39954 transitions. [2019-12-18 20:47:15,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:47:15,727 INFO L276 IsEmpty]: Start isEmpty. Operand 12318 states and 39954 transitions. [2019-12-18 20:47:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:47:15,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:15,741 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-18 20:47:15,741 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:15,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:15,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1039758982, now seen corresponding path program 3 times [2019-12-18 20:47:15,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:15,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152975804] [2019-12-18 20:47:15,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:15,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152975804] [2019-12-18 20:47:15,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:15,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:47:15,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966486136] [2019-12-18 20:47:15,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:47:15,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:15,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:47:15,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:47:15,846 INFO L87 Difference]: Start difference. First operand 12318 states and 39954 transitions. Second operand 9 states. [2019-12-18 20:47:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:17,539 INFO L93 Difference]: Finished difference Result 48293 states and 150377 transitions. [2019-12-18 20:47:17,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 20:47:17,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 20:47:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:17,639 INFO L225 Difference]: With dead ends: 48293 [2019-12-18 20:47:17,639 INFO L226 Difference]: Without dead ends: 36189 [2019-12-18 20:47:17,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2019-12-18 20:47:17,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36189 states. [2019-12-18 20:47:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36189 to 13536. [2019-12-18 20:47:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13536 states. [2019-12-18 20:47:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13536 states to 13536 states and 43763 transitions. [2019-12-18 20:47:18,520 INFO L78 Accepts]: Start accepts. Automaton has 13536 states and 43763 transitions. Word has length 65 [2019-12-18 20:47:18,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:18,520 INFO L462 AbstractCegarLoop]: Abstraction has 13536 states and 43763 transitions. [2019-12-18 20:47:18,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:47:18,520 INFO L276 IsEmpty]: Start isEmpty. Operand 13536 states and 43763 transitions. [2019-12-18 20:47:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:47:18,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:18,535 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-18 20:47:18,536 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:18,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:18,536 INFO L82 PathProgramCache]: Analyzing trace with hash -506815583, now seen corresponding path program 1 times [2019-12-18 20:47:18,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:18,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980546690] [2019-12-18 20:47:18,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:18,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980546690] [2019-12-18 20:47:18,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:18,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:47:18,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355617074] [2019-12-18 20:47:18,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:47:18,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:18,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:47:18,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:18,587 INFO L87 Difference]: Start difference. First operand 13536 states and 43763 transitions. Second operand 3 states. [2019-12-18 20:47:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:18,640 INFO L93 Difference]: Finished difference Result 11866 states and 37579 transitions. [2019-12-18 20:47:18,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:47:18,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 20:47:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:18,663 INFO L225 Difference]: With dead ends: 11866 [2019-12-18 20:47:18,663 INFO L226 Difference]: Without dead ends: 11866 [2019-12-18 20:47:18,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11866 states. [2019-12-18 20:47:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11866 to 11866. [2019-12-18 20:47:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11866 states. [2019-12-18 20:47:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11866 states to 11866 states and 37579 transitions. [2019-12-18 20:47:19,015 INFO L78 Accepts]: Start accepts. Automaton has 11866 states and 37579 transitions. Word has length 65 [2019-12-18 20:47:19,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:19,016 INFO L462 AbstractCegarLoop]: Abstraction has 11866 states and 37579 transitions. [2019-12-18 20:47:19,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:47:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 11866 states and 37579 transitions. [2019-12-18 20:47:19,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:47:19,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:19,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:47:19,042 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:19,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:19,042 INFO L82 PathProgramCache]: Analyzing trace with hash 553188743, now seen corresponding path program 1 times [2019-12-18 20:47:19,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:19,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206553394] [2019-12-18 20:47:19,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:19,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206553394] [2019-12-18 20:47:19,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:19,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:47:19,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21201444] [2019-12-18 20:47:19,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:47:19,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:19,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:47:19,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:47:19,214 INFO L87 Difference]: Start difference. First operand 11866 states and 37579 transitions. Second operand 8 states. [2019-12-18 20:47:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:20,012 INFO L93 Difference]: Finished difference Result 20184 states and 62903 transitions. [2019-12-18 20:47:20,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 20:47:20,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 20:47:20,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:20,035 INFO L225 Difference]: With dead ends: 20184 [2019-12-18 20:47:20,035 INFO L226 Difference]: Without dead ends: 15133 [2019-12-18 20:47:20,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-18 20:47:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15133 states. [2019-12-18 20:47:20,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15133 to 12362. [2019-12-18 20:47:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12362 states. [2019-12-18 20:47:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12362 states to 12362 states and 38821 transitions. [2019-12-18 20:47:20,260 INFO L78 Accepts]: Start accepts. Automaton has 12362 states and 38821 transitions. Word has length 66 [2019-12-18 20:47:20,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:20,260 INFO L462 AbstractCegarLoop]: Abstraction has 12362 states and 38821 transitions. [2019-12-18 20:47:20,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:47:20,260 INFO L276 IsEmpty]: Start isEmpty. Operand 12362 states and 38821 transitions. [2019-12-18 20:47:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:47:20,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:20,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:47:20,275 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:20,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:20,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1174316229, now seen corresponding path program 2 times [2019-12-18 20:47:20,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:20,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148642355] [2019-12-18 20:47:20,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:20,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148642355] [2019-12-18 20:47:20,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:20,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:47:20,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276898702] [2019-12-18 20:47:20,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:47:20,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:20,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:47:20,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:47:20,387 INFO L87 Difference]: Start difference. First operand 12362 states and 38821 transitions. Second operand 9 states. [2019-12-18 20:47:21,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:21,346 INFO L93 Difference]: Finished difference Result 19440 states and 60053 transitions. [2019-12-18 20:47:21,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 20:47:21,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 20:47:21,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:21,368 INFO L225 Difference]: With dead ends: 19440 [2019-12-18 20:47:21,369 INFO L226 Difference]: Without dead ends: 14941 [2019-12-18 20:47:21,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:47:21,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14941 states. [2019-12-18 20:47:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14941 to 12242. [2019-12-18 20:47:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12242 states. [2019-12-18 20:47:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12242 states to 12242 states and 38405 transitions. [2019-12-18 20:47:21,585 INFO L78 Accepts]: Start accepts. Automaton has 12242 states and 38405 transitions. Word has length 66 [2019-12-18 20:47:21,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:21,585 INFO L462 AbstractCegarLoop]: Abstraction has 12242 states and 38405 transitions. [2019-12-18 20:47:21,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:47:21,585 INFO L276 IsEmpty]: Start isEmpty. Operand 12242 states and 38405 transitions. [2019-12-18 20:47:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:47:21,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:21,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:47:21,597 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:21,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:21,597 INFO L82 PathProgramCache]: Analyzing trace with hash 877096621, now seen corresponding path program 3 times [2019-12-18 20:47:21,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:21,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364400905] [2019-12-18 20:47:21,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:21,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:21,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364400905] [2019-12-18 20:47:21,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:21,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:47:21,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648400780] [2019-12-18 20:47:21,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:47:21,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:21,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:47:21,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:47:21,753 INFO L87 Difference]: Start difference. First operand 12242 states and 38405 transitions. Second operand 10 states. [2019-12-18 20:47:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:22,513 INFO L93 Difference]: Finished difference Result 19398 states and 59780 transitions. [2019-12-18 20:47:22,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:47:22,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 20:47:22,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:22,536 INFO L225 Difference]: With dead ends: 19398 [2019-12-18 20:47:22,536 INFO L226 Difference]: Without dead ends: 15363 [2019-12-18 20:47:22,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-12-18 20:47:22,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15363 states. [2019-12-18 20:47:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15363 to 12282. [2019-12-18 20:47:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12282 states. [2019-12-18 20:47:22,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12282 states to 12282 states and 38419 transitions. [2019-12-18 20:47:22,761 INFO L78 Accepts]: Start accepts. Automaton has 12282 states and 38419 transitions. Word has length 66 [2019-12-18 20:47:22,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:22,762 INFO L462 AbstractCegarLoop]: Abstraction has 12282 states and 38419 transitions. [2019-12-18 20:47:22,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:47:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 12282 states and 38419 transitions. [2019-12-18 20:47:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:47:22,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:22,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:47:22,776 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-18 20:47:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:22,777 INFO L82 PathProgramCache]: Analyzing trace with hash -700189627, now seen corresponding path program 4 times [2019-12-18 20:47:22,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:22,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805901186] [2019-12-18 20:47:22,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:22,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805901186] [2019-12-18 20:47:22,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:22,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:47:22,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769706314] [2019-12-18 20:47:22,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:47:22,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:22,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:47:22,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:47:22,916 INFO L87 Difference]: Start difference. First operand 12282 states and 38419 transitions. Second operand 11 states. [2019-12-18 20:47:23,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:23,663 INFO L93 Difference]: Finished difference Result 18678 states and 57378 transitions. [2019-12-18 20:47:23,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 20:47:23,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 20:47:23,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:23,685 INFO L225 Difference]: With dead ends: 18678 [2019-12-18 20:47:23,685 INFO L226 Difference]: Without dead ends: 14763 [2019-12-18 20:47:23,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-18 20:47:23,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14763 states. [2019-12-18 20:47:23,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14763 to 12090. [2019-12-18 20:47:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12090 states. [2019-12-18 20:47:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12090 states to 12090 states and 37749 transitions. [2019-12-18 20:47:23,915 INFO L78 Accepts]: Start accepts. Automaton has 12090 states and 37749 transitions. Word has length 66 [2019-12-18 20:47:23,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:23,915 INFO L462 AbstractCegarLoop]: Abstraction has 12090 states and 37749 transitions. [2019-12-18 20:47:23,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:47:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 12090 states and 37749 transitions. [2019-12-18 20:47:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:47:23,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:23,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:47:23,930 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:23,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:23,931 INFO L82 PathProgramCache]: Analyzing trace with hash 498939327, now seen corresponding path program 5 times [2019-12-18 20:47:23,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:23,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808288345] [2019-12-18 20:47:23,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:24,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808288345] [2019-12-18 20:47:24,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:24,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:47:24,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679923051] [2019-12-18 20:47:24,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 20:47:24,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:24,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 20:47:24,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:47:24,114 INFO L87 Difference]: Start difference. First operand 12090 states and 37749 transitions. Second operand 12 states. [2019-12-18 20:47:24,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:24,835 INFO L93 Difference]: Finished difference Result 14970 states and 45952 transitions. [2019-12-18 20:47:24,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:47:24,836 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 20:47:24,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:24,857 INFO L225 Difference]: With dead ends: 14970 [2019-12-18 20:47:24,858 INFO L226 Difference]: Without dead ends: 14731 [2019-12-18 20:47:24,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:47:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14731 states. [2019-12-18 20:47:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14731 to 11914. [2019-12-18 20:47:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11914 states. [2019-12-18 20:47:25,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11914 states to 11914 states and 37265 transitions. [2019-12-18 20:47:25,072 INFO L78 Accepts]: Start accepts. Automaton has 11914 states and 37265 transitions. Word has length 66 [2019-12-18 20:47:25,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:25,072 INFO L462 AbstractCegarLoop]: Abstraction has 11914 states and 37265 transitions. [2019-12-18 20:47:25,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 20:47:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand 11914 states and 37265 transitions. [2019-12-18 20:47:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:47:25,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:25,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:47:25,084 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:25,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:25,085 INFO L82 PathProgramCache]: Analyzing trace with hash -856403297, now seen corresponding path program 6 times [2019-12-18 20:47:25,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:25,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943939165] [2019-12-18 20:47:25,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:25,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943939165] [2019-12-18 20:47:25,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:25,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:47:25,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788729011] [2019-12-18 20:47:25,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:47:25,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:25,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:47:25,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:25,145 INFO L87 Difference]: Start difference. First operand 11914 states and 37265 transitions. Second operand 3 states. [2019-12-18 20:47:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:25,200 INFO L93 Difference]: Finished difference Result 11914 states and 37264 transitions. [2019-12-18 20:47:25,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:47:25,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 20:47:25,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:25,225 INFO L225 Difference]: With dead ends: 11914 [2019-12-18 20:47:25,226 INFO L226 Difference]: Without dead ends: 11914 [2019-12-18 20:47:25,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:25,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11914 states. [2019-12-18 20:47:25,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11914 to 11914. [2019-12-18 20:47:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11914 states. [2019-12-18 20:47:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11914 states to 11914 states and 37264 transitions. [2019-12-18 20:47:25,500 INFO L78 Accepts]: Start accepts. Automaton has 11914 states and 37264 transitions. Word has length 66 [2019-12-18 20:47:25,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:25,500 INFO L462 AbstractCegarLoop]: Abstraction has 11914 states and 37264 transitions. [2019-12-18 20:47:25,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:47:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 11914 states and 37264 transitions. [2019-12-18 20:47:25,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:47:25,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:25,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:47:25,514 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:25,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:25,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1158921090, now seen corresponding path program 1 times [2019-12-18 20:47:25,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:25,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795729654] [2019-12-18 20:47:25,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:47:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:47:25,664 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:47:25,664 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:47:25,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~a$r_buff1_thd3~0_51) (= v_~z~0_13 0) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= 0 v_~a$read_delayed~0_7) (= 0 v_~__unbuffered_p0_EAX~0_12) (= v_~a$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_32) (= 0 v_~a$r_buff1_thd1~0_15) (= v_~a~0_28 0) (= |v_ULTIMATE.start_main_~#t633~0.offset_16| 0) (= 0 v_~a$w_buff1_used~0_73) (= v_~a$flush_delayed~0_13 0) (= 0 v_~a$w_buff0_used~0_112) (= 0 v_~__unbuffered_p2_EAX~0_11) (= v_~a$r_buff0_thd2~0_20 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t633~0.base_19| 4) |v_#length_23|) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_13 0) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t633~0.base_19| 1)) (= 0 v_~weak$$choice0~0_7) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t633~0.base_19|) (= v_~a$mem_tmp~0_10 0) (= v_~__unbuffered_p0_EBX~0_12 0) (= 0 v_~a$r_buff1_thd0~0_19) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t633~0.base_19| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t633~0.base_19|) |v_ULTIMATE.start_main_~#t633~0.offset_16| 0)) |v_#memory_int_19|) (= v_~a$r_buff0_thd3~0_75 0) (= 0 v_~a$r_buff1_thd2~0_17) (= 0 v_~a$w_buff0~0_26) (= v_~y~0_10 0) (= v_~a$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~a$w_buff1~0_25) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t633~0.base_19|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ~a~0=v_~a~0_28, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ULTIMATE.start_main_~#t635~0.offset=|v_ULTIMATE.start_main_~#t635~0.offset_17|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_26, ULTIMATE.start_main_~#t635~0.base=|v_ULTIMATE.start_main_~#t635~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t634~0.base=|v_ULTIMATE.start_main_~#t634~0.base_21|, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_9, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~y~0=v_~y~0_10, ULTIMATE.start_main_~#t633~0.base=|v_ULTIMATE.start_main_~#t633~0.base_19|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t634~0.offset=|v_ULTIMATE.start_main_~#t634~0.offset_16|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t633~0.offset=|v_ULTIMATE.start_main_~#t633~0.offset_16|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t635~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t635~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t634~0.base, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t633~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t634~0.offset, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t633~0.offset] because there is no mapped edge [2019-12-18 20:47:25,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t634~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t634~0.offset_9|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t634~0.base_10| 4) |v_#length_17|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t634~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t634~0.base_10|) |v_ULTIMATE.start_main_~#t634~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t634~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t634~0.base_10| 0)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t634~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t634~0.base=|v_ULTIMATE.start_main_~#t634~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t634~0.offset=|v_ULTIMATE.start_main_~#t634~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t634~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t634~0.offset] because there is no mapped edge [2019-12-18 20:47:25,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L837-1-->L839: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t635~0.base_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t635~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t635~0.base_13|)) (= |v_ULTIMATE.start_main_~#t635~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t635~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t635~0.base_13|) |v_ULTIMATE.start_main_~#t635~0.offset_11| 2)) |v_#memory_int_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t635~0.base_13| 4) |v_#length_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t635~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t635~0.base=|v_ULTIMATE.start_main_~#t635~0.base_13|, ULTIMATE.start_main_~#t635~0.offset=|v_ULTIMATE.start_main_~#t635~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t635~0.base, ULTIMATE.start_main_~#t635~0.offset] because there is no mapped edge [2019-12-18 20:47:25,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= 1 v_~a$w_buff0~0_16) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8) (= v_~a$w_buff0~0_17 v_~a$w_buff1~0_17) (= v_~a$w_buff0_used~0_89 1) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= v_~a$w_buff0_used~0_90 v_~a$w_buff1_used~0_60) (= 0 (mod v_~a$w_buff1_used~0_60 256))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_90, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_17, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_16, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_89, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_60, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 20:47:25,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In455969188 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In455969188 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out455969188| ~a$w_buff1~0_In455969188)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out455969188| ~a~0_In455969188)))) InVars {~a~0=~a~0_In455969188, ~a$w_buff1~0=~a$w_buff1~0_In455969188, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In455969188, ~a$w_buff1_used~0=~a$w_buff1_used~0_In455969188} OutVars{~a~0=~a~0_In455969188, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out455969188|, ~a$w_buff1~0=~a$w_buff1~0_In455969188, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In455969188, ~a$w_buff1_used~0=~a$w_buff1_used~0_In455969188} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 20:47:25,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In739121504 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In739121504 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out739121504| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out739121504| ~a$w_buff0_used~0_In739121504)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In739121504, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In739121504} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out739121504|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In739121504, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In739121504} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 20:47:25,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In-1370083955 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd1~0_In-1370083955 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1370083955 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1370083955 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1370083955|)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1370083955| ~a$w_buff1_used~0_In-1370083955) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1370083955, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1370083955, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1370083955, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1370083955} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1370083955|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1370083955, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1370083955, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1370083955, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1370083955} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 20:47:25,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-1425242325 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1425242325 256)))) (or (and (= 0 ~a$r_buff0_thd1~0_Out-1425242325) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_In-1425242325 ~a$r_buff0_thd1~0_Out-1425242325) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1425242325, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1425242325} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1425242325|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1425242325, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1425242325} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:47:25,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In1956220040 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In1956220040 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1956220040 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1956220040 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out1956220040| 0)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out1956220040| ~a$r_buff1_thd1~0_In1956220040) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1956220040, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1956220040, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1956220040, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1956220040} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1956220040|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1956220040, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1956220040, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1956220040, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1956220040} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 20:47:25,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L760-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:47:25,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= v_~a~0_20 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_20, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 20:47:25,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In325271653 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In325271653 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out325271653| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In325271653 |P1Thread1of1ForFork2_#t~ite11_Out325271653|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In325271653, ~a$w_buff0_used~0=~a$w_buff0_used~0_In325271653} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In325271653, ~a$w_buff0_used~0=~a$w_buff0_used~0_In325271653, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out325271653|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 20:47:25,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1653034033 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1653034033 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1653034033 256))) (.cse3 (= (mod ~a$r_buff1_thd2~0_In1653034033 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out1653034033| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out1653034033| ~a$w_buff1_used~0_In1653034033)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1653034033, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1653034033, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1653034033, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1653034033} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1653034033, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1653034033, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1653034033, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1653034033|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1653034033} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 20:47:25,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In365126922 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In365126922 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out365126922|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd2~0_In365126922 |P1Thread1of1ForFork2_#t~ite13_Out365126922|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In365126922, ~a$w_buff0_used~0=~a$w_buff0_used~0_In365126922} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In365126922, ~a$w_buff0_used~0=~a$w_buff0_used~0_In365126922, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out365126922|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 20:47:25,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In445372187 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In445372187 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In445372187 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In445372187 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out445372187|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out445372187| ~a$r_buff1_thd2~0_In445372187)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In445372187, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In445372187, ~a$w_buff0_used~0=~a$w_buff0_used~0_In445372187, ~a$w_buff1_used~0=~a$w_buff1_used~0_In445372187} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In445372187, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In445372187, ~a$w_buff0_used~0=~a$w_buff0_used~0_In445372187, ~a$w_buff1_used~0=~a$w_buff1_used~0_In445372187, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out445372187|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 20:47:25,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L780-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 20:47:25,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In442648949 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out442648949| ~a$w_buff0~0_In442648949) (= |P2Thread1of1ForFork0_#t~ite20_In442648949| |P2Thread1of1ForFork0_#t~ite20_Out442648949|)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In442648949 256)))) (or (= (mod ~a$w_buff0_used~0_In442648949 256) 0) (and (= (mod ~a$w_buff1_used~0_In442648949 256) 0) .cse1) (and (= 0 (mod ~a$r_buff1_thd3~0_In442648949 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite21_Out442648949| |P2Thread1of1ForFork0_#t~ite20_Out442648949|) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out442648949| ~a$w_buff0~0_In442648949)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In442648949, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In442648949, ~a$w_buff0_used~0=~a$w_buff0_used~0_In442648949, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In442648949, ~a$w_buff1_used~0=~a$w_buff1_used~0_In442648949, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In442648949|, ~weak$$choice2~0=~weak$$choice2~0_In442648949} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out442648949|, ~a$w_buff0~0=~a$w_buff0~0_In442648949, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In442648949, ~a$w_buff0_used~0=~a$w_buff0_used~0_In442648949, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In442648949, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out442648949|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In442648949, ~weak$$choice2~0=~weak$$choice2~0_In442648949} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 20:47:25,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In224748934 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out224748934| |P2Thread1of1ForFork0_#t~ite26_Out224748934|) (= |P2Thread1of1ForFork0_#t~ite26_Out224748934| ~a$w_buff0_used~0_In224748934) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In224748934 256)))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In224748934 256)) .cse1) (= (mod ~a$w_buff0_used~0_In224748934 256) 0) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In224748934 256)))))) (and (= |P2Thread1of1ForFork0_#t~ite27_Out224748934| ~a$w_buff0_used~0_In224748934) (= |P2Thread1of1ForFork0_#t~ite26_In224748934| |P2Thread1of1ForFork0_#t~ite26_Out224748934|) (not .cse0)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In224748934|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In224748934, ~a$w_buff0_used~0=~a$w_buff0_used~0_In224748934, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In224748934, ~a$w_buff1_used~0=~a$w_buff1_used~0_In224748934, ~weak$$choice2~0=~weak$$choice2~0_In224748934} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out224748934|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out224748934|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In224748934, ~a$w_buff0_used~0=~a$w_buff0_used~0_In224748934, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In224748934, ~a$w_buff1_used~0=~a$w_buff1_used~0_In224748934, ~weak$$choice2~0=~weak$$choice2~0_In224748934} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 20:47:25,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L804-->L804-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-438684327 256)))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-438684327 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In-438684327 256)) .cse0) (= (mod ~a$w_buff0_used~0_In-438684327 256) 0) (and (= (mod ~a$r_buff1_thd3~0_In-438684327 256) 0) .cse0))) (= |P2Thread1of1ForFork0_#t~ite30_Out-438684327| |P2Thread1of1ForFork0_#t~ite29_Out-438684327|) .cse1 (= ~a$w_buff1_used~0_In-438684327 |P2Thread1of1ForFork0_#t~ite29_Out-438684327|)) (and (not .cse1) (= ~a$w_buff1_used~0_In-438684327 |P2Thread1of1ForFork0_#t~ite30_Out-438684327|) (= |P2Thread1of1ForFork0_#t~ite29_In-438684327| |P2Thread1of1ForFork0_#t~ite29_Out-438684327|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-438684327, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-438684327, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-438684327, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-438684327, ~weak$$choice2~0=~weak$$choice2~0_In-438684327, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-438684327|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-438684327, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-438684327, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-438684327, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-438684327|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-438684327, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-438684327|, ~weak$$choice2~0=~weak$$choice2~0_In-438684327} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 20:47:25,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~a$r_buff0_thd3~0_48 v_~a$r_buff0_thd3~0_47)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_47, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 20:47:25,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a$flush_delayed~0_6 0) (= v_~a~0_21 v_~a$mem_tmp~0_4)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_21, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 20:47:25,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out-253039265| |P2Thread1of1ForFork0_#t~ite38_Out-253039265|)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-253039265 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-253039265 256) 0))) (or (and (= ~a~0_In-253039265 |P2Thread1of1ForFork0_#t~ite38_Out-253039265|) .cse0 (or .cse1 .cse2)) (and (= ~a$w_buff1~0_In-253039265 |P2Thread1of1ForFork0_#t~ite38_Out-253039265|) .cse0 (not .cse2) (not .cse1)))) InVars {~a~0=~a~0_In-253039265, ~a$w_buff1~0=~a$w_buff1~0_In-253039265, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-253039265, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-253039265} OutVars{~a~0=~a~0_In-253039265, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-253039265|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-253039265|, ~a$w_buff1~0=~a$w_buff1~0_In-253039265, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-253039265, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-253039265} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 20:47:25,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In789645156 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In789645156 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out789645156| 0)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out789645156| ~a$w_buff0_used~0_In789645156) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In789645156, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In789645156} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out789645156|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In789645156, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In789645156} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 20:47:25,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In540889421 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In540889421 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In540889421 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In540889421 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out540889421| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~a$w_buff1_used~0_In540889421 |P2Thread1of1ForFork0_#t~ite41_Out540889421|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In540889421, ~a$w_buff0_used~0=~a$w_buff0_used~0_In540889421, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In540889421, ~a$w_buff1_used~0=~a$w_buff1_used~0_In540889421} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In540889421, ~a$w_buff0_used~0=~a$w_buff0_used~0_In540889421, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In540889421, ~a$w_buff1_used~0=~a$w_buff1_used~0_In540889421, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out540889421|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 20:47:25,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-576333922 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-576333922 256) 0))) (or (and (= ~a$r_buff0_thd3~0_In-576333922 |P2Thread1of1ForFork0_#t~ite42_Out-576333922|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-576333922|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-576333922, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-576333922} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-576333922, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-576333922, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-576333922|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 20:47:25,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In204575494 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In204575494 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd3~0_In204575494 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In204575494 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out204575494|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In204575494 |P2Thread1of1ForFork0_#t~ite43_Out204575494|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In204575494, ~a$w_buff0_used~0=~a$w_buff0_used~0_In204575494, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In204575494, ~a$w_buff1_used~0=~a$w_buff1_used~0_In204575494} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out204575494|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In204575494, ~a$w_buff0_used~0=~a$w_buff0_used~0_In204575494, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In204575494, ~a$w_buff1_used~0=~a$w_buff1_used~0_In204575494} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 20:47:25,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 20:47:25,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:47:25,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In329506190 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In329506190 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite48_Out329506190| |ULTIMATE.start_main_#t~ite47_Out329506190|))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite47_Out329506190| ~a$w_buff1~0_In329506190)) (and (or .cse2 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out329506190| ~a~0_In329506190) .cse1))) InVars {~a~0=~a~0_In329506190, ~a$w_buff1~0=~a$w_buff1~0_In329506190, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In329506190, ~a$w_buff1_used~0=~a$w_buff1_used~0_In329506190} OutVars{~a~0=~a~0_In329506190, ~a$w_buff1~0=~a$w_buff1~0_In329506190, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out329506190|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In329506190, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out329506190|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In329506190} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 20:47:25,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1798816689 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1798816689 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out1798816689|) (not .cse1)) (and (= ~a$w_buff0_used~0_In1798816689 |ULTIMATE.start_main_#t~ite49_Out1798816689|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1798816689, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1798816689} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1798816689, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1798816689|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1798816689} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 20:47:25,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1303801498 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1303801498 256))) (.cse2 (= (mod ~a$r_buff0_thd0~0_In1303801498 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1303801498 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out1303801498| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In1303801498 |ULTIMATE.start_main_#t~ite50_Out1303801498|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1303801498, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1303801498, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1303801498, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1303801498} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1303801498|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1303801498, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1303801498, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1303801498, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1303801498} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 20:47:25,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-1418186462 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1418186462 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1418186462|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-1418186462 |ULTIMATE.start_main_#t~ite51_Out-1418186462|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1418186462, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1418186462} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1418186462|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1418186462, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1418186462} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 20:47:25,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1025176683 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1025176683 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1025176683 256))) (.cse2 (= (mod ~a$r_buff0_thd0~0_In-1025176683 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-1025176683| ~a$r_buff1_thd0~0_In-1025176683)) (and (= |ULTIMATE.start_main_#t~ite52_Out-1025176683| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1025176683, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1025176683, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1025176683, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1025176683} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1025176683|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1025176683, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1025176683, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1025176683, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1025176683} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 20:47:25,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~z~0_9) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_9 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~__unbuffered_p0_EAX~0_9 1) (= v_~__unbuffered_p2_EAX~0_8 2) (= |v_ULTIMATE.start_main_#t~ite52_11| v_~a$r_buff1_thd0~0_15) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:47:25,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:47:25 BasicIcfg [2019-12-18 20:47:25,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:47:25,790 INFO L168 Benchmark]: Toolchain (without parser) took 97100.84 ms. Allocated memory was 138.9 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 102.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 20:47:25,791 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 20:47:25,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.53 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 156.3 MB in the end (delta: -54.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:47:25,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.53 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:47:25,797 INFO L168 Benchmark]: Boogie Preprocessor took 78.06 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:47:25,798 INFO L168 Benchmark]: RCFGBuilder took 869.93 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 100.8 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:47:25,798 INFO L168 Benchmark]: TraceAbstraction took 95329.28 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 20:47:25,800 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 751.53 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 156.3 MB in the end (delta: -54.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.53 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.06 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 869.93 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 100.8 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95329.28 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 178 ProgramPointsBefore, 96 ProgramPointsAfterwards, 215 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 31 ChoiceCompositions, 6719 VarBasedMoverChecksPositive, 191 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82648 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L740] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L741] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L742] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L743] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L744] 1 a$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L750] 1 __unbuffered_p0_EAX = x [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 y = 1 [L773] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L756] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L757] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L790] 3 z = 2 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L758] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=2] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=2] [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L845] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L845] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 95.0s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 32.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6121 SDtfs, 10306 SDslu, 19250 SDs, 0 SdLazy, 7886 SolverSat, 494 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 365 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170989occurred 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: 32.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 193794 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1416 NumberOfCodeBlocks, 1416 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1321 ConstructedInterpolants, 0 QuantifiedInterpolants, 234201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...