/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:54:08,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:54:08,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:54:08,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:54:08,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:54:08,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:54:08,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:54:08,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:54:08,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:54:08,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:54:08,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:54:08,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:54:08,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:54:08,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:54:08,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:54:08,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:54:08,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:54:08,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:54:08,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:54:08,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:54:08,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:54:08,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:54:08,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:54:08,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:54:08,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:54:08,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:54:08,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:54:08,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:54:08,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:54:08,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:54:08,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:54:08,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:54:08,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:54:08,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:54:08,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:54:08,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:54:08,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:54:08,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:54:08,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:54:08,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:54:08,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:54:08,451 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:54:08,475 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:54:08,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:54:08,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:54:08,477 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:54:08,477 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:54:08,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:54:08,478 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:54:08,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:54:08,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:54:08,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:54:08,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:54:08,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:54:08,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:54:08,479 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:54:08,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:54:08,479 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:54:08,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:54:08,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:54:08,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:54:08,481 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:54:08,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:54:08,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:54:08,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:54:08,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:54:08,482 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:54:08,483 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:54:08,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:54:08,483 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:54:08,483 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:54:08,484 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:54:08,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:54:08,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:54:08,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:54:08,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:54:08,754 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:54:08,755 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.oepc.i [2019-12-18 12:54:08,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/552236709/731291ce9d15483fb2fbd25987d17a16/FLAG0b4a82629 [2019-12-18 12:54:09,384 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:54:09,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_pso.oepc.i [2019-12-18 12:54:09,406 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/552236709/731291ce9d15483fb2fbd25987d17a16/FLAG0b4a82629 [2019-12-18 12:54:09,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/552236709/731291ce9d15483fb2fbd25987d17a16 [2019-12-18 12:54:09,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:54:09,710 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:54:09,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:54:09,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:54:09,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:54:09,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:54:09" (1/1) ... [2019-12-18 12:54:09,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd6b77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:09, skipping insertion in model container [2019-12-18 12:54:09,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:54:09" (1/1) ... [2019-12-18 12:54:09,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:54:09,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:54:10,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:54:10,324 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:54:10,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:54:10,494 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:54:10,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:10 WrapperNode [2019-12-18 12:54:10,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:54:10,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:54:10,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:54:10,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:54:10,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:10" (1/1) ... [2019-12-18 12:54:10,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:10" (1/1) ... [2019-12-18 12:54:10,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:54:10,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:54:10,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:54:10,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:54:10,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:10" (1/1) ... [2019-12-18 12:54:10,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:10" (1/1) ... [2019-12-18 12:54:10,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:10" (1/1) ... [2019-12-18 12:54:10,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:10" (1/1) ... [2019-12-18 12:54:10,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:10" (1/1) ... [2019-12-18 12:54:10,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:10" (1/1) ... [2019-12-18 12:54:10,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:10" (1/1) ... [2019-12-18 12:54:10,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:54:10,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:54:10,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:54:10,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:54:10,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:10" (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 12:54:10,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:54:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:54:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:54:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:54:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:54:10,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:54:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:54:10,664 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:54:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:54:10,664 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:54:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:54:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:54:10,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:54:10,666 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 12:54:11,454 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:54:11,454 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:54:11,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:54:11 BoogieIcfgContainer [2019-12-18 12:54:11,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:54:11,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:54:11,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:54:11,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:54:11,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:54:09" (1/3) ... [2019-12-18 12:54:11,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd56345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:54:11, skipping insertion in model container [2019-12-18 12:54:11,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:10" (2/3) ... [2019-12-18 12:54:11,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd56345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:54:11, skipping insertion in model container [2019-12-18 12:54:11,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:54:11" (3/3) ... [2019-12-18 12:54:11,464 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_pso.oepc.i [2019-12-18 12:54:11,475 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:54:11,475 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:54:11,483 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:54:11,484 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:54:11,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,527 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,528 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,528 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,528 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,529 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,537 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,538 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,563 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,564 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,591 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,594 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,602 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,602 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,603 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,608 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,609 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:11,627 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:54:11,648 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:54:11,648 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:54:11,648 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:54:11,649 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:54:11,649 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:54:11,649 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:54:11,649 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:54:11,649 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:54:11,666 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 12:54:11,669 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:54:11,758 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:54:11,758 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:54:11,778 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 12:54:11,807 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:54:11,854 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:54:11,854 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:54:11,863 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 12:54:11,887 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:54:11,888 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:54:17,063 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-18 12:54:17,483 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 12:54:17,641 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 12:54:17,665 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78858 [2019-12-18 12:54:17,665 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 12:54:17,669 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-18 12:54:36,828 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-18 12:54:36,829 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-18 12:54:36,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:54:36,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:54:36,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:54:36,836 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 12:54:36,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:54:36,841 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-18 12:54:36,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:54:36,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630447713] [2019-12-18 12:54:36,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:54:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:54:37,052 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 12:54:37,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630447713] [2019-12-18 12:54:37,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:54:37,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:54:37,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641667496] [2019-12-18 12:54:37,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:54:37,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:54:37,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:54:37,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:54:37,078 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-18 12:54:39,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:54:39,940 INFO L93 Difference]: Finished difference Result 114110 states and 484570 transitions. [2019-12-18 12:54:39,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:54:39,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:54:39,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:54:40,688 INFO L225 Difference]: With dead ends: 114110 [2019-12-18 12:54:40,688 INFO L226 Difference]: Without dead ends: 107012 [2019-12-18 12:54:40,689 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 12:54:47,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107012 states. [2019-12-18 12:54:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107012 to 107012. [2019-12-18 12:54:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107012 states. [2019-12-18 12:54:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107012 states to 107012 states and 453812 transitions. [2019-12-18 12:54:50,793 INFO L78 Accepts]: Start accepts. Automaton has 107012 states and 453812 transitions. Word has length 3 [2019-12-18 12:54:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:54:50,793 INFO L462 AbstractCegarLoop]: Abstraction has 107012 states and 453812 transitions. [2019-12-18 12:54:50,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:54:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 107012 states and 453812 transitions. [2019-12-18 12:54:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:54:50,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:54:50,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:54:50,798 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 12:54:50,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:54:50,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1578322365, now seen corresponding path program 1 times [2019-12-18 12:54:50,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:54:50,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190992307] [2019-12-18 12:54:50,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:54:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:54:50,892 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 12:54:50,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190992307] [2019-12-18 12:54:50,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:54:50,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:54:50,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268113315] [2019-12-18 12:54:50,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:54:50,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:54:50,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:54:50,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:54:50,896 INFO L87 Difference]: Start difference. First operand 107012 states and 453812 transitions. Second operand 4 states. [2019-12-18 12:54:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:54:56,515 INFO L93 Difference]: Finished difference Result 166210 states and 677236 transitions. [2019-12-18 12:54:56,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:54:56,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:54:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:54:57,093 INFO L225 Difference]: With dead ends: 166210 [2019-12-18 12:54:57,093 INFO L226 Difference]: Without dead ends: 166161 [2019-12-18 12:54:57,094 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 12:55:02,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166161 states. [2019-12-18 12:55:05,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166161 to 151748. [2019-12-18 12:55:05,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151748 states. [2019-12-18 12:55:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151748 states to 151748 states and 626089 transitions. [2019-12-18 12:55:06,194 INFO L78 Accepts]: Start accepts. Automaton has 151748 states and 626089 transitions. Word has length 11 [2019-12-18 12:55:06,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:06,195 INFO L462 AbstractCegarLoop]: Abstraction has 151748 states and 626089 transitions. [2019-12-18 12:55:06,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:55:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand 151748 states and 626089 transitions. [2019-12-18 12:55:06,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:55:06,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:06,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:06,201 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 12:55:06,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:06,202 INFO L82 PathProgramCache]: Analyzing trace with hash 608601994, now seen corresponding path program 1 times [2019-12-18 12:55:06,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:06,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184572181] [2019-12-18 12:55:06,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:06,266 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 12:55:06,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184572181] [2019-12-18 12:55:06,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:06,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:06,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893503174] [2019-12-18 12:55:06,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:06,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:06,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:06,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:06,268 INFO L87 Difference]: Start difference. First operand 151748 states and 626089 transitions. Second operand 3 states. [2019-12-18 12:55:10,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:10,735 INFO L93 Difference]: Finished difference Result 33068 states and 106908 transitions. [2019-12-18 12:55:10,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:10,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:55:10,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:10,793 INFO L225 Difference]: With dead ends: 33068 [2019-12-18 12:55:10,793 INFO L226 Difference]: Without dead ends: 33068 [2019-12-18 12:55:10,794 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 12:55:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33068 states. [2019-12-18 12:55:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33068 to 33068. [2019-12-18 12:55:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-18 12:55:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 106908 transitions. [2019-12-18 12:55:11,383 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 106908 transitions. Word has length 13 [2019-12-18 12:55:11,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:11,384 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 106908 transitions. [2019-12-18 12:55:11,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 106908 transitions. [2019-12-18 12:55:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:55:11,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:11,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:11,387 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 12:55:11,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:11,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1174763718, now seen corresponding path program 1 times [2019-12-18 12:55:11,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:11,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352151065] [2019-12-18 12:55:11,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:11,497 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 12:55:11,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352151065] [2019-12-18 12:55:11,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:11,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:11,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115763818] [2019-12-18 12:55:11,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:55:11,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:55:11,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:55:11,499 INFO L87 Difference]: Start difference. First operand 33068 states and 106908 transitions. Second operand 5 states. [2019-12-18 12:55:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:12,051 INFO L93 Difference]: Finished difference Result 45410 states and 145082 transitions. [2019-12-18 12:55:12,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:55:12,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 12:55:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:12,129 INFO L225 Difference]: With dead ends: 45410 [2019-12-18 12:55:12,130 INFO L226 Difference]: Without dead ends: 45410 [2019-12-18 12:55:12,130 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 12:55:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45410 states. [2019-12-18 12:55:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45410 to 38207. [2019-12-18 12:55:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38207 states. [2019-12-18 12:55:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38207 states to 38207 states and 123094 transitions. [2019-12-18 12:55:13,201 INFO L78 Accepts]: Start accepts. Automaton has 38207 states and 123094 transitions. Word has length 16 [2019-12-18 12:55:13,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:13,202 INFO L462 AbstractCegarLoop]: Abstraction has 38207 states and 123094 transitions. [2019-12-18 12:55:13,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:55:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 38207 states and 123094 transitions. [2019-12-18 12:55:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:55:13,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:13,212 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 12:55:13,212 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 12:55:13,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:13,213 INFO L82 PathProgramCache]: Analyzing trace with hash -219431606, now seen corresponding path program 1 times [2019-12-18 12:55:13,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:13,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318271456] [2019-12-18 12:55:13,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:13,315 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 12:55:13,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318271456] [2019-12-18 12:55:13,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:13,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:55:13,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218220684] [2019-12-18 12:55:13,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:55:13,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:13,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:55:13,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:55:13,318 INFO L87 Difference]: Start difference. First operand 38207 states and 123094 transitions. Second operand 6 states. [2019-12-18 12:55:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:14,384 INFO L93 Difference]: Finished difference Result 56872 states and 178934 transitions. [2019-12-18 12:55:14,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:55:14,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 12:55:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:14,484 INFO L225 Difference]: With dead ends: 56872 [2019-12-18 12:55:14,484 INFO L226 Difference]: Without dead ends: 56865 [2019-12-18 12:55:14,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:55:14,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56865 states. [2019-12-18 12:55:15,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56865 to 38602. [2019-12-18 12:55:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38602 states. [2019-12-18 12:55:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38602 states to 38602 states and 123793 transitions. [2019-12-18 12:55:15,296 INFO L78 Accepts]: Start accepts. Automaton has 38602 states and 123793 transitions. Word has length 22 [2019-12-18 12:55:15,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:15,296 INFO L462 AbstractCegarLoop]: Abstraction has 38602 states and 123793 transitions. [2019-12-18 12:55:15,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:55:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 38602 states and 123793 transitions. [2019-12-18 12:55:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:55:15,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:15,309 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 12:55:15,309 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 12:55:15,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:15,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2132778958, now seen corresponding path program 1 times [2019-12-18 12:55:15,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:15,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78201830] [2019-12-18 12:55:15,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:15,374 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 12:55:15,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78201830] [2019-12-18 12:55:15,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:15,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:15,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317787933] [2019-12-18 12:55:15,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:55:15,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:15,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:55:15,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:55:15,377 INFO L87 Difference]: Start difference. First operand 38602 states and 123793 transitions. Second operand 4 states. [2019-12-18 12:55:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:15,439 INFO L93 Difference]: Finished difference Result 16014 states and 48574 transitions. [2019-12-18 12:55:15,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:55:15,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:55:15,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:15,461 INFO L225 Difference]: With dead ends: 16014 [2019-12-18 12:55:15,461 INFO L226 Difference]: Without dead ends: 16014 [2019-12-18 12:55:15,461 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 12:55:15,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-12-18 12:55:15,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 15686. [2019-12-18 12:55:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-18 12:55:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 47638 transitions. [2019-12-18 12:55:15,941 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 47638 transitions. Word has length 25 [2019-12-18 12:55:15,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:15,941 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 47638 transitions. [2019-12-18 12:55:15,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:55:15,941 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 47638 transitions. [2019-12-18 12:55:15,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:55:15,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:15,952 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 12:55:15,953 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 12:55:15,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:15,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1790545903, now seen corresponding path program 1 times [2019-12-18 12:55:15,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:15,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886600356] [2019-12-18 12:55:15,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:55:16,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886600356] [2019-12-18 12:55:16,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:16,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:55:16,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23770912] [2019-12-18 12:55:16,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:55:16,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:16,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:55:16,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:55:16,058 INFO L87 Difference]: Start difference. First operand 15686 states and 47638 transitions. Second operand 6 states. [2019-12-18 12:55:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:16,646 INFO L93 Difference]: Finished difference Result 22624 states and 66983 transitions. [2019-12-18 12:55:16,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:55:16,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:55:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:16,679 INFO L225 Difference]: With dead ends: 22624 [2019-12-18 12:55:16,679 INFO L226 Difference]: Without dead ends: 22624 [2019-12-18 12:55:16,679 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 12:55:16,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22624 states. [2019-12-18 12:55:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22624 to 18003. [2019-12-18 12:55:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18003 states. [2019-12-18 12:55:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18003 states to 18003 states and 54460 transitions. [2019-12-18 12:55:16,991 INFO L78 Accepts]: Start accepts. Automaton has 18003 states and 54460 transitions. Word has length 27 [2019-12-18 12:55:16,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:16,991 INFO L462 AbstractCegarLoop]: Abstraction has 18003 states and 54460 transitions. [2019-12-18 12:55:16,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:55:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 18003 states and 54460 transitions. [2019-12-18 12:55:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:55:17,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:17,010 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 12:55:17,010 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 12:55:17,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:17,010 INFO L82 PathProgramCache]: Analyzing trace with hash -718999585, now seen corresponding path program 1 times [2019-12-18 12:55:17,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:17,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686434856] [2019-12-18 12:55:17,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:17,113 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 12:55:17,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686434856] [2019-12-18 12:55:17,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:17,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:55:17,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788090462] [2019-12-18 12:55:17,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:55:17,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:17,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:55:17,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:55:17,115 INFO L87 Difference]: Start difference. First operand 18003 states and 54460 transitions. Second operand 7 states. [2019-12-18 12:55:18,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:18,283 INFO L93 Difference]: Finished difference Result 24689 states and 72792 transitions. [2019-12-18 12:55:18,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:55:18,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:55:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:18,318 INFO L225 Difference]: With dead ends: 24689 [2019-12-18 12:55:18,318 INFO L226 Difference]: Without dead ends: 24689 [2019-12-18 12:55:18,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:55:18,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-18 12:55:18,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 16556. [2019-12-18 12:55:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16556 states. [2019-12-18 12:55:18,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16556 states to 16556 states and 50149 transitions. [2019-12-18 12:55:18,627 INFO L78 Accepts]: Start accepts. Automaton has 16556 states and 50149 transitions. Word has length 33 [2019-12-18 12:55:18,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:18,627 INFO L462 AbstractCegarLoop]: Abstraction has 16556 states and 50149 transitions. [2019-12-18 12:55:18,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:55:18,628 INFO L276 IsEmpty]: Start isEmpty. Operand 16556 states and 50149 transitions. [2019-12-18 12:55:18,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:55:18,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:18,652 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 12:55:18,652 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 12:55:18,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:18,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1488715022, now seen corresponding path program 1 times [2019-12-18 12:55:18,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:18,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253808551] [2019-12-18 12:55:18,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:18,728 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 12:55:18,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253808551] [2019-12-18 12:55:18,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:18,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:18,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945624133] [2019-12-18 12:55:18,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:18,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:18,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:18,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:18,732 INFO L87 Difference]: Start difference. First operand 16556 states and 50149 transitions. Second operand 3 states. [2019-12-18 12:55:18,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:18,911 INFO L93 Difference]: Finished difference Result 31245 states and 94721 transitions. [2019-12-18 12:55:18,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:18,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:55:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:18,954 INFO L225 Difference]: With dead ends: 31245 [2019-12-18 12:55:18,954 INFO L226 Difference]: Without dead ends: 17019 [2019-12-18 12:55:18,954 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 12:55:19,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-12-18 12:55:19,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 16954. [2019-12-18 12:55:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-18 12:55:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50123 transitions. [2019-12-18 12:55:19,547 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50123 transitions. Word has length 39 [2019-12-18 12:55:19,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:19,547 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50123 transitions. [2019-12-18 12:55:19,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:19,548 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50123 transitions. [2019-12-18 12:55:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:55:19,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:19,580 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 12:55:19,580 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 12:55:19,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:19,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1258899919, now seen corresponding path program 1 times [2019-12-18 12:55:19,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:19,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832134064] [2019-12-18 12:55:19,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:19,673 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 12:55:19,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832134064] [2019-12-18 12:55:19,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:19,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:19,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032478381] [2019-12-18 12:55:19,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:55:19,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:19,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:55:19,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:55:19,675 INFO L87 Difference]: Start difference. First operand 16954 states and 50123 transitions. Second operand 4 states. [2019-12-18 12:55:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:19,755 INFO L93 Difference]: Finished difference Result 24032 states and 72414 transitions. [2019-12-18 12:55:19,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:55:19,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 12:55:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:19,770 INFO L225 Difference]: With dead ends: 24032 [2019-12-18 12:55:19,771 INFO L226 Difference]: Without dead ends: 10093 [2019-12-18 12:55:19,771 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 12:55:19,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-18 12:55:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10019. [2019-12-18 12:55:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10019 states. [2019-12-18 12:55:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 28985 transitions. [2019-12-18 12:55:19,923 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 28985 transitions. Word has length 40 [2019-12-18 12:55:19,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:19,923 INFO L462 AbstractCegarLoop]: Abstraction has 10019 states and 28985 transitions. [2019-12-18 12:55:19,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:55:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 28985 transitions. [2019-12-18 12:55:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:55:19,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:19,937 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 12:55:19,937 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 12:55:19,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:19,937 INFO L82 PathProgramCache]: Analyzing trace with hash -328554267, now seen corresponding path program 2 times [2019-12-18 12:55:19,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:19,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859950975] [2019-12-18 12:55:19,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:20,011 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 12:55:20,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859950975] [2019-12-18 12:55:20,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:20,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:55:20,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408244890] [2019-12-18 12:55:20,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:55:20,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:20,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:55:20,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:55:20,014 INFO L87 Difference]: Start difference. First operand 10019 states and 28985 transitions. Second operand 5 states. [2019-12-18 12:55:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:20,059 INFO L93 Difference]: Finished difference Result 9224 states and 27210 transitions. [2019-12-18 12:55:20,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:55:20,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:55:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:20,071 INFO L225 Difference]: With dead ends: 9224 [2019-12-18 12:55:20,071 INFO L226 Difference]: Without dead ends: 6480 [2019-12-18 12:55:20,072 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 12:55:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-12-18 12:55:20,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 6480. [2019-12-18 12:55:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6480 states. [2019-12-18 12:55:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 20925 transitions. [2019-12-18 12:55:20,181 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 20925 transitions. Word has length 40 [2019-12-18 12:55:20,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:20,182 INFO L462 AbstractCegarLoop]: Abstraction has 6480 states and 20925 transitions. [2019-12-18 12:55:20,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:55:20,182 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 20925 transitions. [2019-12-18 12:55:20,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:20,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:20,189 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 12:55:20,190 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 12:55:20,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:20,190 INFO L82 PathProgramCache]: Analyzing trace with hash -195559637, now seen corresponding path program 1 times [2019-12-18 12:55:20,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:20,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642291758] [2019-12-18 12:55:20,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:20,249 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 12:55:20,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642291758] [2019-12-18 12:55:20,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:20,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:20,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063776988] [2019-12-18 12:55:20,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:20,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:20,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:20,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:20,251 INFO L87 Difference]: Start difference. First operand 6480 states and 20925 transitions. Second operand 3 states. [2019-12-18 12:55:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:20,323 INFO L93 Difference]: Finished difference Result 9612 states and 30454 transitions. [2019-12-18 12:55:20,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:20,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:55:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:20,340 INFO L225 Difference]: With dead ends: 9612 [2019-12-18 12:55:20,341 INFO L226 Difference]: Without dead ends: 9612 [2019-12-18 12:55:20,341 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 12:55:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9612 states. [2019-12-18 12:55:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9612 to 7416. [2019-12-18 12:55:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7416 states. [2019-12-18 12:55:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 23733 transitions. [2019-12-18 12:55:20,499 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 23733 transitions. Word has length 64 [2019-12-18 12:55:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:20,500 INFO L462 AbstractCegarLoop]: Abstraction has 7416 states and 23733 transitions. [2019-12-18 12:55:20,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 23733 transitions. [2019-12-18 12:55:20,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:20,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:20,509 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 12:55:20,510 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 12:55:20,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:20,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1426110435, now seen corresponding path program 1 times [2019-12-18 12:55:20,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:20,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488289769] [2019-12-18 12:55:20,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:20,611 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 12:55:20,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488289769] [2019-12-18 12:55:20,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:20,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:55:20,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349631689] [2019-12-18 12:55:20,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:55:20,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:20,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:55:20,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:55:20,613 INFO L87 Difference]: Start difference. First operand 7416 states and 23733 transitions. Second operand 7 states. [2019-12-18 12:55:20,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:20,873 INFO L93 Difference]: Finished difference Result 14786 states and 46379 transitions. [2019-12-18 12:55:20,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:55:20,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:55:20,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:20,890 INFO L225 Difference]: With dead ends: 14786 [2019-12-18 12:55:20,890 INFO L226 Difference]: Without dead ends: 11103 [2019-12-18 12:55:20,890 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 12:55:20,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11103 states. [2019-12-18 12:55:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11103 to 9096. [2019-12-18 12:55:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9096 states. [2019-12-18 12:55:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9096 states to 9096 states and 28970 transitions. [2019-12-18 12:55:21,058 INFO L78 Accepts]: Start accepts. Automaton has 9096 states and 28970 transitions. Word has length 64 [2019-12-18 12:55:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:21,058 INFO L462 AbstractCegarLoop]: Abstraction has 9096 states and 28970 transitions. [2019-12-18 12:55:21,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:55:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 9096 states and 28970 transitions. [2019-12-18 12:55:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:21,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:21,069 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 12:55:21,069 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 12:55:21,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:21,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1226826331, now seen corresponding path program 2 times [2019-12-18 12:55:21,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:21,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044355222] [2019-12-18 12:55:21,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:21,164 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 12:55:21,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044355222] [2019-12-18 12:55:21,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:21,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:55:21,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161313698] [2019-12-18 12:55:21,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:55:21,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:21,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:55:21,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:55:21,166 INFO L87 Difference]: Start difference. First operand 9096 states and 28970 transitions. Second operand 7 states. [2019-12-18 12:55:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:21,433 INFO L93 Difference]: Finished difference Result 16709 states and 52072 transitions. [2019-12-18 12:55:21,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:55:21,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:55:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:21,453 INFO L225 Difference]: With dead ends: 16709 [2019-12-18 12:55:21,453 INFO L226 Difference]: Without dead ends: 12623 [2019-12-18 12:55:21,454 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 12:55:21,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12623 states. [2019-12-18 12:55:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12623 to 10382. [2019-12-18 12:55:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10382 states. [2019-12-18 12:55:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 32866 transitions. [2019-12-18 12:55:21,633 INFO L78 Accepts]: Start accepts. Automaton has 10382 states and 32866 transitions. Word has length 64 [2019-12-18 12:55:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:21,633 INFO L462 AbstractCegarLoop]: Abstraction has 10382 states and 32866 transitions. [2019-12-18 12:55:21,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:55:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 10382 states and 32866 transitions. [2019-12-18 12:55:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:21,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:21,644 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 12:55:21,644 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 12:55:21,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:21,645 INFO L82 PathProgramCache]: Analyzing trace with hash -2098893209, now seen corresponding path program 3 times [2019-12-18 12:55:21,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:21,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010298329] [2019-12-18 12:55:21,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:21,775 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 12:55:21,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010298329] [2019-12-18 12:55:21,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:21,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:55:21,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992650912] [2019-12-18 12:55:21,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:55:21,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:21,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:55:21,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:55:21,777 INFO L87 Difference]: Start difference. First operand 10382 states and 32866 transitions. Second operand 9 states. [2019-12-18 12:55:22,408 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-18 12:55:23,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:23,122 INFO L93 Difference]: Finished difference Result 36233 states and 111090 transitions. [2019-12-18 12:55:23,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:55:23,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:55:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:23,182 INFO L225 Difference]: With dead ends: 36233 [2019-12-18 12:55:23,182 INFO L226 Difference]: Without dead ends: 32009 [2019-12-18 12:55:23,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:55:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32009 states. [2019-12-18 12:55:23,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32009 to 10214. [2019-12-18 12:55:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10214 states. [2019-12-18 12:55:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10214 states to 10214 states and 32290 transitions. [2019-12-18 12:55:23,501 INFO L78 Accepts]: Start accepts. Automaton has 10214 states and 32290 transitions. Word has length 64 [2019-12-18 12:55:23,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:23,501 INFO L462 AbstractCegarLoop]: Abstraction has 10214 states and 32290 transitions. [2019-12-18 12:55:23,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:55:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 10214 states and 32290 transitions. [2019-12-18 12:55:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:23,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:23,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:23,517 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 12:55:23,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:23,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1900940369, now seen corresponding path program 1 times [2019-12-18 12:55:23,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:23,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232736307] [2019-12-18 12:55:23,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:23,565 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 12:55:23,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232736307] [2019-12-18 12:55:23,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:23,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:23,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031869244] [2019-12-18 12:55:23,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:23,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:23,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:23,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:23,567 INFO L87 Difference]: Start difference. First operand 10214 states and 32290 transitions. Second operand 3 states. [2019-12-18 12:55:23,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:23,649 INFO L93 Difference]: Finished difference Result 12867 states and 40113 transitions. [2019-12-18 12:55:23,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:23,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:55:23,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:23,673 INFO L225 Difference]: With dead ends: 12867 [2019-12-18 12:55:23,674 INFO L226 Difference]: Without dead ends: 12867 [2019-12-18 12:55:23,674 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 12:55:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12867 states. [2019-12-18 12:55:23,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12867 to 10671. [2019-12-18 12:55:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10671 states. [2019-12-18 12:55:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10671 states to 10671 states and 33392 transitions. [2019-12-18 12:55:23,977 INFO L78 Accepts]: Start accepts. Automaton has 10671 states and 33392 transitions. Word has length 64 [2019-12-18 12:55:23,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:23,978 INFO L462 AbstractCegarLoop]: Abstraction has 10671 states and 33392 transitions. [2019-12-18 12:55:23,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 10671 states and 33392 transitions. [2019-12-18 12:55:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:23,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:23,996 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 12:55:23,996 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 12:55:23,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:23,997 INFO L82 PathProgramCache]: Analyzing trace with hash -612356637, now seen corresponding path program 4 times [2019-12-18 12:55:23,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:23,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882276372] [2019-12-18 12:55:23,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:24,116 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 12:55:24,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882276372] [2019-12-18 12:55:24,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:24,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:55:24,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491459228] [2019-12-18 12:55:24,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:55:24,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:24,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:55:24,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:55:24,119 INFO L87 Difference]: Start difference. First operand 10671 states and 33392 transitions. Second operand 9 states. [2019-12-18 12:55:25,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:25,164 INFO L93 Difference]: Finished difference Result 28791 states and 88355 transitions. [2019-12-18 12:55:25,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:55:25,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:55:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:25,201 INFO L225 Difference]: With dead ends: 28791 [2019-12-18 12:55:25,202 INFO L226 Difference]: Without dead ends: 26476 [2019-12-18 12:55:25,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:55:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26476 states. [2019-12-18 12:55:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26476 to 10699. [2019-12-18 12:55:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10699 states. [2019-12-18 12:55:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10699 states to 10699 states and 33546 transitions. [2019-12-18 12:55:25,475 INFO L78 Accepts]: Start accepts. Automaton has 10699 states and 33546 transitions. Word has length 64 [2019-12-18 12:55:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:25,475 INFO L462 AbstractCegarLoop]: Abstraction has 10699 states and 33546 transitions. [2019-12-18 12:55:25,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:55:25,476 INFO L276 IsEmpty]: Start isEmpty. Operand 10699 states and 33546 transitions. [2019-12-18 12:55:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:25,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:25,489 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 12:55:25,489 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 12:55:25,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:25,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1413769055, now seen corresponding path program 5 times [2019-12-18 12:55:25,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:25,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992399288] [2019-12-18 12:55:25,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:25,600 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 12:55:25,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992399288] [2019-12-18 12:55:25,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:25,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:55:25,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971151078] [2019-12-18 12:55:25,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:55:25,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:25,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:55:25,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:55:25,602 INFO L87 Difference]: Start difference. First operand 10699 states and 33546 transitions. Second operand 5 states. [2019-12-18 12:55:25,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:25,937 INFO L93 Difference]: Finished difference Result 12384 states and 38249 transitions. [2019-12-18 12:55:25,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:55:25,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 12:55:25,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:25,956 INFO L225 Difference]: With dead ends: 12384 [2019-12-18 12:55:25,956 INFO L226 Difference]: Without dead ends: 12384 [2019-12-18 12:55:25,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:55:26,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12384 states. [2019-12-18 12:55:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12384 to 11630. [2019-12-18 12:55:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11630 states. [2019-12-18 12:55:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11630 states to 11630 states and 36167 transitions. [2019-12-18 12:55:26,142 INFO L78 Accepts]: Start accepts. Automaton has 11630 states and 36167 transitions. Word has length 64 [2019-12-18 12:55:26,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:26,143 INFO L462 AbstractCegarLoop]: Abstraction has 11630 states and 36167 transitions. [2019-12-18 12:55:26,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:55:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 11630 states and 36167 transitions. [2019-12-18 12:55:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:26,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:26,160 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 12:55:26,160 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 12:55:26,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1714079827, now seen corresponding path program 6 times [2019-12-18 12:55:26,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:26,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839323068] [2019-12-18 12:55:26,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:26,433 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 12:55:26,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839323068] [2019-12-18 12:55:26,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:26,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:55:26,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596880209] [2019-12-18 12:55:26,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:55:26,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:26,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:55:26,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:55:26,435 INFO L87 Difference]: Start difference. First operand 11630 states and 36167 transitions. Second operand 7 states. [2019-12-18 12:55:27,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:27,378 INFO L93 Difference]: Finished difference Result 20495 states and 61153 transitions. [2019-12-18 12:55:27,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:55:27,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:55:27,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:27,407 INFO L225 Difference]: With dead ends: 20495 [2019-12-18 12:55:27,407 INFO L226 Difference]: Without dead ends: 20327 [2019-12-18 12:55:27,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:55:27,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20327 states. [2019-12-18 12:55:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20327 to 17055. [2019-12-18 12:55:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17055 states. [2019-12-18 12:55:27,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17055 states to 17055 states and 51675 transitions. [2019-12-18 12:55:27,707 INFO L78 Accepts]: Start accepts. Automaton has 17055 states and 51675 transitions. Word has length 64 [2019-12-18 12:55:27,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:27,707 INFO L462 AbstractCegarLoop]: Abstraction has 17055 states and 51675 transitions. [2019-12-18 12:55:27,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:55:27,707 INFO L276 IsEmpty]: Start isEmpty. Operand 17055 states and 51675 transitions. [2019-12-18 12:55:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:27,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:27,726 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 12:55:27,726 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 12:55:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:27,727 INFO L82 PathProgramCache]: Analyzing trace with hash 768567647, now seen corresponding path program 7 times [2019-12-18 12:55:27,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:27,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798455300] [2019-12-18 12:55:27,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:27,814 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 12:55:27,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798455300] [2019-12-18 12:55:27,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:27,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:55:27,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101409136] [2019-12-18 12:55:27,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:55:27,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:27,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:55:27,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:55:27,817 INFO L87 Difference]: Start difference. First operand 17055 states and 51675 transitions. Second operand 6 states. [2019-12-18 12:55:28,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:28,724 INFO L93 Difference]: Finished difference Result 30832 states and 92113 transitions. [2019-12-18 12:55:28,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 12:55:28,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-18 12:55:28,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:28,796 INFO L225 Difference]: With dead ends: 30832 [2019-12-18 12:55:28,796 INFO L226 Difference]: Without dead ends: 30612 [2019-12-18 12:55:28,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:55:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30612 states. [2019-12-18 12:55:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30612 to 22076. [2019-12-18 12:55:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22076 states. [2019-12-18 12:55:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22076 states to 22076 states and 66013 transitions. [2019-12-18 12:55:29,546 INFO L78 Accepts]: Start accepts. Automaton has 22076 states and 66013 transitions. Word has length 64 [2019-12-18 12:55:29,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:29,546 INFO L462 AbstractCegarLoop]: Abstraction has 22076 states and 66013 transitions. [2019-12-18 12:55:29,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:55:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 22076 states and 66013 transitions. [2019-12-18 12:55:29,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:29,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:29,580 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 12:55:29,581 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 12:55:29,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:29,581 INFO L82 PathProgramCache]: Analyzing trace with hash 908702963, now seen corresponding path program 8 times [2019-12-18 12:55:29,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:29,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832883268] [2019-12-18 12:55:29,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:29,681 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 12:55:29,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832883268] [2019-12-18 12:55:29,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:29,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:29,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316691105] [2019-12-18 12:55:29,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:29,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:29,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:29,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:29,683 INFO L87 Difference]: Start difference. First operand 22076 states and 66013 transitions. Second operand 3 states. [2019-12-18 12:55:29,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:29,765 INFO L93 Difference]: Finished difference Result 22076 states and 66012 transitions. [2019-12-18 12:55:29,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:29,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:55:29,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:29,794 INFO L225 Difference]: With dead ends: 22076 [2019-12-18 12:55:29,794 INFO L226 Difference]: Without dead ends: 22076 [2019-12-18 12:55:29,796 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 12:55:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22076 states. [2019-12-18 12:55:30,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22076 to 20293. [2019-12-18 12:55:30,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20293 states. [2019-12-18 12:55:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20293 states to 20293 states and 61028 transitions. [2019-12-18 12:55:30,123 INFO L78 Accepts]: Start accepts. Automaton has 20293 states and 61028 transitions. Word has length 64 [2019-12-18 12:55:30,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:30,123 INFO L462 AbstractCegarLoop]: Abstraction has 20293 states and 61028 transitions. [2019-12-18 12:55:30,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand 20293 states and 61028 transitions. [2019-12-18 12:55:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:55:30,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:30,145 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 12:55:30,146 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 12:55:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:30,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1480180120, now seen corresponding path program 1 times [2019-12-18 12:55:30,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:30,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910613225] [2019-12-18 12:55:30,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:30,238 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 12:55:30,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910613225] [2019-12-18 12:55:30,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:30,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:30,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726670192] [2019-12-18 12:55:30,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:55:30,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:30,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:55:30,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:55:30,240 INFO L87 Difference]: Start difference. First operand 20293 states and 61028 transitions. Second operand 4 states. [2019-12-18 12:55:30,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:30,399 INFO L93 Difference]: Finished difference Result 22812 states and 68909 transitions. [2019-12-18 12:55:30,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:30,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 12:55:30,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:30,699 INFO L225 Difference]: With dead ends: 22812 [2019-12-18 12:55:30,699 INFO L226 Difference]: Without dead ends: 22812 [2019-12-18 12:55:30,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 12:55:30,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22812 states. [2019-12-18 12:55:31,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22812 to 18944. [2019-12-18 12:55:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18944 states. [2019-12-18 12:55:31,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18944 states to 18944 states and 57652 transitions. [2019-12-18 12:55:31,163 INFO L78 Accepts]: Start accepts. Automaton has 18944 states and 57652 transitions. Word has length 65 [2019-12-18 12:55:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:31,164 INFO L462 AbstractCegarLoop]: Abstraction has 18944 states and 57652 transitions. [2019-12-18 12:55:31,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:55:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 18944 states and 57652 transitions. [2019-12-18 12:55:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:55:31,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:31,191 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 12:55:31,192 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 12:55:31,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:31,192 INFO L82 PathProgramCache]: Analyzing trace with hash 140741933, now seen corresponding path program 1 times [2019-12-18 12:55:31,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:31,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807975980] [2019-12-18 12:55:31,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:31,281 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 12:55:31,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807975980] [2019-12-18 12:55:31,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:31,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:55:31,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722501555] [2019-12-18 12:55:31,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:55:31,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:31,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:55:31,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:55:31,283 INFO L87 Difference]: Start difference. First operand 18944 states and 57652 transitions. Second operand 7 states. [2019-12-18 12:55:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:31,748 INFO L93 Difference]: Finished difference Result 17296 states and 51846 transitions. [2019-12-18 12:55:31,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:55:31,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 12:55:31,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:31,772 INFO L225 Difference]: With dead ends: 17296 [2019-12-18 12:55:31,772 INFO L226 Difference]: Without dead ends: 17292 [2019-12-18 12:55:31,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:55:31,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17292 states. [2019-12-18 12:55:32,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17292 to 16643. [2019-12-18 12:55:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16643 states. [2019-12-18 12:55:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16643 states to 16643 states and 49988 transitions. [2019-12-18 12:55:32,030 INFO L78 Accepts]: Start accepts. Automaton has 16643 states and 49988 transitions. Word has length 66 [2019-12-18 12:55:32,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:32,030 INFO L462 AbstractCegarLoop]: Abstraction has 16643 states and 49988 transitions. [2019-12-18 12:55:32,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:55:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 16643 states and 49988 transitions. [2019-12-18 12:55:32,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:55:32,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:32,047 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 12:55:32,047 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 12:55:32,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:32,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1117537298, now seen corresponding path program 1 times [2019-12-18 12:55:32,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:32,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847974170] [2019-12-18 12:55:32,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:55:32,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847974170] [2019-12-18 12:55:32,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:32,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:55:32,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980893107] [2019-12-18 12:55:32,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:55:32,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:32,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:55:32,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:55:32,169 INFO L87 Difference]: Start difference. First operand 16643 states and 49988 transitions. Second operand 9 states. [2019-12-18 12:55:33,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:33,048 INFO L93 Difference]: Finished difference Result 33028 states and 98033 transitions. [2019-12-18 12:55:33,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:55:33,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:55:33,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:33,086 INFO L225 Difference]: With dead ends: 33028 [2019-12-18 12:55:33,086 INFO L226 Difference]: Without dead ends: 28010 [2019-12-18 12:55:33,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:55:33,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28010 states. [2019-12-18 12:55:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28010 to 16121. [2019-12-18 12:55:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16121 states. [2019-12-18 12:55:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16121 states to 16121 states and 48269 transitions. [2019-12-18 12:55:33,421 INFO L78 Accepts]: Start accepts. Automaton has 16121 states and 48269 transitions. Word has length 66 [2019-12-18 12:55:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:33,421 INFO L462 AbstractCegarLoop]: Abstraction has 16121 states and 48269 transitions. [2019-12-18 12:55:33,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:55:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 16121 states and 48269 transitions. [2019-12-18 12:55:33,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:55:33,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:33,437 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 12:55:33,437 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 12:55:33,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:33,437 INFO L82 PathProgramCache]: Analyzing trace with hash -228951166, now seen corresponding path program 2 times [2019-12-18 12:55:33,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:33,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530132302] [2019-12-18 12:55:33,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:33,567 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 12:55:33,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530132302] [2019-12-18 12:55:33,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:33,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:55:33,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419486599] [2019-12-18 12:55:33,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:55:33,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:33,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:55:33,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:55:33,569 INFO L87 Difference]: Start difference. First operand 16121 states and 48269 transitions. Second operand 9 states. [2019-12-18 12:55:34,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:34,554 INFO L93 Difference]: Finished difference Result 34411 states and 101723 transitions. [2019-12-18 12:55:34,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:55:34,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:55:34,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:34,615 INFO L225 Difference]: With dead ends: 34411 [2019-12-18 12:55:34,616 INFO L226 Difference]: Without dead ends: 29543 [2019-12-18 12:55:34,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:55:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29543 states. [2019-12-18 12:55:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29543 to 15952. [2019-12-18 12:55:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15952 states. [2019-12-18 12:55:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15952 states to 15952 states and 47719 transitions. [2019-12-18 12:55:35,448 INFO L78 Accepts]: Start accepts. Automaton has 15952 states and 47719 transitions. Word has length 66 [2019-12-18 12:55:35,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:35,449 INFO L462 AbstractCegarLoop]: Abstraction has 15952 states and 47719 transitions. [2019-12-18 12:55:35,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:55:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 15952 states and 47719 transitions. [2019-12-18 12:55:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:55:35,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:35,478 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 12:55:35,478 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 12:55:35,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:35,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779120, now seen corresponding path program 1 times [2019-12-18 12:55:35,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:35,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865518534] [2019-12-18 12:55:35,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:35,584 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 12:55:35,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865518534] [2019-12-18 12:55:35,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:35,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:35,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706392235] [2019-12-18 12:55:35,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:35,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:35,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:35,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:35,587 INFO L87 Difference]: Start difference. First operand 15952 states and 47719 transitions. Second operand 3 states. [2019-12-18 12:55:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:35,641 INFO L93 Difference]: Finished difference Result 11202 states and 33274 transitions. [2019-12-18 12:55:35,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:35,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:55:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:35,660 INFO L225 Difference]: With dead ends: 11202 [2019-12-18 12:55:35,660 INFO L226 Difference]: Without dead ends: 11202 [2019-12-18 12:55:35,660 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 12:55:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11202 states. [2019-12-18 12:55:35,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11202 to 10905. [2019-12-18 12:55:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10905 states. [2019-12-18 12:55:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10905 states to 10905 states and 32417 transitions. [2019-12-18 12:55:35,893 INFO L78 Accepts]: Start accepts. Automaton has 10905 states and 32417 transitions. Word has length 66 [2019-12-18 12:55:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:35,894 INFO L462 AbstractCegarLoop]: Abstraction has 10905 states and 32417 transitions. [2019-12-18 12:55:35,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 10905 states and 32417 transitions. [2019-12-18 12:55:35,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:55:35,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:35,909 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 12:55:35,909 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 12:55:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:35,910 INFO L82 PathProgramCache]: Analyzing trace with hash -171582022, now seen corresponding path program 1 times [2019-12-18 12:55:35,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:35,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76320902] [2019-12-18 12:55:35,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:36,034 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 12:55:36,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76320902] [2019-12-18 12:55:36,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:36,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:55:36,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472230049] [2019-12-18 12:55:36,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:55:36,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:36,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:55:36,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:55:36,036 INFO L87 Difference]: Start difference. First operand 10905 states and 32417 transitions. Second operand 8 states. [2019-12-18 12:55:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:36,848 INFO L93 Difference]: Finished difference Result 19062 states and 55968 transitions. [2019-12-18 12:55:36,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:55:36,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-18 12:55:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:36,871 INFO L225 Difference]: With dead ends: 19062 [2019-12-18 12:55:36,871 INFO L226 Difference]: Without dead ends: 14286 [2019-12-18 12:55:36,872 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 12:55:36,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14286 states. [2019-12-18 12:55:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14286 to 11292. [2019-12-18 12:55:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11292 states. [2019-12-18 12:55:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11292 states to 11292 states and 33273 transitions. [2019-12-18 12:55:37,054 INFO L78 Accepts]: Start accepts. Automaton has 11292 states and 33273 transitions. Word has length 67 [2019-12-18 12:55:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:37,055 INFO L462 AbstractCegarLoop]: Abstraction has 11292 states and 33273 transitions. [2019-12-18 12:55:37,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:55:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 11292 states and 33273 transitions. [2019-12-18 12:55:37,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:55:37,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:37,066 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 12:55:37,066 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 12:55:37,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:37,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1425975690, now seen corresponding path program 2 times [2019-12-18 12:55:37,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:37,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075946796] [2019-12-18 12:55:37,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:37,178 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 12:55:37,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075946796] [2019-12-18 12:55:37,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:37,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:55:37,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34149361] [2019-12-18 12:55:37,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:55:37,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:37,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:55:37,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:55:37,180 INFO L87 Difference]: Start difference. First operand 11292 states and 33273 transitions. Second operand 9 states. [2019-12-18 12:55:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:37,876 INFO L93 Difference]: Finished difference Result 18351 states and 53580 transitions. [2019-12-18 12:55:37,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:55:37,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 12:55:37,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:37,898 INFO L225 Difference]: With dead ends: 18351 [2019-12-18 12:55:37,899 INFO L226 Difference]: Without dead ends: 13749 [2019-12-18 12:55:37,899 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 12:55:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13749 states. [2019-12-18 12:55:38,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13749 to 11172. [2019-12-18 12:55:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11172 states. [2019-12-18 12:55:38,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11172 states to 11172 states and 32905 transitions. [2019-12-18 12:55:38,086 INFO L78 Accepts]: Start accepts. Automaton has 11172 states and 32905 transitions. Word has length 67 [2019-12-18 12:55:38,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:38,086 INFO L462 AbstractCegarLoop]: Abstraction has 11172 states and 32905 transitions. [2019-12-18 12:55:38,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:55:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 11172 states and 32905 transitions. [2019-12-18 12:55:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:55:38,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:38,097 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 12:55:38,097 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 12:55:38,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:38,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1279627604, now seen corresponding path program 3 times [2019-12-18 12:55:38,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:38,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827678754] [2019-12-18 12:55:38,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:38,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 12:55:38,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827678754] [2019-12-18 12:55:38,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:38,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:55:38,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705068084] [2019-12-18 12:55:38,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:55:38,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:38,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:55:38,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:55:38,221 INFO L87 Difference]: Start difference. First operand 11172 states and 32905 transitions. Second operand 10 states. [2019-12-18 12:55:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:38,925 INFO L93 Difference]: Finished difference Result 17825 states and 51971 transitions. [2019-12-18 12:55:38,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:55:38,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:55:38,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:38,944 INFO L225 Difference]: With dead ends: 17825 [2019-12-18 12:55:38,944 INFO L226 Difference]: Without dead ends: 14151 [2019-12-18 12:55:38,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:55:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2019-12-18 12:55:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 11188. [2019-12-18 12:55:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11188 states. [2019-12-18 12:55:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11188 states to 11188 states and 32899 transitions. [2019-12-18 12:55:39,130 INFO L78 Accepts]: Start accepts. Automaton has 11188 states and 32899 transitions. Word has length 67 [2019-12-18 12:55:39,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:39,130 INFO L462 AbstractCegarLoop]: Abstraction has 11188 states and 32899 transitions. [2019-12-18 12:55:39,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:55:39,130 INFO L276 IsEmpty]: Start isEmpty. Operand 11188 states and 32899 transitions. [2019-12-18 12:55:39,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:55:39,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:39,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:39,142 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:39,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:39,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1642000384, now seen corresponding path program 4 times [2019-12-18 12:55:39,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:39,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66169697] [2019-12-18 12:55:39,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:39,305 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 12:55:39,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66169697] [2019-12-18 12:55:39,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:39,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:55:39,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746244109] [2019-12-18 12:55:39,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:55:39,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:39,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:55:39,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:55:39,307 INFO L87 Difference]: Start difference. First operand 11188 states and 32899 transitions. Second operand 11 states. [2019-12-18 12:55:40,127 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-18 12:55:40,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:40,192 INFO L93 Difference]: Finished difference Result 17008 states and 49664 transitions. [2019-12-18 12:55:40,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:55:40,193 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:55:40,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:40,210 INFO L225 Difference]: With dead ends: 17008 [2019-12-18 12:55:40,210 INFO L226 Difference]: Without dead ends: 13402 [2019-12-18 12:55:40,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-18 12:55:40,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13402 states. [2019-12-18 12:55:40,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13402 to 10878. [2019-12-18 12:55:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10878 states. [2019-12-18 12:55:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10878 states to 10878 states and 32039 transitions. [2019-12-18 12:55:40,380 INFO L78 Accepts]: Start accepts. Automaton has 10878 states and 32039 transitions. Word has length 67 [2019-12-18 12:55:40,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:40,380 INFO L462 AbstractCegarLoop]: Abstraction has 10878 states and 32039 transitions. [2019-12-18 12:55:40,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:55:40,380 INFO L276 IsEmpty]: Start isEmpty. Operand 10878 states and 32039 transitions. [2019-12-18 12:55:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:55:40,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:40,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:40,392 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:40,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:40,392 INFO L82 PathProgramCache]: Analyzing trace with hash 8609018, now seen corresponding path program 5 times [2019-12-18 12:55:40,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:40,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448146559] [2019-12-18 12:55:40,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:40,559 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 12:55:40,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448146559] [2019-12-18 12:55:40,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:40,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:55:40,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348864936] [2019-12-18 12:55:40,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:55:40,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:40,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:55:40,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:55:40,561 INFO L87 Difference]: Start difference. First operand 10878 states and 32039 transitions. Second operand 12 states. [2019-12-18 12:55:41,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:41,259 INFO L93 Difference]: Finished difference Result 13597 states and 39721 transitions. [2019-12-18 12:55:41,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:55:41,259 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 12:55:41,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:41,276 INFO L225 Difference]: With dead ends: 13597 [2019-12-18 12:55:41,276 INFO L226 Difference]: Without dead ends: 13370 [2019-12-18 12:55:41,277 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 12:55:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13370 states. [2019-12-18 12:55:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13370 to 10702. [2019-12-18 12:55:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10702 states. [2019-12-18 12:55:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10702 states to 10702 states and 31567 transitions. [2019-12-18 12:55:41,448 INFO L78 Accepts]: Start accepts. Automaton has 10702 states and 31567 transitions. Word has length 67 [2019-12-18 12:55:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:41,448 INFO L462 AbstractCegarLoop]: Abstraction has 10702 states and 31567 transitions. [2019-12-18 12:55:41,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:55:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 10702 states and 31567 transitions. [2019-12-18 12:55:41,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:55:41,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:41,459 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 12:55:41,459 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:41,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:41,459 INFO L82 PathProgramCache]: Analyzing trace with hash -919262302, now seen corresponding path program 6 times [2019-12-18 12:55:41,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:41,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756197452] [2019-12-18 12:55:41,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:55:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:55:41,592 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:55:41,592 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:55:41,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_266) (= 0 v_~__unbuffered_p2_EAX~0_32) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t639~0.base_24| 1)) (= |v_ULTIMATE.start_main_~#t639~0.offset_19| 0) (= 0 v_~weak$$choice0~0_14) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t639~0.base_24| 4)) (= |v_#NULL.offset_6| 0) (= 0 v_~a$w_buff0_used~0_826) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~a$r_buff0_thd2~0_102) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t639~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t639~0.base_24|) |v_ULTIMATE.start_main_~#t639~0.offset_19| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t639~0.base_24|) 0) (= v_~a$r_buff0_thd0~0_110 0) (= v_~__unbuffered_cnt~0_102 0) (= v_~main$tmp_guard1~0_29 0) (= v_~a$w_buff0~0_397 0) (= v_~a$flush_delayed~0_27 0) (= 0 |v_#NULL.base_6|) (= v_~y~0_39 0) (= v_~a$mem_tmp~0_16 0) (= v_~__unbuffered_p2_EBX~0_42 0) (= 0 v_~a$r_buff1_thd1~0_142) (= v_~a~0_178 0) (= v_~weak$$choice2~0_137 0) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~z~0_40 0) (= 0 v_~a$w_buff1_used~0_523) (= 0 v_~a$r_buff1_thd2~0_138) (= v_~a$r_buff1_thd3~0_297 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t639~0.base_24|) (= v_~a$r_buff0_thd3~0_334 0) (= v_~a$r_buff1_thd0~0_145 0) (= v_~__unbuffered_p0_EBX~0_105 0) (= 0 v_~a$r_buff0_thd1~0_183) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_138, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_47|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_137|, ~a~0=v_~a~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_105, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_297, ULTIMATE.start_main_~#t640~0.offset=|v_ULTIMATE.start_main_~#t640~0.offset_19|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_826, ULTIMATE.start_main_~#t640~0.base=|v_ULTIMATE.start_main_~#t640~0.base_26|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_183, ULTIMATE.start_main_~#t641~0.base=|v_ULTIMATE.start_main_~#t641~0.base_27|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_397, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_145, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t639~0.base=|v_ULTIMATE.start_main_~#t639~0.base_24|, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_102, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_129|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_~#t639~0.offset=|v_ULTIMATE.start_main_~#t639~0.offset_19|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~a$w_buff1~0=v_~a$w_buff1~0_266, ULTIMATE.start_main_~#t641~0.offset=|v_ULTIMATE.start_main_~#t641~0.offset_20|, ~y~0=v_~y~0_39, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_29|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_142, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_334, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_40, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_523, ~weak$$choice2~0=v_~weak$$choice2~0_137, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} 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, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ULTIMATE.start_main_~#t640~0.offset, ~a$w_buff0_used~0, ULTIMATE.start_main_~#t640~0.base, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t641~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t639~0.base, ~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_~#t639~0.offset, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t641~0.offset, ~y~0, 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, ~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] because there is no mapped edge [2019-12-18 12:55:41,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t640~0.base_10| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t640~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t640~0.base_10|) |v_ULTIMATE.start_main_~#t640~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t640~0.base_10| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t640~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t640~0.offset_9|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t640~0.base_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t640~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_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t640~0.offset=|v_ULTIMATE.start_main_~#t640~0.offset_9|, ULTIMATE.start_main_~#t640~0.base=|v_ULTIMATE.start_main_~#t640~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t640~0.offset, ULTIMATE.start_main_~#t640~0.base, #length] because there is no mapped edge [2019-12-18 12:55:41,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L837-1-->L839: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t641~0.base_13|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t641~0.base_13| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t641~0.base_13|) (= |v_ULTIMATE.start_main_~#t641~0.offset_11| 0) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t641~0.base_13|) 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t641~0.base_13| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t641~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t641~0.base_13|) |v_ULTIMATE.start_main_~#t641~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t641~0.base=|v_ULTIMATE.start_main_~#t641~0.base_13|, #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|, ULTIMATE.start_main_~#t641~0.offset=|v_ULTIMATE.start_main_~#t641~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t641~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t641~0.offset, #length] because there is no mapped edge [2019-12-18 12:55:41,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_30 |v_P0Thread1of1ForFork1_#in~arg.offset_30|) (= v_~a$w_buff0_used~0_232 v_~a$w_buff1_used~0_149) (= 1 v_~a$w_buff0_used~0_231) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= v_~a$w_buff0~0_80 v_~a$w_buff1~0_62) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= 1 v_~a$w_buff0~0_79) (= |v_P0Thread1of1ForFork1_#in~arg.base_30| v_P0Thread1of1ForFork1_~arg.base_30) (= (mod v_~a$w_buff1_used~0_149 256) 0)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_80, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_232, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_62, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_79, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_231, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_30} 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 12:55:41,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-85133822 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-85133822 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-85133822| ~a~0_In-85133822) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-85133822| ~a$w_buff1~0_In-85133822) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In-85133822, ~a$w_buff1~0=~a$w_buff1~0_In-85133822, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-85133822, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-85133822} OutVars{~a~0=~a~0_In-85133822, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-85133822|, ~a$w_buff1~0=~a$w_buff1~0_In-85133822, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-85133822, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-85133822} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:55:41,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-189334886 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-189334886 256)))) (or (and (= ~a$w_buff0_used~0_In-189334886 |P0Thread1of1ForFork1_#t~ite5_Out-189334886|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-189334886|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-189334886, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-189334886} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-189334886|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-189334886, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-189334886} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:55:41,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In2129261888 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In2129261888 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In2129261888 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In2129261888 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out2129261888| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite6_Out2129261888| ~a$w_buff1_used~0_In2129261888) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2129261888, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2129261888, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2129261888, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2129261888} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out2129261888|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2129261888, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2129261888, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2129261888, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2129261888} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:55:41,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In2033846233 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In2033846233 256) 0))) (or (and (not .cse0) (not .cse1) (= ~a$r_buff0_thd1~0_Out2033846233 0)) (and (= ~a$r_buff0_thd1~0_Out2033846233 ~a$r_buff0_thd1~0_In2033846233) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2033846233, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2033846233} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2033846233|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2033846233, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out2033846233} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:55:41,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1398955995 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1398955995 256))) (.cse2 (= (mod ~a$r_buff1_thd1~0_In-1398955995 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-1398955995 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd1~0_In-1398955995 |P0Thread1of1ForFork1_#t~ite8_Out-1398955995|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1398955995|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1398955995, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1398955995, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1398955995, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1398955995} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1398955995|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1398955995, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1398955995, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1398955995, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1398955995} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:55:41,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L760-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} 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 12:55:41,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1450418925 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In1450418925| |P2Thread1of1ForFork0_#t~ite20_Out1450418925|) (= ~a$w_buff0~0_In1450418925 |P2Thread1of1ForFork0_#t~ite21_Out1450418925|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out1450418925| |P2Thread1of1ForFork0_#t~ite21_Out1450418925|) (= ~a$w_buff0~0_In1450418925 |P2Thread1of1ForFork0_#t~ite20_Out1450418925|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1450418925 256)))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In1450418925 256) 0)) (= (mod ~a$w_buff0_used~0_In1450418925 256) 0) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1450418925 256)))))))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1450418925, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1450418925, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1450418925, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1450418925, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1450418925, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1450418925|, ~weak$$choice2~0=~weak$$choice2~0_In1450418925} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1450418925|, ~a$w_buff0~0=~a$w_buff0~0_In1450418925, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1450418925, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1450418925, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1450418925, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1450418925|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1450418925, ~weak$$choice2~0=~weak$$choice2~0_In1450418925} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:55:41,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1138565118 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In-1138565118| |P2Thread1of1ForFork0_#t~ite26_Out-1138565118|) (= ~a$w_buff0_used~0_In-1138565118 |P2Thread1of1ForFork0_#t~ite27_Out-1138565118|)) (and (= ~a$w_buff0_used~0_In-1138565118 |P2Thread1of1ForFork0_#t~ite26_Out-1138565118|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1138565118 256)))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1138565118 256))) (= 0 (mod ~a$w_buff0_used~0_In-1138565118 256)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-1138565118 256))))) (= |P2Thread1of1ForFork0_#t~ite27_Out-1138565118| |P2Thread1of1ForFork0_#t~ite26_Out-1138565118|) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1138565118|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1138565118, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1138565118, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1138565118, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1138565118, ~weak$$choice2~0=~weak$$choice2~0_In-1138565118} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1138565118|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1138565118|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1138565118, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1138565118, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1138565118, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1138565118, ~weak$$choice2~0=~weak$$choice2~0_In-1138565118} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:55:41,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In552261684 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_In552261684| |P2Thread1of1ForFork0_#t~ite29_Out552261684|) (= |P2Thread1of1ForFork0_#t~ite30_Out552261684| ~a$w_buff1_used~0_In552261684) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite30_Out552261684| |P2Thread1of1ForFork0_#t~ite29_Out552261684|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In552261684 256) 0))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In552261684 256) 0)) (and (= 0 (mod ~a$r_buff1_thd3~0_In552261684 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In552261684 256)))) (= |P2Thread1of1ForFork0_#t~ite29_Out552261684| ~a$w_buff1_used~0_In552261684)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In552261684, ~a$w_buff0_used~0=~a$w_buff0_used~0_In552261684, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In552261684, ~a$w_buff1_used~0=~a$w_buff1_used~0_In552261684, ~weak$$choice2~0=~weak$$choice2~0_In552261684, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In552261684|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In552261684, ~a$w_buff0_used~0=~a$w_buff0_used~0_In552261684, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In552261684, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out552261684|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In552261684, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out552261684|, ~weak$$choice2~0=~weak$$choice2~0_In552261684} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:55:41,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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_59, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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 12:55:41,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_20| v_~a~0_46) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_20|} OutVars{~a~0=v_~a~0_46, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_19|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:55:41,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-1542781047 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1542781047 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1542781047| ~a$w_buff0_used~0_In-1542781047) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1542781047| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1542781047, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1542781047} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1542781047, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1542781047, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1542781047|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:55:41,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In1003592388 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In1003592388 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In1003592388 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1003592388 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1003592388 |P1Thread1of1ForFork2_#t~ite12_Out1003592388|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1003592388|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1003592388, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1003592388, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1003592388, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1003592388} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1003592388, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1003592388, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1003592388, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1003592388|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1003592388} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:55:41,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1136384836 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-1136384836 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-1136384836| ~a$r_buff0_thd2~0_In-1136384836) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1136384836| 0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1136384836, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1136384836} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1136384836, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1136384836, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1136384836|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:55:41,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-557951433 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-557951433 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-557951433 256))) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-557951433 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out-557951433| ~a$r_buff1_thd2~0_In-557951433)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-557951433| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-557951433, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-557951433, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-557951433, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-557951433} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-557951433, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-557951433, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-557951433, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-557951433, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-557951433|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:55:41,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_30| v_~a$r_buff1_thd2~0_61) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_30|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_61, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_29|, 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 12:55:41,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_8 0) (= v_~a~0_52 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_9 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_9} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_52, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 12:55:41,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out1676877656| |P2Thread1of1ForFork0_#t~ite39_Out1676877656|)) (.cse2 (= (mod ~a$w_buff1_used~0_In1676877656 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1676877656 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out1676877656| ~a~0_In1676877656) .cse0 (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= ~a$w_buff1~0_In1676877656 |P2Thread1of1ForFork0_#t~ite38_Out1676877656|)))) InVars {~a~0=~a~0_In1676877656, ~a$w_buff1~0=~a$w_buff1~0_In1676877656, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1676877656, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1676877656} OutVars{~a~0=~a~0_In1676877656, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1676877656|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1676877656|, ~a$w_buff1~0=~a$w_buff1~0_In1676877656, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1676877656, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1676877656} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:55:41,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1358699120 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1358699120 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out1358699120| 0)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1358699120 |P2Thread1of1ForFork0_#t~ite40_Out1358699120|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1358699120, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1358699120} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1358699120|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1358699120, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1358699120} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:55:41,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1640482117 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-1640482117 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1640482117 256))) (.cse3 (= (mod ~a$r_buff1_thd3~0_In-1640482117 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1640482117| ~a$w_buff1_used~0_In-1640482117) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1640482117| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1640482117, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1640482117, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1640482117, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1640482117} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1640482117, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1640482117, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1640482117, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1640482117, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1640482117|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:55:41,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1071014349 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1071014349 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1071014349|)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1071014349| ~a$r_buff0_thd3~0_In1071014349) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1071014349, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1071014349} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1071014349, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1071014349, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1071014349|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:55:41,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-485100397 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-485100397 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In-485100397 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-485100397 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-485100397|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~a$r_buff1_thd3~0_In-485100397 |P2Thread1of1ForFork0_#t~ite43_Out-485100397|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-485100397, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-485100397, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-485100397, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-485100397} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-485100397|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-485100397, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-485100397, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-485100397, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-485100397} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:55:41,614 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_127 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_59 (+ v_~__unbuffered_cnt~0_60 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, 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 12:55:41,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:55:41,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1553336431 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1553336431 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out-1553336431| |ULTIMATE.start_main_#t~ite48_Out-1553336431|))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1553336431| ~a~0_In-1553336431) (or .cse0 .cse1) .cse2) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1553336431| ~a$w_buff1~0_In-1553336431) (not .cse1) .cse2))) InVars {~a~0=~a~0_In-1553336431, ~a$w_buff1~0=~a$w_buff1~0_In-1553336431, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1553336431, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1553336431} OutVars{~a~0=~a~0_In-1553336431, ~a$w_buff1~0=~a$w_buff1~0_In-1553336431, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1553336431|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1553336431, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1553336431|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1553336431} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:55:41,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In1538158587 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1538158587 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1538158587| ~a$w_buff0_used~0_In1538158587)) (and (= |ULTIMATE.start_main_#t~ite49_Out1538158587| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1538158587, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1538158587} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1538158587, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1538158587|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1538158587} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:55:41,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1689617890 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In1689617890 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In1689617890 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In1689617890 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1689617890|)) (and (= ~a$w_buff1_used~0_In1689617890 |ULTIMATE.start_main_#t~ite50_Out1689617890|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1689617890, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1689617890, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1689617890, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1689617890} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1689617890|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1689617890, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1689617890, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1689617890, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1689617890} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:55:41,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1374909522 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In1374909522 256) 0))) (or (and (= ~a$r_buff0_thd0~0_In1374909522 |ULTIMATE.start_main_#t~ite51_Out1374909522|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1374909522|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1374909522, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1374909522} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1374909522|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1374909522, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1374909522} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:55:41,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In-855362791 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-855362791 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-855362791 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd0~0_In-855362791 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In-855362791 |ULTIMATE.start_main_#t~ite52_Out-855362791|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-855362791|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-855362791, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-855362791, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-855362791, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-855362791} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-855362791|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-855362791, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-855362791, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-855362791, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-855362791} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:55:41,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= 1 v_~__unbuffered_p0_EAX~0_40) (= 2 v_~__unbuffered_p2_EAX~0_20) (= |v_ULTIMATE.start_main_#t~ite52_35| v_~a$r_buff1_thd0~0_75) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~__unbuffered_p0_EBX~0_40 0) (= v_~z~0_25 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} 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 12:55:41,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:55:41 BasicIcfg [2019-12-18 12:55:41,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:55:41,703 INFO L168 Benchmark]: Toolchain (without parser) took 91993.44 ms. Allocated memory was 138.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 12:55:41,712 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 12:55:41,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.75 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.1 MB in the beginning and 156.0 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-12-18 12:55:41,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.06 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 153.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:55:41,714 INFO L168 Benchmark]: Boogie Preprocessor took 39.00 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:55:41,717 INFO L168 Benchmark]: RCFGBuilder took 855.39 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 100.0 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:55:41,717 INFO L168 Benchmark]: TraceAbstraction took 90244.33 ms. Allocated memory was 202.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.3 MB in the beginning and 1.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 12:55:41,724 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.49 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.75 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.1 MB in the beginning and 156.0 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.06 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 153.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.00 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 855.39 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 100.0 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90244.33 ms. Allocated memory was 202.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.3 MB in the beginning and 1.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 215 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7050 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 78858 CheckedPairsTotal, 113 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(&t639, ((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(&t640, ((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(&t641, ((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) [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 [__unbuffered_cnt=1, __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, 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 [__unbuffered_cnt=1, __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, 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] [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 [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: 89.9s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 31.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6398 SDtfs, 9474 SDslu, 20761 SDs, 0 SdLazy, 9457 SolverSat, 408 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 389 GetRequests, 74 SyntacticMatches, 11 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151748occurred 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: 29.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 157677 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1640 NumberOfCodeBlocks, 1640 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1542 ConstructedInterpolants, 0 QuantifiedInterpolants, 339924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...