/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:50:04,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:50:04,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:50:04,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:50:04,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:50:04,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:50:04,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:50:04,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:50:04,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:50:04,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:50:04,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:50:04,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:50:04,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:50:04,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:50:04,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:50:04,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:50:04,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:50:04,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:50:04,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:50:04,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:50:04,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:50:04,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:50:04,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:50:04,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:50:04,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:50:04,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:50:04,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:50:04,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:50:04,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:50:04,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:50:04,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:50:04,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:50:04,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:50:04,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:50:04,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:50:04,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:50:04,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:50:04,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:50:04,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:50:04,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:50:04,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:50:04,446 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:50:04,471 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:50:04,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:50:04,473 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:50:04,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:50:04,473 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:50:04,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:50:04,474 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:50:04,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:50:04,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:50:04,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:50:04,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:50:04,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:50:04,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:50:04,476 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:50:04,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:50:04,477 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:50:04,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:50:04,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:50:04,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:50:04,477 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:50:04,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:50:04,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:50:04,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:50:04,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:50:04,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:50:04,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:50:04,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:50:04,479 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:50:04,479 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:50:04,479 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:50:04,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:50:04,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:50:04,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:50:04,764 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:50:04,765 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:50:04,766 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.oepc.i [2019-12-27 06:50:04,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a192a7736/035fd678cf8e4b3bb739c64946729b85/FLAG7bbe935b8 [2019-12-27 06:50:05,444 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:50:05,445 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_pso.oepc.i [2019-12-27 06:50:05,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a192a7736/035fd678cf8e4b3bb739c64946729b85/FLAG7bbe935b8 [2019-12-27 06:50:05,752 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a192a7736/035fd678cf8e4b3bb739c64946729b85 [2019-12-27 06:50:05,761 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:50:05,763 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:50:05,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:50:05,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:50:05,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:50:05,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:50:05" (1/1) ... [2019-12-27 06:50:05,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10660ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:05, skipping insertion in model container [2019-12-27 06:50:05,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:50:05" (1/1) ... [2019-12-27 06:50:05,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:50:05,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:50:06,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:50:06,327 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:50:06,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:50:06,508 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:50:06,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:06 WrapperNode [2019-12-27 06:50:06,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:50:06,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:50:06,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:50:06,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:50:06,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:06" (1/1) ... [2019-12-27 06:50:06,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:06" (1/1) ... [2019-12-27 06:50:06,585 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:50:06,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:50:06,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:50:06,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:50:06,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:06" (1/1) ... [2019-12-27 06:50:06,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:06" (1/1) ... [2019-12-27 06:50:06,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:06" (1/1) ... [2019-12-27 06:50:06,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:06" (1/1) ... [2019-12-27 06:50:06,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:06" (1/1) ... [2019-12-27 06:50:06,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:06" (1/1) ... [2019-12-27 06:50:06,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:06" (1/1) ... [2019-12-27 06:50:06,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:50:06,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:50:06,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:50:06,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:50:06,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:50:06,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:50:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:50:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:50:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:50:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:50:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:50:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:50:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:50:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:50:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:50:06,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:50:06,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:50:06,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:50:06,697 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:50:07,491 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:50:07,492 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:50:07,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:50:07 BoogieIcfgContainer [2019-12-27 06:50:07,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:50:07,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:50:07,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:50:07,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:50:07,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:50:05" (1/3) ... [2019-12-27 06:50:07,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746fc165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:50:07, skipping insertion in model container [2019-12-27 06:50:07,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:06" (2/3) ... [2019-12-27 06:50:07,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746fc165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:50:07, skipping insertion in model container [2019-12-27 06:50:07,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:50:07" (3/3) ... [2019-12-27 06:50:07,509 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_pso.oepc.i [2019-12-27 06:50:07,522 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:50:07,522 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:50:07,537 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:50:07,538 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:50:07,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,608 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,608 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,608 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,609 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,609 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,640 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,640 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,655 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,656 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,683 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,684 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,684 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,687 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,688 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,692 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,694 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:50:07,713 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:50:07,734 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:50:07,734 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:50:07,734 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:50:07,734 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:50:07,734 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:50:07,734 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:50:07,735 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:50:07,735 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:50:07,751 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 06:50:07,753 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 06:50:07,859 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 06:50:07,859 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:50:07,876 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:50:07,902 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 06:50:07,956 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 06:50:07,956 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:50:07,964 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:50:07,986 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:50:07,987 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:50:11,739 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 06:50:11,870 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 06:50:11,891 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-27 06:50:11,891 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 06:50:11,894 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 06:50:28,167 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-27 06:50:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-27 06:50:28,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:50:28,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:50:28,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:50:28,176 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:50:28,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:50:28,182 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-27 06:50:28,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:50:28,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332520819] [2019-12-27 06:50:28,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:50:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:50:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:50:28,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332520819] [2019-12-27 06:50:28,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:50:28,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:50:28,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871344967] [2019-12-27 06:50:28,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:50:28,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:50:28,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:50:28,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:50:28,470 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-27 06:50:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:50:29,936 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-27 06:50:29,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:50:29,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:50:29,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:50:33,168 INFO L225 Difference]: With dead ends: 106230 [2019-12-27 06:50:33,168 INFO L226 Difference]: Without dead ends: 99639 [2019-12-27 06:50:33,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:50:37,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-27 06:50:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-27 06:50:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-27 06:50:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-27 06:50:43,338 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-27 06:50:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:50:43,338 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-27 06:50:43,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:50:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-27 06:50:43,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:50:43,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:50:43,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:50:43,352 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:50:43,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:50:43,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-27 06:50:43,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:50:43,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941029130] [2019-12-27 06:50:43,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:50:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:50:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:50:43,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941029130] [2019-12-27 06:50:43,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:50:43,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:50:43,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308617713] [2019-12-27 06:50:43,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:50:43,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:50:43,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:50:43,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:50:43,487 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-27 06:50:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:50:48,675 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-27 06:50:48,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:50:48,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:50:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:50:49,238 INFO L225 Difference]: With dead ends: 159197 [2019-12-27 06:50:49,238 INFO L226 Difference]: Without dead ends: 159148 [2019-12-27 06:50:49,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:50:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-27 06:50:57,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-27 06:50:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-27 06:50:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-27 06:50:58,220 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-27 06:50:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:50:58,221 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-27 06:50:58,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:50:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-27 06:50:58,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:50:58,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:50:58,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:50:58,225 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:50:58,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:50:58,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-27 06:50:58,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:50:58,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490388712] [2019-12-27 06:50:58,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:50:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:50:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:50:58,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490388712] [2019-12-27 06:50:58,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:50:58,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:50:58,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804059352] [2019-12-27 06:50:58,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:50:58,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:50:58,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:50:58,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:50:58,298 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-27 06:50:58,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:50:58,420 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-27 06:50:58,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:50:58,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:50:58,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:50:58,514 INFO L225 Difference]: With dead ends: 32092 [2019-12-27 06:50:58,515 INFO L226 Difference]: Without dead ends: 32092 [2019-12-27 06:50:58,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:50:58,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-27 06:51:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-27 06:51:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-27 06:51:03,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-27 06:51:03,716 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-27 06:51:03,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:03,717 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-27 06:51:03,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:51:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-27 06:51:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:51:03,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:03,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:03,720 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:03,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:03,720 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-27 06:51:03,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:03,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914745721] [2019-12-27 06:51:03,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:03,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914745721] [2019-12-27 06:51:03,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:03,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:51:03,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242004968] [2019-12-27 06:51:03,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:51:03,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:03,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:51:03,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:51:03,869 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-27 06:51:04,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:04,401 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-27 06:51:04,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:51:04,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 06:51:04,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:04,489 INFO L225 Difference]: With dead ends: 43827 [2019-12-27 06:51:04,489 INFO L226 Difference]: Without dead ends: 43827 [2019-12-27 06:51:04,489 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-27 06:51:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-27 06:51:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-27 06:51:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-27 06:51:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-27 06:51:05,602 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-27 06:51:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:05,603 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-27 06:51:05,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:51:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-27 06:51:05,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:51:05,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:05,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:05,614 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:05,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:05,615 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-27 06:51:05,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:05,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415464235] [2019-12-27 06:51:05,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:05,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415464235] [2019-12-27 06:51:05,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:05,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:51:05,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704543507] [2019-12-27 06:51:05,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:51:05,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:05,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:51:05,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:51:05,764 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-27 06:51:06,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:06,893 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-27 06:51:06,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:51:06,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 06:51:06,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:06,986 INFO L225 Difference]: With dead ends: 56855 [2019-12-27 06:51:06,986 INFO L226 Difference]: Without dead ends: 56848 [2019-12-27 06:51:06,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:51:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-27 06:51:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-27 06:51:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-27 06:51:08,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-27 06:51:08,248 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-27 06:51:08,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:08,249 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-27 06:51:08,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:51:08,249 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-27 06:51:08,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:51:08,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:08,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:08,264 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:08,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:08,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-27 06:51:08,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:08,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585534546] [2019-12-27 06:51:08,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:08,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585534546] [2019-12-27 06:51:08,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:08,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:51:08,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019510585] [2019-12-27 06:51:08,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:51:08,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:08,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:51:08,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:51:08,328 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 4 states. [2019-12-27 06:51:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:08,392 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-27 06:51:08,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:51:08,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:51:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:08,413 INFO L225 Difference]: With dead ends: 15569 [2019-12-27 06:51:08,413 INFO L226 Difference]: Without dead ends: 15569 [2019-12-27 06:51:08,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:51:08,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-27 06:51:08,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-27 06:51:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 06:51:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-27 06:51:08,646 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-27 06:51:08,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:08,647 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-27 06:51:08,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:51:08,647 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-27 06:51:08,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:51:08,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:08,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:08,661 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:08,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:08,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-27 06:51:08,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:08,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926460437] [2019-12-27 06:51:08,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:08,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926460437] [2019-12-27 06:51:08,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:08,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:51:08,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895347432] [2019-12-27 06:51:08,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:51:08,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:08,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:51:08,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:51:08,844 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 8 states. [2019-12-27 06:51:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:09,680 INFO L93 Difference]: Finished difference Result 20385 states and 60642 transitions. [2019-12-27 06:51:09,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:51:09,681 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 06:51:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:09,709 INFO L225 Difference]: With dead ends: 20385 [2019-12-27 06:51:09,710 INFO L226 Difference]: Without dead ends: 20385 [2019-12-27 06:51:09,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:51:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20385 states. [2019-12-27 06:51:09,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20385 to 17627. [2019-12-27 06:51:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-27 06:51:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-27 06:51:09,989 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-27 06:51:09,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:09,990 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-27 06:51:09,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:51:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-27 06:51:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:51:10,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:10,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:10,009 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:10,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:10,009 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-27 06:51:10,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:10,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613761682] [2019-12-27 06:51:10,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:10,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613761682] [2019-12-27 06:51:10,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:10,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:51:10,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194293615] [2019-12-27 06:51:10,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:51:10,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:10,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:51:10,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:51:10,139 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 7 states. [2019-12-27 06:51:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:11,672 INFO L93 Difference]: Finished difference Result 24877 states and 72876 transitions. [2019-12-27 06:51:11,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:51:11,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:51:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:11,706 INFO L225 Difference]: With dead ends: 24877 [2019-12-27 06:51:11,706 INFO L226 Difference]: Without dead ends: 24877 [2019-12-27 06:51:11,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:51:11,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24877 states. [2019-12-27 06:51:11,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24877 to 16954. [2019-12-27 06:51:11,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 06:51:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50982 transitions. [2019-12-27 06:51:12,002 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50982 transitions. Word has length 33 [2019-12-27 06:51:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:12,002 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50982 transitions. [2019-12-27 06:51:12,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:51:12,003 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50982 transitions. [2019-12-27 06:51:12,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:51:12,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:12,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:12,025 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:12,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:12,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-27 06:51:12,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:12,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794180463] [2019-12-27 06:51:12,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:12,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794180463] [2019-12-27 06:51:12,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:12,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:51:12,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262145075] [2019-12-27 06:51:12,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:51:12,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:12,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:51:12,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:51:12,126 INFO L87 Difference]: Start difference. First operand 16954 states and 50982 transitions. Second operand 5 states. [2019-12-27 06:51:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:12,817 INFO L93 Difference]: Finished difference Result 23664 states and 70656 transitions. [2019-12-27 06:51:12,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:51:12,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 06:51:12,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:12,850 INFO L225 Difference]: With dead ends: 23664 [2019-12-27 06:51:12,851 INFO L226 Difference]: Without dead ends: 23664 [2019-12-27 06:51:12,851 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-27 06:51:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23664 states. [2019-12-27 06:51:13,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23664 to 22129. [2019-12-27 06:51:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22129 states. [2019-12-27 06:51:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22129 states to 22129 states and 66460 transitions. [2019-12-27 06:51:13,190 INFO L78 Accepts]: Start accepts. Automaton has 22129 states and 66460 transitions. Word has length 39 [2019-12-27 06:51:13,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:13,190 INFO L462 AbstractCegarLoop]: Abstraction has 22129 states and 66460 transitions. [2019-12-27 06:51:13,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:51:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 22129 states and 66460 transitions. [2019-12-27 06:51:13,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:51:13,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:13,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:13,220 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:13,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:13,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1240175328, now seen corresponding path program 2 times [2019-12-27 06:51:13,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:13,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579364085] [2019-12-27 06:51:13,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:13,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579364085] [2019-12-27 06:51:13,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:13,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:51:13,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231797826] [2019-12-27 06:51:13,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:51:13,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:13,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:51:13,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:51:13,288 INFO L87 Difference]: Start difference. First operand 22129 states and 66460 transitions. Second operand 5 states. [2019-12-27 06:51:13,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:13,411 INFO L93 Difference]: Finished difference Result 20882 states and 63572 transitions. [2019-12-27 06:51:13,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:51:13,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 06:51:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:13,454 INFO L225 Difference]: With dead ends: 20882 [2019-12-27 06:51:13,455 INFO L226 Difference]: Without dead ends: 20882 [2019-12-27 06:51:13,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:51:13,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20882 states. [2019-12-27 06:51:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20882 to 20042. [2019-12-27 06:51:14,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20042 states. [2019-12-27 06:51:14,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20042 states to 20042 states and 61305 transitions. [2019-12-27 06:51:14,157 INFO L78 Accepts]: Start accepts. Automaton has 20042 states and 61305 transitions. Word has length 39 [2019-12-27 06:51:14,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:14,158 INFO L462 AbstractCegarLoop]: Abstraction has 20042 states and 61305 transitions. [2019-12-27 06:51:14,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:51:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 20042 states and 61305 transitions. [2019-12-27 06:51:14,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:51:14,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:14,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:14,180 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:14,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:14,180 INFO L82 PathProgramCache]: Analyzing trace with hash 480370435, now seen corresponding path program 1 times [2019-12-27 06:51:14,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:14,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068656524] [2019-12-27 06:51:14,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:14,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:14,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068656524] [2019-12-27 06:51:14,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:14,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:51:14,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185034291] [2019-12-27 06:51:14,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:51:14,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:14,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:51:14,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:14,244 INFO L87 Difference]: Start difference. First operand 20042 states and 61305 transitions. Second operand 3 states. [2019-12-27 06:51:14,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:14,359 INFO L93 Difference]: Finished difference Result 29777 states and 91217 transitions. [2019-12-27 06:51:14,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:51:14,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:51:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:14,399 INFO L225 Difference]: With dead ends: 29777 [2019-12-27 06:51:14,399 INFO L226 Difference]: Without dead ends: 29777 [2019-12-27 06:51:14,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:14,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29777 states. [2019-12-27 06:51:14,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29777 to 22663. [2019-12-27 06:51:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22663 states. [2019-12-27 06:51:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22663 states to 22663 states and 70163 transitions. [2019-12-27 06:51:14,790 INFO L78 Accepts]: Start accepts. Automaton has 22663 states and 70163 transitions. Word has length 64 [2019-12-27 06:51:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:14,790 INFO L462 AbstractCegarLoop]: Abstraction has 22663 states and 70163 transitions. [2019-12-27 06:51:14,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:51:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 22663 states and 70163 transitions. [2019-12-27 06:51:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:51:14,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:14,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:14,819 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:14,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:14,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2036276616, now seen corresponding path program 1 times [2019-12-27 06:51:14,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:14,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540949120] [2019-12-27 06:51:14,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:14,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540949120] [2019-12-27 06:51:14,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:14,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:51:14,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535308322] [2019-12-27 06:51:14,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:51:14,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:14,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:51:14,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:51:14,899 INFO L87 Difference]: Start difference. First operand 22663 states and 70163 transitions. Second operand 4 states. [2019-12-27 06:51:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:15,080 INFO L93 Difference]: Finished difference Result 42597 states and 132112 transitions. [2019-12-27 06:51:15,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:51:15,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 06:51:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:15,130 INFO L225 Difference]: With dead ends: 42597 [2019-12-27 06:51:15,131 INFO L226 Difference]: Without dead ends: 21217 [2019-12-27 06:51:15,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:51:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21217 states. [2019-12-27 06:51:15,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21217 to 21217. [2019-12-27 06:51:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21217 states. [2019-12-27 06:51:15,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21217 states to 21217 states and 65595 transitions. [2019-12-27 06:51:15,562 INFO L78 Accepts]: Start accepts. Automaton has 21217 states and 65595 transitions. Word has length 64 [2019-12-27 06:51:15,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:15,563 INFO L462 AbstractCegarLoop]: Abstraction has 21217 states and 65595 transitions. [2019-12-27 06:51:15,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:51:15,563 INFO L276 IsEmpty]: Start isEmpty. Operand 21217 states and 65595 transitions. [2019-12-27 06:51:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:51:15,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:15,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:15,597 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash -776574144, now seen corresponding path program 2 times [2019-12-27 06:51:15,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:15,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591519786] [2019-12-27 06:51:15,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:15,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591519786] [2019-12-27 06:51:15,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:15,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:51:15,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812216611] [2019-12-27 06:51:15,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:51:15,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:15,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:51:15,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:51:15,722 INFO L87 Difference]: Start difference. First operand 21217 states and 65595 transitions. Second operand 7 states. [2019-12-27 06:51:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:16,530 INFO L93 Difference]: Finished difference Result 62594 states and 191097 transitions. [2019-12-27 06:51:16,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:51:16,531 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:51:16,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:16,592 INFO L225 Difference]: With dead ends: 62594 [2019-12-27 06:51:16,593 INFO L226 Difference]: Without dead ends: 42982 [2019-12-27 06:51:16,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:51:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42982 states. [2019-12-27 06:51:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42982 to 24204. [2019-12-27 06:51:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24204 states. [2019-12-27 06:51:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24204 states to 24204 states and 74744 transitions. [2019-12-27 06:51:17,130 INFO L78 Accepts]: Start accepts. Automaton has 24204 states and 74744 transitions. Word has length 64 [2019-12-27 06:51:17,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:17,132 INFO L462 AbstractCegarLoop]: Abstraction has 24204 states and 74744 transitions. [2019-12-27 06:51:17,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:51:17,132 INFO L276 IsEmpty]: Start isEmpty. Operand 24204 states and 74744 transitions. [2019-12-27 06:51:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:51:17,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:17,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:17,163 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:17,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:17,163 INFO L82 PathProgramCache]: Analyzing trace with hash 4176110, now seen corresponding path program 3 times [2019-12-27 06:51:17,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:17,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522003537] [2019-12-27 06:51:17,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:17,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522003537] [2019-12-27 06:51:17,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:17,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:51:17,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030268453] [2019-12-27 06:51:17,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:51:17,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:17,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:51:17,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:51:17,267 INFO L87 Difference]: Start difference. First operand 24204 states and 74744 transitions. Second operand 7 states. [2019-12-27 06:51:17,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:17,828 INFO L93 Difference]: Finished difference Result 70069 states and 215496 transitions. [2019-12-27 06:51:17,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 06:51:17,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:51:17,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:17,914 INFO L225 Difference]: With dead ends: 70069 [2019-12-27 06:51:17,915 INFO L226 Difference]: Without dead ends: 52756 [2019-12-27 06:51:17,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:51:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52756 states. [2019-12-27 06:51:18,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52756 to 28331. [2019-12-27 06:51:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28331 states. [2019-12-27 06:51:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28331 states to 28331 states and 88059 transitions. [2019-12-27 06:51:18,867 INFO L78 Accepts]: Start accepts. Automaton has 28331 states and 88059 transitions. Word has length 64 [2019-12-27 06:51:18,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:18,867 INFO L462 AbstractCegarLoop]: Abstraction has 28331 states and 88059 transitions. [2019-12-27 06:51:18,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:51:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 28331 states and 88059 transitions. [2019-12-27 06:51:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:51:18,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:18,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:18,898 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:18,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:18,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1890015084, now seen corresponding path program 4 times [2019-12-27 06:51:18,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:18,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796340790] [2019-12-27 06:51:18,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:18,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796340790] [2019-12-27 06:51:18,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:18,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:51:18,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905264479] [2019-12-27 06:51:18,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:51:18,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:18,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:51:18,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:51:18,993 INFO L87 Difference]: Start difference. First operand 28331 states and 88059 transitions. Second operand 7 states. [2019-12-27 06:51:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:19,590 INFO L93 Difference]: Finished difference Result 60139 states and 184623 transitions. [2019-12-27 06:51:19,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:51:19,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:51:19,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:19,712 INFO L225 Difference]: With dead ends: 60139 [2019-12-27 06:51:19,712 INFO L226 Difference]: Without dead ends: 52780 [2019-12-27 06:51:19,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:51:19,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52780 states. [2019-12-27 06:51:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52780 to 28639. [2019-12-27 06:51:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28639 states. [2019-12-27 06:51:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28639 states to 28639 states and 89010 transitions. [2019-12-27 06:51:20,344 INFO L78 Accepts]: Start accepts. Automaton has 28639 states and 89010 transitions. Word has length 64 [2019-12-27 06:51:20,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:20,344 INFO L462 AbstractCegarLoop]: Abstraction has 28639 states and 89010 transitions. [2019-12-27 06:51:20,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:51:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 28639 states and 89010 transitions. [2019-12-27 06:51:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:51:20,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:20,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:20,375 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:20,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:20,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1583546656, now seen corresponding path program 5 times [2019-12-27 06:51:20,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:20,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979601810] [2019-12-27 06:51:20,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:20,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979601810] [2019-12-27 06:51:20,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:20,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:51:20,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74047395] [2019-12-27 06:51:20,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:51:20,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:20,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:51:20,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:20,434 INFO L87 Difference]: Start difference. First operand 28639 states and 89010 transitions. Second operand 3 states. [2019-12-27 06:51:20,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:20,622 INFO L93 Difference]: Finished difference Result 34404 states and 106219 transitions. [2019-12-27 06:51:20,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:51:20,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:51:20,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:20,692 INFO L225 Difference]: With dead ends: 34404 [2019-12-27 06:51:20,692 INFO L226 Difference]: Without dead ends: 34404 [2019-12-27 06:51:20,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:20,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34404 states. [2019-12-27 06:51:21,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34404 to 30218. [2019-12-27 06:51:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30218 states. [2019-12-27 06:51:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30218 states to 30218 states and 93973 transitions. [2019-12-27 06:51:21,799 INFO L78 Accepts]: Start accepts. Automaton has 30218 states and 93973 transitions. Word has length 64 [2019-12-27 06:51:21,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:21,800 INFO L462 AbstractCegarLoop]: Abstraction has 30218 states and 93973 transitions. [2019-12-27 06:51:21,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:51:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 30218 states and 93973 transitions. [2019-12-27 06:51:21,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:51:21,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:21,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:21,834 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:21,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:21,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1838532524, now seen corresponding path program 1 times [2019-12-27 06:51:21,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:21,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849514845] [2019-12-27 06:51:21,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:21,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849514845] [2019-12-27 06:51:21,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:21,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:51:21,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008956583] [2019-12-27 06:51:21,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:51:21,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:21,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:51:21,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:51:21,887 INFO L87 Difference]: Start difference. First operand 30218 states and 93973 transitions. Second operand 4 states. [2019-12-27 06:51:22,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:22,131 INFO L93 Difference]: Finished difference Result 38058 states and 117223 transitions. [2019-12-27 06:51:22,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:51:22,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 06:51:22,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:22,187 INFO L225 Difference]: With dead ends: 38058 [2019-12-27 06:51:22,187 INFO L226 Difference]: Without dead ends: 38058 [2019-12-27 06:51:22,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:51:22,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38058 states. [2019-12-27 06:51:22,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38058 to 30836. [2019-12-27 06:51:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30836 states. [2019-12-27 06:51:22,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30836 states to 30836 states and 95961 transitions. [2019-12-27 06:51:22,748 INFO L78 Accepts]: Start accepts. Automaton has 30836 states and 95961 transitions. Word has length 65 [2019-12-27 06:51:22,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:22,748 INFO L462 AbstractCegarLoop]: Abstraction has 30836 states and 95961 transitions. [2019-12-27 06:51:22,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:51:22,748 INFO L276 IsEmpty]: Start isEmpty. Operand 30836 states and 95961 transitions. [2019-12-27 06:51:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:51:22,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:22,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:22,782 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:22,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1450523796, now seen corresponding path program 2 times [2019-12-27 06:51:22,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:22,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492646629] [2019-12-27 06:51:22,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:22,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492646629] [2019-12-27 06:51:22,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:22,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:51:22,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959789840] [2019-12-27 06:51:22,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:51:22,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:22,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:51:22,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:51:22,829 INFO L87 Difference]: Start difference. First operand 30836 states and 95961 transitions. Second operand 4 states. [2019-12-27 06:51:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:23,194 INFO L93 Difference]: Finished difference Result 48141 states and 150231 transitions. [2019-12-27 06:51:23,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:51:23,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 06:51:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:23,267 INFO L225 Difference]: With dead ends: 48141 [2019-12-27 06:51:23,267 INFO L226 Difference]: Without dead ends: 48141 [2019-12-27 06:51:23,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:51:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48141 states. [2019-12-27 06:51:24,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48141 to 32995. [2019-12-27 06:51:24,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32995 states. [2019-12-27 06:51:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32995 states to 32995 states and 103746 transitions. [2019-12-27 06:51:24,286 INFO L78 Accepts]: Start accepts. Automaton has 32995 states and 103746 transitions. Word has length 65 [2019-12-27 06:51:24,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:24,287 INFO L462 AbstractCegarLoop]: Abstraction has 32995 states and 103746 transitions. [2019-12-27 06:51:24,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:51:24,287 INFO L276 IsEmpty]: Start isEmpty. Operand 32995 states and 103746 transitions. [2019-12-27 06:51:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:51:24,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:24,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:24,330 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:24,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:24,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1631986328, now seen corresponding path program 3 times [2019-12-27 06:51:24,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:24,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490103079] [2019-12-27 06:51:24,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:24,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490103079] [2019-12-27 06:51:24,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:24,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:51:24,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272712932] [2019-12-27 06:51:24,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:51:24,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:24,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:51:24,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:51:24,415 INFO L87 Difference]: Start difference. First operand 32995 states and 103746 transitions. Second operand 7 states. [2019-12-27 06:51:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:24,986 INFO L93 Difference]: Finished difference Result 72421 states and 224911 transitions. [2019-12-27 06:51:24,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:51:24,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:51:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:25,091 INFO L225 Difference]: With dead ends: 72421 [2019-12-27 06:51:25,091 INFO L226 Difference]: Without dead ends: 66202 [2019-12-27 06:51:25,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:51:25,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66202 states. [2019-12-27 06:51:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66202 to 33027. [2019-12-27 06:51:25,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33027 states. [2019-12-27 06:51:25,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33027 states to 33027 states and 103864 transitions. [2019-12-27 06:51:25,864 INFO L78 Accepts]: Start accepts. Automaton has 33027 states and 103864 transitions. Word has length 65 [2019-12-27 06:51:25,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:25,864 INFO L462 AbstractCegarLoop]: Abstraction has 33027 states and 103864 transitions. [2019-12-27 06:51:25,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:51:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 33027 states and 103864 transitions. [2019-12-27 06:51:25,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:51:25,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:25,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] [2019-12-27 06:51:25,910 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:25,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:25,910 INFO L82 PathProgramCache]: Analyzing trace with hash -855143256, now seen corresponding path program 4 times [2019-12-27 06:51:25,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:25,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566034045] [2019-12-27 06:51:25,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:26,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566034045] [2019-12-27 06:51:26,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:26,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:51:26,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043302520] [2019-12-27 06:51:26,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:51:26,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:26,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:51:26,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:51:26,400 INFO L87 Difference]: Start difference. First operand 33027 states and 103864 transitions. Second operand 6 states. [2019-12-27 06:51:27,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:27,073 INFO L93 Difference]: Finished difference Result 53845 states and 170272 transitions. [2019-12-27 06:51:27,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:51:27,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 06:51:27,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:27,161 INFO L225 Difference]: With dead ends: 53845 [2019-12-27 06:51:27,161 INFO L226 Difference]: Without dead ends: 53845 [2019-12-27 06:51:27,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:51:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53845 states. [2019-12-27 06:51:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53845 to 34199. [2019-12-27 06:51:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34199 states. [2019-12-27 06:51:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34199 states to 34199 states and 107426 transitions. [2019-12-27 06:51:27,877 INFO L78 Accepts]: Start accepts. Automaton has 34199 states and 107426 transitions. Word has length 65 [2019-12-27 06:51:27,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:27,878 INFO L462 AbstractCegarLoop]: Abstraction has 34199 states and 107426 transitions. [2019-12-27 06:51:27,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:51:27,878 INFO L276 IsEmpty]: Start isEmpty. Operand 34199 states and 107426 transitions. [2019-12-27 06:51:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:51:27,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:27,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:27,919 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:27,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:27,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1607407314, now seen corresponding path program 1 times [2019-12-27 06:51:27,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:27,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194397381] [2019-12-27 06:51:27,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:28,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194397381] [2019-12-27 06:51:28,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:28,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:51:28,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794330378] [2019-12-27 06:51:28,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:51:28,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:28,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:51:28,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:51:28,030 INFO L87 Difference]: Start difference. First operand 34199 states and 107426 transitions. Second operand 5 states. [2019-12-27 06:51:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:28,915 INFO L93 Difference]: Finished difference Result 49777 states and 152916 transitions. [2019-12-27 06:51:28,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:51:28,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 06:51:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:29,045 INFO L225 Difference]: With dead ends: 49777 [2019-12-27 06:51:29,045 INFO L226 Difference]: Without dead ends: 49557 [2019-12-27 06:51:29,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:51:29,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49557 states. [2019-12-27 06:51:30,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49557 to 39728. [2019-12-27 06:51:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39728 states. [2019-12-27 06:51:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39728 states to 39728 states and 124203 transitions. [2019-12-27 06:51:30,266 INFO L78 Accepts]: Start accepts. Automaton has 39728 states and 124203 transitions. Word has length 65 [2019-12-27 06:51:30,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:30,266 INFO L462 AbstractCegarLoop]: Abstraction has 39728 states and 124203 transitions. [2019-12-27 06:51:30,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:51:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 39728 states and 124203 transitions. [2019-12-27 06:51:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:51:30,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:30,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:30,312 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:30,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:30,313 INFO L82 PathProgramCache]: Analyzing trace with hash 99240326, now seen corresponding path program 2 times [2019-12-27 06:51:30,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:30,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848578235] [2019-12-27 06:51:30,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:30,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848578235] [2019-12-27 06:51:30,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:30,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:51:30,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187823575] [2019-12-27 06:51:30,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:51:30,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:30,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:51:30,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:51:30,476 INFO L87 Difference]: Start difference. First operand 39728 states and 124203 transitions. Second operand 8 states. [2019-12-27 06:51:31,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:31,859 INFO L93 Difference]: Finished difference Result 59625 states and 183241 transitions. [2019-12-27 06:51:31,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 06:51:31,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 06:51:31,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:31,949 INFO L225 Difference]: With dead ends: 59625 [2019-12-27 06:51:31,949 INFO L226 Difference]: Without dead ends: 59513 [2019-12-27 06:51:31,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-27 06:51:32,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59513 states. [2019-12-27 06:51:32,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59513 to 40852. [2019-12-27 06:51:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40852 states. [2019-12-27 06:51:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40852 states to 40852 states and 127127 transitions. [2019-12-27 06:51:32,717 INFO L78 Accepts]: Start accepts. Automaton has 40852 states and 127127 transitions. Word has length 65 [2019-12-27 06:51:32,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:32,717 INFO L462 AbstractCegarLoop]: Abstraction has 40852 states and 127127 transitions. [2019-12-27 06:51:32,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:51:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 40852 states and 127127 transitions. [2019-12-27 06:51:32,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:51:32,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:32,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:32,762 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:32,762 INFO L82 PathProgramCache]: Analyzing trace with hash -154311598, now seen corresponding path program 3 times [2019-12-27 06:51:32,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:32,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315645828] [2019-12-27 06:51:32,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:32,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:32,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315645828] [2019-12-27 06:51:32,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:32,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:51:32,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465849281] [2019-12-27 06:51:32,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:51:32,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:32,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:51:32,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:51:32,962 INFO L87 Difference]: Start difference. First operand 40852 states and 127127 transitions. Second operand 10 states. [2019-12-27 06:51:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:36,127 INFO L93 Difference]: Finished difference Result 62437 states and 190755 transitions. [2019-12-27 06:51:36,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 06:51:36,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 06:51:36,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:36,224 INFO L225 Difference]: With dead ends: 62437 [2019-12-27 06:51:36,225 INFO L226 Difference]: Without dead ends: 62141 [2019-12-27 06:51:36,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2019-12-27 06:51:36,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62141 states. [2019-12-27 06:51:36,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62141 to 44129. [2019-12-27 06:51:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44129 states. [2019-12-27 06:51:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44129 states to 44129 states and 136879 transitions. [2019-12-27 06:51:37,077 INFO L78 Accepts]: Start accepts. Automaton has 44129 states and 136879 transitions. Word has length 65 [2019-12-27 06:51:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:37,077 INFO L462 AbstractCegarLoop]: Abstraction has 44129 states and 136879 transitions. [2019-12-27 06:51:37,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:51:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 44129 states and 136879 transitions. [2019-12-27 06:51:37,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:51:37,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:37,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:37,128 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:37,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:37,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1583496514, now seen corresponding path program 4 times [2019-12-27 06:51:37,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:37,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619153857] [2019-12-27 06:51:37,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:37,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619153857] [2019-12-27 06:51:37,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:37,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:51:37,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40549955] [2019-12-27 06:51:37,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:51:37,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:37,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:51:37,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:37,191 INFO L87 Difference]: Start difference. First operand 44129 states and 136879 transitions. Second operand 3 states. [2019-12-27 06:51:37,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:37,353 INFO L93 Difference]: Finished difference Result 44129 states and 136878 transitions. [2019-12-27 06:51:37,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:51:37,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:51:37,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:37,420 INFO L225 Difference]: With dead ends: 44129 [2019-12-27 06:51:37,421 INFO L226 Difference]: Without dead ends: 44129 [2019-12-27 06:51:37,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44129 states. [2019-12-27 06:51:38,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44129 to 37314. [2019-12-27 06:51:38,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37314 states. [2019-12-27 06:51:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37314 states to 37314 states and 117566 transitions. [2019-12-27 06:51:38,483 INFO L78 Accepts]: Start accepts. Automaton has 37314 states and 117566 transitions. Word has length 65 [2019-12-27 06:51:38,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:38,484 INFO L462 AbstractCegarLoop]: Abstraction has 37314 states and 117566 transitions. [2019-12-27 06:51:38,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:51:38,484 INFO L276 IsEmpty]: Start isEmpty. Operand 37314 states and 117566 transitions. [2019-12-27 06:51:38,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:51:38,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:38,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:38,528 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:38,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:38,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1323575748, now seen corresponding path program 1 times [2019-12-27 06:51:38,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:38,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342943249] [2019-12-27 06:51:38,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:38,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342943249] [2019-12-27 06:51:38,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:38,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:51:38,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460948472] [2019-12-27 06:51:38,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:51:38,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:38,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:51:38,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:51:38,716 INFO L87 Difference]: Start difference. First operand 37314 states and 117566 transitions. Second operand 11 states. [2019-12-27 06:51:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:40,903 INFO L93 Difference]: Finished difference Result 59226 states and 182880 transitions. [2019-12-27 06:51:40,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:51:40,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 06:51:40,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:40,997 INFO L225 Difference]: With dead ends: 59226 [2019-12-27 06:51:40,998 INFO L226 Difference]: Without dead ends: 59226 [2019-12-27 06:51:40,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:51:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59226 states. [2019-12-27 06:51:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59226 to 39255. [2019-12-27 06:51:42,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39255 states. [2019-12-27 06:51:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39255 states to 39255 states and 124025 transitions. [2019-12-27 06:51:42,411 INFO L78 Accepts]: Start accepts. Automaton has 39255 states and 124025 transitions. Word has length 66 [2019-12-27 06:51:42,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:42,411 INFO L462 AbstractCegarLoop]: Abstraction has 39255 states and 124025 transitions. [2019-12-27 06:51:42,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:51:42,412 INFO L276 IsEmpty]: Start isEmpty. Operand 39255 states and 124025 transitions. [2019-12-27 06:51:42,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:51:42,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:42,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:42,461 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:42,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:42,461 INFO L82 PathProgramCache]: Analyzing trace with hash -871413024, now seen corresponding path program 2 times [2019-12-27 06:51:42,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:42,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500192215] [2019-12-27 06:51:42,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:42,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500192215] [2019-12-27 06:51:42,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:42,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:51:42,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493673134] [2019-12-27 06:51:42,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:51:42,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:42,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:51:42,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:42,515 INFO L87 Difference]: Start difference. First operand 39255 states and 124025 transitions. Second operand 3 states. [2019-12-27 06:51:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:42,674 INFO L93 Difference]: Finished difference Result 29796 states and 92689 transitions. [2019-12-27 06:51:42,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:51:42,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:51:42,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:42,750 INFO L225 Difference]: With dead ends: 29796 [2019-12-27 06:51:42,750 INFO L226 Difference]: Without dead ends: 29796 [2019-12-27 06:51:42,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:42,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29796 states. [2019-12-27 06:51:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29796 to 28150. [2019-12-27 06:51:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28150 states. [2019-12-27 06:51:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28150 states to 28150 states and 87484 transitions. [2019-12-27 06:51:43,350 INFO L78 Accepts]: Start accepts. Automaton has 28150 states and 87484 transitions. Word has length 66 [2019-12-27 06:51:43,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:43,350 INFO L462 AbstractCegarLoop]: Abstraction has 28150 states and 87484 transitions. [2019-12-27 06:51:43,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:51:43,351 INFO L276 IsEmpty]: Start isEmpty. Operand 28150 states and 87484 transitions. [2019-12-27 06:51:43,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:51:43,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:43,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:43,383 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-27 06:51:43,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:43,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1134321916, now seen corresponding path program 1 times [2019-12-27 06:51:43,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:43,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671561006] [2019-12-27 06:51:43,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:43,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671561006] [2019-12-27 06:51:43,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:43,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:51:43,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754606610] [2019-12-27 06:51:43,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:51:43,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:43,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:51:43,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:51:43,574 INFO L87 Difference]: Start difference. First operand 28150 states and 87484 transitions. Second operand 11 states. [2019-12-27 06:51:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:44,908 INFO L93 Difference]: Finished difference Result 60354 states and 187572 transitions. [2019-12-27 06:51:44,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 06:51:44,908 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:51:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:44,974 INFO L225 Difference]: With dead ends: 60354 [2019-12-27 06:51:44,974 INFO L226 Difference]: Without dead ends: 44820 [2019-12-27 06:51:44,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 06:51:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44820 states. [2019-12-27 06:51:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44820 to 27884. [2019-12-27 06:51:45,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27884 states. [2019-12-27 06:51:45,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27884 states to 27884 states and 85706 transitions. [2019-12-27 06:51:45,524 INFO L78 Accepts]: Start accepts. Automaton has 27884 states and 85706 transitions. Word has length 67 [2019-12-27 06:51:45,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:45,525 INFO L462 AbstractCegarLoop]: Abstraction has 27884 states and 85706 transitions. [2019-12-27 06:51:45,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:51:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand 27884 states and 85706 transitions. [2019-12-27 06:51:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:51:45,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:45,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:45,554 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-27 06:51:45,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:45,554 INFO L82 PathProgramCache]: Analyzing trace with hash 744299942, now seen corresponding path program 2 times [2019-12-27 06:51:45,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:45,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766572613] [2019-12-27 06:51:45,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:45,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766572613] [2019-12-27 06:51:45,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:45,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:51:45,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503438218] [2019-12-27 06:51:45,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:51:45,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:45,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:51:45,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:51:45,739 INFO L87 Difference]: Start difference. First operand 27884 states and 85706 transitions. Second operand 12 states. [2019-12-27 06:51:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:47,019 INFO L93 Difference]: Finished difference Result 45413 states and 139514 transitions. [2019-12-27 06:51:47,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:51:47,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 06:51:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:47,086 INFO L225 Difference]: With dead ends: 45413 [2019-12-27 06:51:47,086 INFO L226 Difference]: Without dead ends: 44390 [2019-12-27 06:51:47,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:51:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44390 states. [2019-12-27 06:51:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44390 to 27222. [2019-12-27 06:51:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27222 states. [2019-12-27 06:51:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27222 states to 27222 states and 83885 transitions. [2019-12-27 06:51:47,638 INFO L78 Accepts]: Start accepts. Automaton has 27222 states and 83885 transitions. Word has length 67 [2019-12-27 06:51:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:47,639 INFO L462 AbstractCegarLoop]: Abstraction has 27222 states and 83885 transitions. [2019-12-27 06:51:47,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:51:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 27222 states and 83885 transitions. [2019-12-27 06:51:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:51:47,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:47,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:47,671 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-27 06:51:47,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:47,672 INFO L82 PathProgramCache]: Analyzing trace with hash 397550642, now seen corresponding path program 1 times [2019-12-27 06:51:47,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:47,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047829252] [2019-12-27 06:51:47,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:47,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047829252] [2019-12-27 06:51:47,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:47,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:51:47,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169799370] [2019-12-27 06:51:47,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:51:47,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:47,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:51:47,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:51:47,825 INFO L87 Difference]: Start difference. First operand 27222 states and 83885 transitions. Second operand 10 states. [2019-12-27 06:51:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:50,041 INFO L93 Difference]: Finished difference Result 57506 states and 179533 transitions. [2019-12-27 06:51:50,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 06:51:50,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 06:51:50,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:50,132 INFO L225 Difference]: With dead ends: 57506 [2019-12-27 06:51:50,132 INFO L226 Difference]: Without dead ends: 57506 [2019-12-27 06:51:50,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2019-12-27 06:51:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57506 states. [2019-12-27 06:51:50,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57506 to 30386. [2019-12-27 06:51:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30386 states. [2019-12-27 06:51:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30386 states to 30386 states and 94429 transitions. [2019-12-27 06:51:50,865 INFO L78 Accepts]: Start accepts. Automaton has 30386 states and 94429 transitions. Word has length 67 [2019-12-27 06:51:50,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:50,866 INFO L462 AbstractCegarLoop]: Abstraction has 30386 states and 94429 transitions. [2019-12-27 06:51:50,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:51:50,866 INFO L276 IsEmpty]: Start isEmpty. Operand 30386 states and 94429 transitions. [2019-12-27 06:51:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:51:51,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:51,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:51,249 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-27 06:51:51,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:51,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1450844730, now seen corresponding path program 3 times [2019-12-27 06:51:51,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:51,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142384881] [2019-12-27 06:51:51,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:51:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:51:51,413 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:51:51,414 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:51:51,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_77 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$w_buff1_used~0_77) (= 0 v_~z$w_buff1~0_28) (= 0 v_~__unbuffered_cnt~0_21) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1391~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1391~0.base_23|) |v_ULTIMATE.start_main_~#t1391~0.offset_17| 0)) |v_#memory_int_21|) (= v_~z$r_buff0_thd2~0_19 0) (= 0 v_~weak$$choice2~0_32) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_16) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1391~0.base_23|) (= 0 |v_#NULL.base_6|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_18 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1391~0.base_23|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1391~0.base_23| 4)) (= v_~z~0_27 0) (= v_~z$r_buff0_thd1~0_22 0) (= 0 v_~z$flush_delayed~0_12) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1391~0.base_23| 1)) (= 0 v_~z$w_buff0~0_26) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~__unbuffered_p1_EAX~0_16) (= 0 v_~z$r_buff1_thd1~0_16) (= 0 |v_ULTIMATE.start_main_~#t1391~0.offset_17|) (= v_~z$w_buff0_used~0_116 0) (= v_~x~0_16 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t1392~0.offset=|v_ULTIMATE.start_main_~#t1392~0.offset_17|, ULTIMATE.start_main_~#t1393~0.base=|v_ULTIMATE.start_main_~#t1393~0.base_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_77, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_16, ULTIMATE.start_main_~#t1393~0.offset=|v_ULTIMATE.start_main_~#t1393~0.offset_13|, ULTIMATE.start_main_~#t1392~0.base=|v_ULTIMATE.start_main_~#t1392~0.base_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t1391~0.base=|v_ULTIMATE.start_main_~#t1391~0.base_23|, ULTIMATE.start_main_~#t1391~0.offset=|v_ULTIMATE.start_main_~#t1391~0.offset_17|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1393~0.offset, ULTIMATE.start_main_~#t1392~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1392~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1393~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1391~0.base, ULTIMATE.start_main_~#t1391~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 06:51:51,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1392~0.base_9| 4) |v_#length_13|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1392~0.base_9| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1392~0.base_9|)) (not (= |v_ULTIMATE.start_main_~#t1392~0.base_9| 0)) (= |v_ULTIMATE.start_main_~#t1392~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1392~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1392~0.base_9|) |v_ULTIMATE.start_main_~#t1392~0.offset_8| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1392~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1392~0.base=|v_ULTIMATE.start_main_~#t1392~0.base_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1392~0.offset=|v_ULTIMATE.start_main_~#t1392~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1392~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1392~0.offset] because there is no mapped edge [2019-12-27 06:51:51,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff1_used~0_Out-1829565086 ~z$w_buff0_used~0_In-1829565086) (= 1 ~z$w_buff0~0_Out-1829565086) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1829565086|) (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1829565086 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1829565086|) (= |P0Thread1of1ForFork0_#in~arg.base_In-1829565086| P0Thread1of1ForFork0_~arg.base_Out-1829565086) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1829565086| P0Thread1of1ForFork0_~arg.offset_Out-1829565086) (= (mod ~z$w_buff1_used~0_Out-1829565086 256) 0) (= ~z$w_buff0~0_In-1829565086 ~z$w_buff1~0_Out-1829565086) (= 1 ~z$w_buff0_used~0_Out-1829565086)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1829565086|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1829565086, ~z$w_buff0~0=~z$w_buff0~0_In-1829565086, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1829565086|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1829565086|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1829565086, ~z$w_buff0~0=~z$w_buff0~0_Out-1829565086, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1829565086, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1829565086, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1829565086|, ~z$w_buff1~0=~z$w_buff1~0_Out-1829565086, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1829565086, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1829565086|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1829565086} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:51:51,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L822-1-->L824: Formula: (and (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1393~0.base_11|) 0) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1393~0.base_11| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1393~0.base_11| 4)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1393~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1393~0.base_11|) |v_ULTIMATE.start_main_~#t1393~0.offset_9| 2))) (not (= |v_ULTIMATE.start_main_~#t1393~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1393~0.offset_9| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1393~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1393~0.offset=|v_ULTIMATE.start_main_~#t1393~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1393~0.base=|v_ULTIMATE.start_main_~#t1393~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1393~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1393~0.base] because there is no mapped edge [2019-12-27 06:51:51,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1281138986 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1281138986 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-1281138986| |P1Thread1of1ForFork1_#t~ite10_Out-1281138986|))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1281138986| ~z$w_buff1~0_In-1281138986) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |P1Thread1of1ForFork1_#t~ite9_Out-1281138986| ~z~0_In-1281138986) .cse1))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1281138986, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1281138986, ~z$w_buff1~0=~z$w_buff1~0_In-1281138986, ~z~0=~z~0_In-1281138986} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1281138986|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1281138986, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1281138986, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1281138986|, ~z$w_buff1~0=~z$w_buff1~0_In-1281138986, ~z~0=~z~0_In-1281138986} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 06:51:51,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1235913666 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1235913666 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1235913666| ~z$w_buff0_used~0_In-1235913666)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1235913666| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1235913666, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1235913666} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1235913666, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1235913666|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1235913666} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 06:51:51,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1993946788 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1993946788 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1993946788 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-1993946788 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1993946788| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1993946788| ~z$w_buff1_used~0_In-1993946788) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1993946788, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1993946788, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1993946788, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1993946788} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1993946788, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1993946788, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1993946788, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1993946788|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1993946788} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:51:51,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1988824567 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1988824567 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In1988824567 |P1Thread1of1ForFork1_#t~ite13_Out1988824567|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out1988824567| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1988824567, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1988824567} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1988824567, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1988824567|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1988824567} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 06:51:51,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L787-->L787-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-149227323 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite23_Out-149227323| |P2Thread1of1ForFork2_#t~ite24_Out-149227323|) (= ~z$w_buff1~0_In-149227323 |P2Thread1of1ForFork2_#t~ite23_Out-149227323|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-149227323 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-149227323 256) 0)) (= (mod ~z$w_buff0_used~0_In-149227323 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-149227323 256)) .cse1)))) (and (= ~z$w_buff1~0_In-149227323 |P2Thread1of1ForFork2_#t~ite24_Out-149227323|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In-149227323| |P2Thread1of1ForFork2_#t~ite23_Out-149227323|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-149227323|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-149227323, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-149227323, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-149227323, ~z$w_buff1~0=~z$w_buff1~0_In-149227323, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-149227323, ~weak$$choice2~0=~weak$$choice2~0_In-149227323} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-149227323|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-149227323|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-149227323, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-149227323, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-149227323, ~z$w_buff1~0=~z$w_buff1~0_In-149227323, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-149227323, ~weak$$choice2~0=~weak$$choice2~0_In-149227323} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 06:51:51,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L788-->L788-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-179822701 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite27_Out-179822701| ~z$w_buff0_used~0_In-179822701) (= |P2Thread1of1ForFork2_#t~ite26_In-179822701| |P2Thread1of1ForFork2_#t~ite26_Out-179822701|)) (and (= ~z$w_buff0_used~0_In-179822701 |P2Thread1of1ForFork2_#t~ite26_Out-179822701|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-179822701 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In-179822701 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In-179822701 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-179822701 256) 0))) .cse0 (= |P2Thread1of1ForFork2_#t~ite27_Out-179822701| |P2Thread1of1ForFork2_#t~ite26_Out-179822701|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-179822701|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-179822701, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-179822701, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-179822701, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-179822701, ~weak$$choice2~0=~weak$$choice2~0_In-179822701} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-179822701|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-179822701, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-179822701, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-179822701, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-179822701, ~weak$$choice2~0=~weak$$choice2~0_In-179822701, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-179822701|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 06:51:51,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In932760460 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In932760460 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In932760460 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In932760460 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out932760460| 0)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out932760460| ~z$r_buff1_thd2~0_In932760460) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In932760460, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In932760460, ~z$w_buff1_used~0=~z$w_buff1_used~0_In932760460, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In932760460} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In932760460, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In932760460, ~z$w_buff1_used~0=~z$w_buff1_used~0_In932760460, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out932760460|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In932760460} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:51:51,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:51:51,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In421516704 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out421516704| ~z$w_buff1_used~0_In421516704) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In421516704 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In421516704 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In421516704 256) 0)) (and (= 0 (mod ~z$r_buff1_thd3~0_In421516704 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite29_Out421516704| |P2Thread1of1ForFork2_#t~ite30_Out421516704|)) (and (= ~z$w_buff1_used~0_In421516704 |P2Thread1of1ForFork2_#t~ite30_Out421516704|) (= |P2Thread1of1ForFork2_#t~ite29_In421516704| |P2Thread1of1ForFork2_#t~ite29_Out421516704|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In421516704, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In421516704, ~z$w_buff1_used~0=~z$w_buff1_used~0_In421516704, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In421516704, ~weak$$choice2~0=~weak$$choice2~0_In421516704, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In421516704|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out421516704|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In421516704, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In421516704, ~z$w_buff1_used~0=~z$w_buff1_used~0_In421516704, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In421516704, ~weak$$choice2~0=~weak$$choice2~0_In421516704, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out421516704|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 06:51:51,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff0_thd3~0_51)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 06:51:51,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 06:51:51,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1748398351 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1748398351 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1748398351|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1748398351 |P0Thread1of1ForFork0_#t~ite5_Out-1748398351|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1748398351, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1748398351} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1748398351|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1748398351, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1748398351} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:51:51,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In284496968 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In284496968 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In284496968 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In284496968 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out284496968|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In284496968 |P0Thread1of1ForFork0_#t~ite6_Out284496968|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In284496968, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In284496968, ~z$w_buff1_used~0=~z$w_buff1_used~0_In284496968, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In284496968} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out284496968|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In284496968, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In284496968, ~z$w_buff1_used~0=~z$w_buff1_used~0_In284496968, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In284496968} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:51:51,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In154735336 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In154735336 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In154735336 ~z$r_buff0_thd1~0_Out154735336) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out154735336)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In154735336, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In154735336} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In154735336, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out154735336|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out154735336} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:51:51,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In-1720928650 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1720928650 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-1720928650 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1720928650 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1720928650|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In-1720928650 |P0Thread1of1ForFork0_#t~ite8_Out-1720928650|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1720928650, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1720928650, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1720928650, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1720928650} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1720928650, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1720928650|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1720928650, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1720928650, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1720928650} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:51:51,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:51:51,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In756725517 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In756725517 256) 0)) (.cse1 (= |P2Thread1of1ForFork2_#t~ite39_Out756725517| |P2Thread1of1ForFork2_#t~ite38_Out756725517|))) (or (and (not .cse0) (= ~z$w_buff1~0_In756725517 |P2Thread1of1ForFork2_#t~ite38_Out756725517|) .cse1 (not .cse2)) (and (= ~z~0_In756725517 |P2Thread1of1ForFork2_#t~ite38_Out756725517|) (or .cse0 .cse2) .cse1))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In756725517, ~z$w_buff1_used~0=~z$w_buff1_used~0_In756725517, ~z$w_buff1~0=~z$w_buff1~0_In756725517, ~z~0=~z~0_In756725517} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In756725517, ~z$w_buff1_used~0=~z$w_buff1_used~0_In756725517, ~z$w_buff1~0=~z$w_buff1~0_In756725517, ~z~0=~z~0_In756725517, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out756725517|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out756725517|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 06:51:51,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In226126178 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In226126178 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out226126178|) (not .cse1)) (and (= ~z$w_buff0_used~0_In226126178 |P2Thread1of1ForFork2_#t~ite40_Out226126178|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In226126178, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In226126178} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In226126178, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In226126178, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out226126178|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 06:51:51,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-411175274 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-411175274 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-411175274 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-411175274 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out-411175274| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite41_Out-411175274| ~z$w_buff1_used~0_In-411175274)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-411175274, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-411175274, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-411175274, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-411175274} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-411175274|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-411175274, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-411175274, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-411175274, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-411175274} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 06:51:51,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In68971244 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In68971244 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out68971244|)) (and (= ~z$r_buff0_thd3~0_In68971244 |P2Thread1of1ForFork2_#t~ite42_Out68971244|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In68971244, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In68971244} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out68971244|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In68971244, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In68971244} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 06:51:51,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1438114100 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-1438114100 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1438114100 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1438114100 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite43_Out-1438114100| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite43_Out-1438114100| ~z$r_buff1_thd3~0_In-1438114100)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1438114100, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1438114100, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1438114100, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1438114100} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1438114100, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1438114100, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1438114100|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1438114100, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1438114100} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 06:51:51,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_42) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 06:51:51,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:51:51,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-2125746767| |ULTIMATE.start_main_#t~ite47_Out-2125746767|)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-2125746767 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-2125746767 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In-2125746767 |ULTIMATE.start_main_#t~ite47_Out-2125746767|)) (and .cse0 (= ~z~0_In-2125746767 |ULTIMATE.start_main_#t~ite47_Out-2125746767|) (or .cse2 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2125746767, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2125746767, ~z$w_buff1~0=~z$w_buff1~0_In-2125746767, ~z~0=~z~0_In-2125746767} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2125746767, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-2125746767|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2125746767, ~z$w_buff1~0=~z$w_buff1~0_In-2125746767, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-2125746767|, ~z~0=~z~0_In-2125746767} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:51:51,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1505510449 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1505510449 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-1505510449| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1505510449| ~z$w_buff0_used~0_In-1505510449)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1505510449, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1505510449} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1505510449, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1505510449, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1505510449|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:51:51,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In357525495 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In357525495 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In357525495 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In357525495 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out357525495| ~z$w_buff1_used~0_In357525495)) (and (= |ULTIMATE.start_main_#t~ite50_Out357525495| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In357525495, ~z$w_buff0_used~0=~z$w_buff0_used~0_In357525495, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In357525495, ~z$w_buff1_used~0=~z$w_buff1_used~0_In357525495} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out357525495|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In357525495, ~z$w_buff0_used~0=~z$w_buff0_used~0_In357525495, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In357525495, ~z$w_buff1_used~0=~z$w_buff1_used~0_In357525495} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:51:51,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-378981159 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-378981159 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-378981159|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-378981159 |ULTIMATE.start_main_#t~ite51_Out-378981159|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-378981159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-378981159} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-378981159, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-378981159|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-378981159} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:51:51,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-574855033 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-574855033 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-574855033 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-574855033 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-574855033 |ULTIMATE.start_main_#t~ite52_Out-574855033|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-574855033|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-574855033, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-574855033, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-574855033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-574855033} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-574855033|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-574855033, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-574855033, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-574855033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-574855033} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:51:51,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= 2 v_~x~0_8) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:51:51,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:51:51 BasicIcfg [2019-12-27 06:51:51,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:51:51,559 INFO L168 Benchmark]: Toolchain (without parser) took 105796.65 ms. Allocated memory was 145.2 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 101.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 06:51:51,560 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 06:51:51,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.95 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 154.2 MB in the end (delta: -53.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:51:51,561 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.60 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:51:51,561 INFO L168 Benchmark]: Boogie Preprocessor took 43.79 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:51:51,562 INFO L168 Benchmark]: RCFGBuilder took 864.30 ms. Allocated memory is still 202.9 MB. Free memory was 149.6 MB in the beginning and 99.2 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:51:51,562 INFO L168 Benchmark]: TraceAbstraction took 104060.87 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 06:51:51,565 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.19 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 744.95 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 154.2 MB in the end (delta: -53.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.60 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.79 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 864.30 ms. Allocated memory is still 202.9 MB. Free memory was 149.6 MB in the beginning and 99.2 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104060.87 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6848 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1391, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1392, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1393, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 y = 1 [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 103.6s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 34.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6756 SDtfs, 8780 SDslu, 22611 SDs, 0 SdLazy, 13758 SolverSat, 384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 365 GetRequests, 52 SyntacticMatches, 31 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred 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: 43.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 342344 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1532 NumberOfCodeBlocks, 1532 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1436 ConstructedInterpolants, 0 QuantifiedInterpolants, 298862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...