/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:55:42,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:55:42,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:55:42,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:55:42,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:55:42,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:55:42,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:55:42,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:55:42,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:55:42,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:55:42,430 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:55:42,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:55:42,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:55:42,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:55:42,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:55:42,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:55:42,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:55:42,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:55:42,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:55:42,446 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:55:42,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:55:42,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:55:42,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:55:42,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:55:42,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:55:42,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:55:42,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:55:42,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:55:42,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:55:42,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:55:42,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:55:42,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:55:42,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:55:42,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:55:42,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:55:42,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:55:42,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:55:42,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:55:42,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:55:42,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:55:42,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:55:42,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:55:42,480 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:55:42,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:55:42,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:55:42,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:55:42,482 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:55:42,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:55:42,483 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:55:42,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:55:42,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:55:42,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:55:42,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:55:42,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:55:42,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:55:42,484 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:55:42,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:55:42,484 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:55:42,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:55:42,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:55:42,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:55:42,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:55:42,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:55:42,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:55:42,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:55:42,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:55:42,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:55:42,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:55:42,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:55:42,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:55:42,487 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:55:42,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:55:42,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:55:42,800 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:55:42,801 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:55:42,802 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:55:42,802 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i [2019-12-27 01:55:42,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71f0c94e/e273982c0da14690baa19d85fbea81c3/FLAG7dca8608e [2019-12-27 01:55:43,502 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:55:43,503 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i [2019-12-27 01:55:43,528 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71f0c94e/e273982c0da14690baa19d85fbea81c3/FLAG7dca8608e [2019-12-27 01:55:43,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71f0c94e/e273982c0da14690baa19d85fbea81c3 [2019-12-27 01:55:43,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:55:43,807 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:55:43,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:55:43,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:55:43,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:55:43,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:55:43" (1/1) ... [2019-12-27 01:55:43,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@966da54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:43, skipping insertion in model container [2019-12-27 01:55:43,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:55:43" (1/1) ... [2019-12-27 01:55:43,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:55:43,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:55:44,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:55:44,461 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:55:44,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:55:44,607 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:55:44,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:44 WrapperNode [2019-12-27 01:55:44,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:55:44,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:55:44,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:55:44,609 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:55:44,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:44" (1/1) ... [2019-12-27 01:55:44,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:44" (1/1) ... [2019-12-27 01:55:44,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:55:44,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:55:44,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:55:44,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:55:44,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:44" (1/1) ... [2019-12-27 01:55:44,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:44" (1/1) ... [2019-12-27 01:55:44,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:44" (1/1) ... [2019-12-27 01:55:44,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:44" (1/1) ... [2019-12-27 01:55:44,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:44" (1/1) ... [2019-12-27 01:55:44,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:44" (1/1) ... [2019-12-27 01:55:44,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:44" (1/1) ... [2019-12-27 01:55:44,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:55:44,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:55:44,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:55:44,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:55:44,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:55:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:55:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:55:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:55:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:55:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:55:44,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:55:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:55:44,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:55:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:55:44,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:55:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:55:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:55:44,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:55:44,798 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:55:45,593 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:55:45,594 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:55:45,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:55:45 BoogieIcfgContainer [2019-12-27 01:55:45,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:55:45,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:55:45,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:55:45,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:55:45,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:55:43" (1/3) ... [2019-12-27 01:55:45,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ca0764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:55:45, skipping insertion in model container [2019-12-27 01:55:45,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:44" (2/3) ... [2019-12-27 01:55:45,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ca0764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:55:45, skipping insertion in model container [2019-12-27 01:55:45,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:55:45" (3/3) ... [2019-12-27 01:55:45,604 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_tso.opt.i [2019-12-27 01:55:45,614 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:55:45,614 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:55:45,622 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:55:45,623 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:55:45,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,664 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,664 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,664 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,665 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,665 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,673 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,673 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,700 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,701 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,749 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,752 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,768 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,768 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:45,787 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:55:45,803 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:55:45,803 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:55:45,803 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:55:45,804 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:55:45,804 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:55:45,804 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:55:45,804 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:55:45,804 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:55:45,819 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 01:55:45,820 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 01:55:45,936 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 01:55:45,937 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:55:45,956 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:55:45,980 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 01:55:46,064 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 01:55:46,065 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:55:46,072 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:55:46,094 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:55:46,096 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:55:49,949 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-12-27 01:55:51,220 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-27 01:55:51,665 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 01:55:51,798 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 01:55:51,825 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78858 [2019-12-27 01:55:51,826 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 01:55:51,829 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 01:56:10,763 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-27 01:56:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-27 01:56:10,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:56:10,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:10,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:56:10,773 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:10,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:10,779 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-27 01:56:10,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:10,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417821457] [2019-12-27 01:56:10,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:11,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417821457] [2019-12-27 01:56:11,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:11,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:56:11,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539666004] [2019-12-27 01:56:11,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:56:11,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:11,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:56:11,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:11,042 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-27 01:56:12,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:12,656 INFO L93 Difference]: Finished difference Result 114110 states and 484570 transitions. [2019-12-27 01:56:12,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:56:12,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:56:12,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:13,355 INFO L225 Difference]: With dead ends: 114110 [2019-12-27 01:56:13,355 INFO L226 Difference]: Without dead ends: 107012 [2019-12-27 01:56:13,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107012 states. [2019-12-27 01:56:25,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107012 to 107012. [2019-12-27 01:56:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107012 states. [2019-12-27 01:56:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107012 states to 107012 states and 453812 transitions. [2019-12-27 01:56:25,504 INFO L78 Accepts]: Start accepts. Automaton has 107012 states and 453812 transitions. Word has length 3 [2019-12-27 01:56:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:25,504 INFO L462 AbstractCegarLoop]: Abstraction has 107012 states and 453812 transitions. [2019-12-27 01:56:25,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:56:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 107012 states and 453812 transitions. [2019-12-27 01:56:25,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:56:25,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:25,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:25,509 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:25,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:25,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1578322365, now seen corresponding path program 1 times [2019-12-27 01:56:25,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:25,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248997873] [2019-12-27 01:56:25,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:25,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248997873] [2019-12-27 01:56:25,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:25,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:56:25,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16814289] [2019-12-27 01:56:25,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:56:25,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:25,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:56:25,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:56:25,671 INFO L87 Difference]: Start difference. First operand 107012 states and 453812 transitions. Second operand 4 states. [2019-12-27 01:56:31,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:31,528 INFO L93 Difference]: Finished difference Result 166210 states and 677236 transitions. [2019-12-27 01:56:31,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:56:31,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:56:31,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:32,006 INFO L225 Difference]: With dead ends: 166210 [2019-12-27 01:56:32,006 INFO L226 Difference]: Without dead ends: 166161 [2019-12-27 01:56:32,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:56:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166161 states. [2019-12-27 01:56:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166161 to 151748. [2019-12-27 01:56:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151748 states. [2019-12-27 01:56:46,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151748 states to 151748 states and 626089 transitions. [2019-12-27 01:56:46,673 INFO L78 Accepts]: Start accepts. Automaton has 151748 states and 626089 transitions. Word has length 11 [2019-12-27 01:56:46,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:46,673 INFO L462 AbstractCegarLoop]: Abstraction has 151748 states and 626089 transitions. [2019-12-27 01:56:46,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:56:46,673 INFO L276 IsEmpty]: Start isEmpty. Operand 151748 states and 626089 transitions. [2019-12-27 01:56:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:56:46,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:46,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:46,680 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:46,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:46,681 INFO L82 PathProgramCache]: Analyzing trace with hash 608601994, now seen corresponding path program 1 times [2019-12-27 01:56:46,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:46,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203427384] [2019-12-27 01:56:46,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:46,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203427384] [2019-12-27 01:56:46,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:46,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:56:46,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119884977] [2019-12-27 01:56:46,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:56:46,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:46,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:56:46,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:46,752 INFO L87 Difference]: Start difference. First operand 151748 states and 626089 transitions. Second operand 3 states. [2019-12-27 01:56:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:46,874 INFO L93 Difference]: Finished difference Result 33068 states and 106908 transitions. [2019-12-27 01:56:46,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:56:46,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:56:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:47,025 INFO L225 Difference]: With dead ends: 33068 [2019-12-27 01:56:47,025 INFO L226 Difference]: Without dead ends: 33068 [2019-12-27 01:56:47,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:47,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33068 states. [2019-12-27 01:56:47,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33068 to 33068. [2019-12-27 01:56:47,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-27 01:56:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 106908 transitions. [2019-12-27 01:56:47,709 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 106908 transitions. Word has length 13 [2019-12-27 01:56:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:47,710 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 106908 transitions. [2019-12-27 01:56:47,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:56:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 106908 transitions. [2019-12-27 01:56:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:56:47,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:47,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:47,713 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:47,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:47,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1174763718, now seen corresponding path program 1 times [2019-12-27 01:56:47,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:47,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844411008] [2019-12-27 01:56:47,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:47,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844411008] [2019-12-27 01:56:47,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:47,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:56:47,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243526131] [2019-12-27 01:56:47,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:56:47,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:47,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:56:47,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:56:47,837 INFO L87 Difference]: Start difference. First operand 33068 states and 106908 transitions. Second operand 5 states. [2019-12-27 01:56:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:48,383 INFO L93 Difference]: Finished difference Result 45410 states and 145082 transitions. [2019-12-27 01:56:48,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:56:48,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 01:56:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:48,470 INFO L225 Difference]: With dead ends: 45410 [2019-12-27 01:56:48,471 INFO L226 Difference]: Without dead ends: 45410 [2019-12-27 01:56:48,471 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 01:56:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45410 states. [2019-12-27 01:56:50,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45410 to 38207. [2019-12-27 01:56:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38207 states. [2019-12-27 01:56:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38207 states to 38207 states and 123094 transitions. [2019-12-27 01:56:50,486 INFO L78 Accepts]: Start accepts. Automaton has 38207 states and 123094 transitions. Word has length 16 [2019-12-27 01:56:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:50,487 INFO L462 AbstractCegarLoop]: Abstraction has 38207 states and 123094 transitions. [2019-12-27 01:56:50,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:56:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 38207 states and 123094 transitions. [2019-12-27 01:56:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:56:50,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:50,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:50,497 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:50,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:50,497 INFO L82 PathProgramCache]: Analyzing trace with hash -219431606, now seen corresponding path program 1 times [2019-12-27 01:56:50,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:50,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113633242] [2019-12-27 01:56:50,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:50,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113633242] [2019-12-27 01:56:50,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:50,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:56:50,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947951114] [2019-12-27 01:56:50,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:56:50,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:50,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:56:50,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:56:50,591 INFO L87 Difference]: Start difference. First operand 38207 states and 123094 transitions. Second operand 6 states. [2019-12-27 01:56:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:51,601 INFO L93 Difference]: Finished difference Result 56872 states and 178934 transitions. [2019-12-27 01:56:51,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:56:51,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 01:56:51,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:51,688 INFO L225 Difference]: With dead ends: 56872 [2019-12-27 01:56:51,688 INFO L226 Difference]: Without dead ends: 56865 [2019-12-27 01:56:51,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:56:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56865 states. [2019-12-27 01:56:52,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56865 to 38602. [2019-12-27 01:56:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38602 states. [2019-12-27 01:56:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38602 states to 38602 states and 123793 transitions. [2019-12-27 01:56:52,467 INFO L78 Accepts]: Start accepts. Automaton has 38602 states and 123793 transitions. Word has length 22 [2019-12-27 01:56:52,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:52,468 INFO L462 AbstractCegarLoop]: Abstraction has 38602 states and 123793 transitions. [2019-12-27 01:56:52,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:56:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 38602 states and 123793 transitions. [2019-12-27 01:56:52,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:56:52,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:52,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:52,480 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:52,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:52,481 INFO L82 PathProgramCache]: Analyzing trace with hash -2132778958, now seen corresponding path program 1 times [2019-12-27 01:56:52,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:52,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021313685] [2019-12-27 01:56:52,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:52,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021313685] [2019-12-27 01:56:52,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:52,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:56:52,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305300097] [2019-12-27 01:56:52,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:56:52,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:52,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:56:52,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:56:52,538 INFO L87 Difference]: Start difference. First operand 38602 states and 123793 transitions. Second operand 4 states. [2019-12-27 01:56:52,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:52,611 INFO L93 Difference]: Finished difference Result 16014 states and 48574 transitions. [2019-12-27 01:56:52,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:56:52,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:56:52,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:52,632 INFO L225 Difference]: With dead ends: 16014 [2019-12-27 01:56:52,632 INFO L226 Difference]: Without dead ends: 16014 [2019-12-27 01:56:52,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:56:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-12-27 01:56:53,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 15686. [2019-12-27 01:56:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-27 01:56:53,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 47638 transitions. [2019-12-27 01:56:53,492 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 47638 transitions. Word has length 25 [2019-12-27 01:56:53,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:53,492 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 47638 transitions. [2019-12-27 01:56:53,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:56:53,493 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 47638 transitions. [2019-12-27 01:56:53,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:56:53,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:53,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:53,503 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:53,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:53,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1790545903, now seen corresponding path program 1 times [2019-12-27 01:56:53,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:53,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275878411] [2019-12-27 01:56:53,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:53,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275878411] [2019-12-27 01:56:53,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:53,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:56:53,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311720751] [2019-12-27 01:56:53,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:56:53,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:53,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:56:53,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:56:53,592 INFO L87 Difference]: Start difference. First operand 15686 states and 47638 transitions. Second operand 6 states. [2019-12-27 01:56:54,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:54,182 INFO L93 Difference]: Finished difference Result 22624 states and 66983 transitions. [2019-12-27 01:56:54,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:56:54,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 01:56:54,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:54,224 INFO L225 Difference]: With dead ends: 22624 [2019-12-27 01:56:54,224 INFO L226 Difference]: Without dead ends: 22624 [2019-12-27 01:56:54,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:56:54,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22624 states. [2019-12-27 01:56:54,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22624 to 18003. [2019-12-27 01:56:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18003 states. [2019-12-27 01:56:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18003 states to 18003 states and 54460 transitions. [2019-12-27 01:56:54,589 INFO L78 Accepts]: Start accepts. Automaton has 18003 states and 54460 transitions. Word has length 27 [2019-12-27 01:56:54,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:54,589 INFO L462 AbstractCegarLoop]: Abstraction has 18003 states and 54460 transitions. [2019-12-27 01:56:54,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:56:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 18003 states and 54460 transitions. [2019-12-27 01:56:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:56:54,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:54,607 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:54,607 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:54,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:54,608 INFO L82 PathProgramCache]: Analyzing trace with hash -718999585, now seen corresponding path program 1 times [2019-12-27 01:56:54,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:54,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601257540] [2019-12-27 01:56:54,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:54,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601257540] [2019-12-27 01:56:54,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:54,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:56:54,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691597086] [2019-12-27 01:56:54,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:56:54,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:54,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:56:54,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:56:54,740 INFO L87 Difference]: Start difference. First operand 18003 states and 54460 transitions. Second operand 7 states. [2019-12-27 01:56:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:55,895 INFO L93 Difference]: Finished difference Result 24689 states and 72792 transitions. [2019-12-27 01:56:55,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:56:55,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 01:56:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:55,942 INFO L225 Difference]: With dead ends: 24689 [2019-12-27 01:56:55,942 INFO L226 Difference]: Without dead ends: 24689 [2019-12-27 01:56:55,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:56:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-27 01:56:56,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 16556. [2019-12-27 01:56:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16556 states. [2019-12-27 01:56:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16556 states to 16556 states and 50149 transitions. [2019-12-27 01:56:56,276 INFO L78 Accepts]: Start accepts. Automaton has 16556 states and 50149 transitions. Word has length 33 [2019-12-27 01:56:56,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:56,276 INFO L462 AbstractCegarLoop]: Abstraction has 16556 states and 50149 transitions. [2019-12-27 01:56:56,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:56:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 16556 states and 50149 transitions. [2019-12-27 01:56:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:56:56,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:56,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:56,301 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:56,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:56,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1488715022, now seen corresponding path program 1 times [2019-12-27 01:56:56,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:56,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912165631] [2019-12-27 01:56:56,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:56,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912165631] [2019-12-27 01:56:56,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:56,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:56:56,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971320455] [2019-12-27 01:56:56,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:56:56,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:56,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:56:56,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:56,370 INFO L87 Difference]: Start difference. First operand 16556 states and 50149 transitions. Second operand 3 states. [2019-12-27 01:56:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:56,498 INFO L93 Difference]: Finished difference Result 31245 states and 94721 transitions. [2019-12-27 01:56:56,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:56:56,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:56:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:56,525 INFO L225 Difference]: With dead ends: 31245 [2019-12-27 01:56:56,525 INFO L226 Difference]: Without dead ends: 17019 [2019-12-27 01:56:56,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-12-27 01:56:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 16954. [2019-12-27 01:56:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 01:56:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50123 transitions. [2019-12-27 01:56:57,424 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50123 transitions. Word has length 39 [2019-12-27 01:56:57,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:57,424 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50123 transitions. [2019-12-27 01:56:57,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:56:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50123 transitions. [2019-12-27 01:56:57,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:56:57,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:57,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:57,446 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:57,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:57,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1258899919, now seen corresponding path program 1 times [2019-12-27 01:56:57,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:57,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814506934] [2019-12-27 01:56:57,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:57,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 01:56:57,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814506934] [2019-12-27 01:56:57,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:57,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:56:57,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105787545] [2019-12-27 01:56:57,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:56:57,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:57,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:56:57,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:56:57,517 INFO L87 Difference]: Start difference. First operand 16954 states and 50123 transitions. Second operand 4 states. [2019-12-27 01:56:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:57,627 INFO L93 Difference]: Finished difference Result 24032 states and 72414 transitions. [2019-12-27 01:56:57,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:56:57,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 01:56:57,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:57,645 INFO L225 Difference]: With dead ends: 24032 [2019-12-27 01:56:57,645 INFO L226 Difference]: Without dead ends: 10093 [2019-12-27 01:56:57,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:56:57,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-27 01:56:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10019. [2019-12-27 01:56:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10019 states. [2019-12-27 01:56:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 28985 transitions. [2019-12-27 01:56:57,807 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 28985 transitions. Word has length 40 [2019-12-27 01:56:57,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:57,808 INFO L462 AbstractCegarLoop]: Abstraction has 10019 states and 28985 transitions. [2019-12-27 01:56:57,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:56:57,808 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 28985 transitions. [2019-12-27 01:56:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:56:57,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:57,820 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:57,821 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:57,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:57,821 INFO L82 PathProgramCache]: Analyzing trace with hash -328554267, now seen corresponding path program 2 times [2019-12-27 01:56:57,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:57,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375918902] [2019-12-27 01:56:57,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:57,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375918902] [2019-12-27 01:56:57,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:57,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:56:57,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288233777] [2019-12-27 01:56:57,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:56:57,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:57,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:56:57,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:56:57,885 INFO L87 Difference]: Start difference. First operand 10019 states and 28985 transitions. Second operand 5 states. [2019-12-27 01:56:57,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:57,937 INFO L93 Difference]: Finished difference Result 9224 states and 27210 transitions. [2019-12-27 01:56:57,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:56:57,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:56:57,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:57,947 INFO L225 Difference]: With dead ends: 9224 [2019-12-27 01:56:57,947 INFO L226 Difference]: Without dead ends: 6480 [2019-12-27 01:56:57,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:56:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-12-27 01:56:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 6480. [2019-12-27 01:56:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6480 states. [2019-12-27 01:56:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 20925 transitions. [2019-12-27 01:56:58,057 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 20925 transitions. Word has length 40 [2019-12-27 01:56:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:58,057 INFO L462 AbstractCegarLoop]: Abstraction has 6480 states and 20925 transitions. [2019-12-27 01:56:58,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:56:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 20925 transitions. [2019-12-27 01:56:58,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:56:58,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:58,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:58,065 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:58,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:58,065 INFO L82 PathProgramCache]: Analyzing trace with hash -195559637, now seen corresponding path program 1 times [2019-12-27 01:56:58,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:58,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030986245] [2019-12-27 01:56:58,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:58,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030986245] [2019-12-27 01:56:58,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:58,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:56:58,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584821079] [2019-12-27 01:56:58,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:56:58,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:58,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:56:58,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:58,117 INFO L87 Difference]: Start difference. First operand 6480 states and 20925 transitions. Second operand 3 states. [2019-12-27 01:56:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:58,181 INFO L93 Difference]: Finished difference Result 9612 states and 30454 transitions. [2019-12-27 01:56:58,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:56:58,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:56:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:58,199 INFO L225 Difference]: With dead ends: 9612 [2019-12-27 01:56:58,200 INFO L226 Difference]: Without dead ends: 9612 [2019-12-27 01:56:58,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:58,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9612 states. [2019-12-27 01:56:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9612 to 7416. [2019-12-27 01:56:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7416 states. [2019-12-27 01:56:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 23733 transitions. [2019-12-27 01:56:58,402 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 23733 transitions. Word has length 64 [2019-12-27 01:56:58,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:58,402 INFO L462 AbstractCegarLoop]: Abstraction has 7416 states and 23733 transitions. [2019-12-27 01:56:58,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:56:58,402 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 23733 transitions. [2019-12-27 01:56:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:56:58,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:58,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:58,423 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:58,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:58,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1426110435, now seen corresponding path program 1 times [2019-12-27 01:56:58,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:58,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324810933] [2019-12-27 01:56:58,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:58,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:58,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324810933] [2019-12-27 01:56:58,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:58,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:56:58,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010919337] [2019-12-27 01:56:58,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:56:58,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:58,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:56:58,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:56:58,520 INFO L87 Difference]: Start difference. First operand 7416 states and 23733 transitions. Second operand 7 states. [2019-12-27 01:56:58,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:58,792 INFO L93 Difference]: Finished difference Result 14786 states and 46379 transitions. [2019-12-27 01:56:58,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:56:58,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:56:58,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:58,808 INFO L225 Difference]: With dead ends: 14786 [2019-12-27 01:56:58,808 INFO L226 Difference]: Without dead ends: 11103 [2019-12-27 01:56:58,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:56:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11103 states. [2019-12-27 01:56:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11103 to 9096. [2019-12-27 01:56:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9096 states. [2019-12-27 01:56:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9096 states to 9096 states and 28970 transitions. [2019-12-27 01:56:58,974 INFO L78 Accepts]: Start accepts. Automaton has 9096 states and 28970 transitions. Word has length 64 [2019-12-27 01:56:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:58,974 INFO L462 AbstractCegarLoop]: Abstraction has 9096 states and 28970 transitions. [2019-12-27 01:56:58,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:56:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 9096 states and 28970 transitions. [2019-12-27 01:56:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:56:58,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:58,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:58,985 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:58,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:58,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1226826331, now seen corresponding path program 2 times [2019-12-27 01:56:58,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:58,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55151572] [2019-12-27 01:56:58,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:59,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55151572] [2019-12-27 01:56:59,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:59,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:56:59,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600087884] [2019-12-27 01:56:59,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:56:59,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:59,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:56:59,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:56:59,089 INFO L87 Difference]: Start difference. First operand 9096 states and 28970 transitions. Second operand 7 states. [2019-12-27 01:56:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:59,371 INFO L93 Difference]: Finished difference Result 16709 states and 52072 transitions. [2019-12-27 01:56:59,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:56:59,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:56:59,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:59,390 INFO L225 Difference]: With dead ends: 16709 [2019-12-27 01:56:59,390 INFO L226 Difference]: Without dead ends: 12623 [2019-12-27 01:56:59,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:56:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12623 states. [2019-12-27 01:56:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12623 to 10382. [2019-12-27 01:56:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10382 states. [2019-12-27 01:56:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 32866 transitions. [2019-12-27 01:56:59,567 INFO L78 Accepts]: Start accepts. Automaton has 10382 states and 32866 transitions. Word has length 64 [2019-12-27 01:56:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:59,567 INFO L462 AbstractCegarLoop]: Abstraction has 10382 states and 32866 transitions. [2019-12-27 01:56:59,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:56:59,568 INFO L276 IsEmpty]: Start isEmpty. Operand 10382 states and 32866 transitions. [2019-12-27 01:56:59,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:56:59,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:59,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:59,584 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:59,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:59,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2098893209, now seen corresponding path program 3 times [2019-12-27 01:56:59,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:59,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077020792] [2019-12-27 01:56:59,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:59,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:59,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077020792] [2019-12-27 01:56:59,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:59,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:56:59,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353426633] [2019-12-27 01:56:59,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:56:59,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:59,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:56:59,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:56:59,746 INFO L87 Difference]: Start difference. First operand 10382 states and 32866 transitions. Second operand 9 states. [2019-12-27 01:57:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:01,390 INFO L93 Difference]: Finished difference Result 36233 states and 111090 transitions. [2019-12-27 01:57:01,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:57:01,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:57:01,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:01,447 INFO L225 Difference]: With dead ends: 36233 [2019-12-27 01:57:01,448 INFO L226 Difference]: Without dead ends: 32009 [2019-12-27 01:57:01,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-27 01:57:01,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32009 states. [2019-12-27 01:57:01,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32009 to 10214. [2019-12-27 01:57:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10214 states. [2019-12-27 01:57:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10214 states to 10214 states and 32290 transitions. [2019-12-27 01:57:01,779 INFO L78 Accepts]: Start accepts. Automaton has 10214 states and 32290 transitions. Word has length 64 [2019-12-27 01:57:01,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:01,779 INFO L462 AbstractCegarLoop]: Abstraction has 10214 states and 32290 transitions. [2019-12-27 01:57:01,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:57:01,779 INFO L276 IsEmpty]: Start isEmpty. Operand 10214 states and 32290 transitions. [2019-12-27 01:57:01,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:57:01,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:01,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:01,794 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:01,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:01,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1900940369, now seen corresponding path program 1 times [2019-12-27 01:57:01,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:01,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599284914] [2019-12-27 01:57:01,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:01,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599284914] [2019-12-27 01:57:01,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:01,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:57:01,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584581294] [2019-12-27 01:57:01,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:57:01,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:01,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:57:01,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:01,838 INFO L87 Difference]: Start difference. First operand 10214 states and 32290 transitions. Second operand 3 states. [2019-12-27 01:57:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:01,915 INFO L93 Difference]: Finished difference Result 12867 states and 40113 transitions. [2019-12-27 01:57:01,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:57:01,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:57:01,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:01,931 INFO L225 Difference]: With dead ends: 12867 [2019-12-27 01:57:01,931 INFO L226 Difference]: Without dead ends: 12867 [2019-12-27 01:57:01,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12867 states. [2019-12-27 01:57:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12867 to 10671. [2019-12-27 01:57:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10671 states. [2019-12-27 01:57:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10671 states to 10671 states and 33392 transitions. [2019-12-27 01:57:02,117 INFO L78 Accepts]: Start accepts. Automaton has 10671 states and 33392 transitions. Word has length 64 [2019-12-27 01:57:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:02,117 INFO L462 AbstractCegarLoop]: Abstraction has 10671 states and 33392 transitions. [2019-12-27 01:57:02,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:57:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 10671 states and 33392 transitions. [2019-12-27 01:57:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:57:02,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:02,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:02,135 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:02,136 INFO L82 PathProgramCache]: Analyzing trace with hash -612356637, now seen corresponding path program 4 times [2019-12-27 01:57:02,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:02,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556052852] [2019-12-27 01:57:02,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:02,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556052852] [2019-12-27 01:57:02,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:02,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:57:02,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193078774] [2019-12-27 01:57:02,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:57:02,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:02,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:57:02,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:57:02,248 INFO L87 Difference]: Start difference. First operand 10671 states and 33392 transitions. Second operand 9 states. [2019-12-27 01:57:03,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:03,219 INFO L93 Difference]: Finished difference Result 28791 states and 88355 transitions. [2019-12-27 01:57:03,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:57:03,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:57:03,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:03,255 INFO L225 Difference]: With dead ends: 28791 [2019-12-27 01:57:03,255 INFO L226 Difference]: Without dead ends: 26476 [2019-12-27 01:57:03,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:57:03,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26476 states. [2019-12-27 01:57:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26476 to 10699. [2019-12-27 01:57:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10699 states. [2019-12-27 01:57:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10699 states to 10699 states and 33546 transitions. [2019-12-27 01:57:03,523 INFO L78 Accepts]: Start accepts. Automaton has 10699 states and 33546 transitions. Word has length 64 [2019-12-27 01:57:03,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:03,523 INFO L462 AbstractCegarLoop]: Abstraction has 10699 states and 33546 transitions. [2019-12-27 01:57:03,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:57:03,523 INFO L276 IsEmpty]: Start isEmpty. Operand 10699 states and 33546 transitions. [2019-12-27 01:57:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:57:03,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:03,533 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:03,533 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:03,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:03,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1413769055, now seen corresponding path program 5 times [2019-12-27 01:57:03,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:03,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162151214] [2019-12-27 01:57:03,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:03,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:03,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162151214] [2019-12-27 01:57:03,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:03,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:57:03,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876648448] [2019-12-27 01:57:03,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:57:03,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:03,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:57:03,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:57:03,604 INFO L87 Difference]: Start difference. First operand 10699 states and 33546 transitions. Second operand 5 states. [2019-12-27 01:57:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:03,919 INFO L93 Difference]: Finished difference Result 12384 states and 38249 transitions. [2019-12-27 01:57:03,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:57:03,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 01:57:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:03,937 INFO L225 Difference]: With dead ends: 12384 [2019-12-27 01:57:03,938 INFO L226 Difference]: Without dead ends: 12384 [2019-12-27 01:57:03,938 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 01:57:03,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12384 states. [2019-12-27 01:57:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12384 to 11630. [2019-12-27 01:57:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11630 states. [2019-12-27 01:57:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11630 states to 11630 states and 36167 transitions. [2019-12-27 01:57:04,117 INFO L78 Accepts]: Start accepts. Automaton has 11630 states and 36167 transitions. Word has length 64 [2019-12-27 01:57:04,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:04,118 INFO L462 AbstractCegarLoop]: Abstraction has 11630 states and 36167 transitions. [2019-12-27 01:57:04,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:57:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 11630 states and 36167 transitions. [2019-12-27 01:57:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:57:04,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:04,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:04,130 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:04,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:04,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1714079827, now seen corresponding path program 6 times [2019-12-27 01:57:04,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:04,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061107267] [2019-12-27 01:57:04,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:04,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061107267] [2019-12-27 01:57:04,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:04,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:57:04,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409818572] [2019-12-27 01:57:04,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:57:04,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:04,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:57:04,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:04,251 INFO L87 Difference]: Start difference. First operand 11630 states and 36167 transitions. Second operand 7 states. [2019-12-27 01:57:05,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:05,693 INFO L93 Difference]: Finished difference Result 20495 states and 61153 transitions. [2019-12-27 01:57:05,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:57:05,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:57:05,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:05,719 INFO L225 Difference]: With dead ends: 20495 [2019-12-27 01:57:05,720 INFO L226 Difference]: Without dead ends: 20327 [2019-12-27 01:57:05,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:57:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20327 states. [2019-12-27 01:57:05,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20327 to 17055. [2019-12-27 01:57:05,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17055 states. [2019-12-27 01:57:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17055 states to 17055 states and 51675 transitions. [2019-12-27 01:57:06,027 INFO L78 Accepts]: Start accepts. Automaton has 17055 states and 51675 transitions. Word has length 64 [2019-12-27 01:57:06,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:06,027 INFO L462 AbstractCegarLoop]: Abstraction has 17055 states and 51675 transitions. [2019-12-27 01:57:06,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:57:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 17055 states and 51675 transitions. [2019-12-27 01:57:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:57:06,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:06,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:06,050 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:06,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:06,050 INFO L82 PathProgramCache]: Analyzing trace with hash 768567647, now seen corresponding path program 7 times [2019-12-27 01:57:06,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:06,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977961576] [2019-12-27 01:57:06,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:06,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977961576] [2019-12-27 01:57:06,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:06,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:57:06,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392540465] [2019-12-27 01:57:06,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:57:06,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:06,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:57:06,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:57:06,138 INFO L87 Difference]: Start difference. First operand 17055 states and 51675 transitions. Second operand 6 states. [2019-12-27 01:57:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:06,851 INFO L93 Difference]: Finished difference Result 30832 states and 92113 transitions. [2019-12-27 01:57:06,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 01:57:06,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 01:57:06,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:06,893 INFO L225 Difference]: With dead ends: 30832 [2019-12-27 01:57:06,893 INFO L226 Difference]: Without dead ends: 30612 [2019-12-27 01:57:06,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:57:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30612 states. [2019-12-27 01:57:07,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30612 to 22076. [2019-12-27 01:57:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22076 states. [2019-12-27 01:57:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22076 states to 22076 states and 66013 transitions. [2019-12-27 01:57:07,319 INFO L78 Accepts]: Start accepts. Automaton has 22076 states and 66013 transitions. Word has length 64 [2019-12-27 01:57:07,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:07,320 INFO L462 AbstractCegarLoop]: Abstraction has 22076 states and 66013 transitions. [2019-12-27 01:57:07,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:57:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 22076 states and 66013 transitions. [2019-12-27 01:57:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:57:07,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:07,345 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:07,345 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:07,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:07,345 INFO L82 PathProgramCache]: Analyzing trace with hash 908702963, now seen corresponding path program 8 times [2019-12-27 01:57:07,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:07,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744720643] [2019-12-27 01:57:07,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:07,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744720643] [2019-12-27 01:57:07,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:07,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:57:07,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942738325] [2019-12-27 01:57:07,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:57:07,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:07,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:57:07,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:57:07,439 INFO L87 Difference]: Start difference. First operand 22076 states and 66013 transitions. Second operand 6 states. [2019-12-27 01:57:08,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:08,115 INFO L93 Difference]: Finished difference Result 26232 states and 77397 transitions. [2019-12-27 01:57:08,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 01:57:08,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 01:57:08,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:08,153 INFO L225 Difference]: With dead ends: 26232 [2019-12-27 01:57:08,153 INFO L226 Difference]: Without dead ends: 26232 [2019-12-27 01:57:08,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:57:08,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26232 states. [2019-12-27 01:57:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26232 to 23702. [2019-12-27 01:57:09,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23702 states. [2019-12-27 01:57:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23702 states to 23702 states and 70494 transitions. [2019-12-27 01:57:09,158 INFO L78 Accepts]: Start accepts. Automaton has 23702 states and 70494 transitions. Word has length 64 [2019-12-27 01:57:09,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:09,159 INFO L462 AbstractCegarLoop]: Abstraction has 23702 states and 70494 transitions. [2019-12-27 01:57:09,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:57:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 23702 states and 70494 transitions. [2019-12-27 01:57:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:57:09,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:09,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:09,186 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:09,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:09,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1398237635, now seen corresponding path program 9 times [2019-12-27 01:57:09,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:09,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154659563] [2019-12-27 01:57:09,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:09,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154659563] [2019-12-27 01:57:09,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:09,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:57:09,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584723207] [2019-12-27 01:57:09,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:57:09,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:09,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:57:09,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:09,277 INFO L87 Difference]: Start difference. First operand 23702 states and 70494 transitions. Second operand 7 states. [2019-12-27 01:57:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:10,274 INFO L93 Difference]: Finished difference Result 32787 states and 97475 transitions. [2019-12-27 01:57:10,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:57:10,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:57:10,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:10,344 INFO L225 Difference]: With dead ends: 32787 [2019-12-27 01:57:10,344 INFO L226 Difference]: Without dead ends: 32787 [2019-12-27 01:57:10,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:57:10,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32787 states. [2019-12-27 01:57:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32787 to 23660. [2019-12-27 01:57:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23660 states. [2019-12-27 01:57:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23660 states to 23660 states and 70388 transitions. [2019-12-27 01:57:10,842 INFO L78 Accepts]: Start accepts. Automaton has 23660 states and 70388 transitions. Word has length 64 [2019-12-27 01:57:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:10,842 INFO L462 AbstractCegarLoop]: Abstraction has 23660 states and 70388 transitions. [2019-12-27 01:57:10,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:57:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 23660 states and 70388 transitions. [2019-12-27 01:57:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:57:10,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:10,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:10,869 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:10,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:10,870 INFO L82 PathProgramCache]: Analyzing trace with hash 130546237, now seen corresponding path program 10 times [2019-12-27 01:57:10,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:10,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048811036] [2019-12-27 01:57:10,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:10,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048811036] [2019-12-27 01:57:10,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:10,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:57:10,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126859824] [2019-12-27 01:57:10,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:57:10,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:10,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:57:10,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:57:10,960 INFO L87 Difference]: Start difference. First operand 23660 states and 70388 transitions. Second operand 6 states. [2019-12-27 01:57:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:11,617 INFO L93 Difference]: Finished difference Result 39906 states and 117393 transitions. [2019-12-27 01:57:11,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:57:11,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 01:57:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:11,666 INFO L225 Difference]: With dead ends: 39906 [2019-12-27 01:57:11,666 INFO L226 Difference]: Without dead ends: 39906 [2019-12-27 01:57:11,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:57:11,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39906 states. [2019-12-27 01:57:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39906 to 25943. [2019-12-27 01:57:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25943 states. [2019-12-27 01:57:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25943 states to 25943 states and 77260 transitions. [2019-12-27 01:57:12,835 INFO L78 Accepts]: Start accepts. Automaton has 25943 states and 77260 transitions. Word has length 64 [2019-12-27 01:57:12,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:12,836 INFO L462 AbstractCegarLoop]: Abstraction has 25943 states and 77260 transitions. [2019-12-27 01:57:12,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:57:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 25943 states and 77260 transitions. [2019-12-27 01:57:12,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:57:12,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:12,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:12,859 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:12,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:12,859 INFO L82 PathProgramCache]: Analyzing trace with hash -789321411, now seen corresponding path program 11 times [2019-12-27 01:57:12,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:12,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454696793] [2019-12-27 01:57:12,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:12,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454696793] [2019-12-27 01:57:12,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:12,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:57:12,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292578020] [2019-12-27 01:57:12,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:57:12,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:12,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:57:12,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:57:12,973 INFO L87 Difference]: Start difference. First operand 25943 states and 77260 transitions. Second operand 8 states. [2019-12-27 01:57:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:13,745 INFO L93 Difference]: Finished difference Result 39554 states and 116390 transitions. [2019-12-27 01:57:13,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:57:13,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 01:57:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:13,794 INFO L225 Difference]: With dead ends: 39554 [2019-12-27 01:57:13,794 INFO L226 Difference]: Without dead ends: 39554 [2019-12-27 01:57:13,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:57:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39554 states. [2019-12-27 01:57:14,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39554 to 24422. [2019-12-27 01:57:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24422 states. [2019-12-27 01:57:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24422 states to 24422 states and 72832 transitions. [2019-12-27 01:57:14,260 INFO L78 Accepts]: Start accepts. Automaton has 24422 states and 72832 transitions. Word has length 64 [2019-12-27 01:57:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:14,261 INFO L462 AbstractCegarLoop]: Abstraction has 24422 states and 72832 transitions. [2019-12-27 01:57:14,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:57:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 24422 states and 72832 transitions. [2019-12-27 01:57:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:57:14,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:14,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:14,287 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:14,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:14,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1935640731, now seen corresponding path program 12 times [2019-12-27 01:57:14,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:14,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859326950] [2019-12-27 01:57:14,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:14,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859326950] [2019-12-27 01:57:14,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:14,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:57:14,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757679430] [2019-12-27 01:57:14,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:57:14,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:14,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:57:14,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:57:14,371 INFO L87 Difference]: Start difference. First operand 24422 states and 72832 transitions. Second operand 6 states. [2019-12-27 01:57:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:15,088 INFO L93 Difference]: Finished difference Result 29876 states and 87811 transitions. [2019-12-27 01:57:15,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 01:57:15,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 01:57:15,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:15,129 INFO L225 Difference]: With dead ends: 29876 [2019-12-27 01:57:15,129 INFO L226 Difference]: Without dead ends: 29636 [2019-12-27 01:57:15,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:57:15,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29636 states. [2019-12-27 01:57:15,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29636 to 25232. [2019-12-27 01:57:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25232 states. [2019-12-27 01:57:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25232 states to 25232 states and 75139 transitions. [2019-12-27 01:57:15,556 INFO L78 Accepts]: Start accepts. Automaton has 25232 states and 75139 transitions. Word has length 64 [2019-12-27 01:57:15,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:15,556 INFO L462 AbstractCegarLoop]: Abstraction has 25232 states and 75139 transitions. [2019-12-27 01:57:15,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:57:15,556 INFO L276 IsEmpty]: Start isEmpty. Operand 25232 states and 75139 transitions. [2019-12-27 01:57:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:57:15,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:15,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:15,584 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:15,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:15,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1015773083, now seen corresponding path program 13 times [2019-12-27 01:57:15,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:15,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051154966] [2019-12-27 01:57:15,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:16,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051154966] [2019-12-27 01:57:16,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:16,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:57:16,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781584637] [2019-12-27 01:57:16,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:57:16,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:16,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:57:16,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:57:16,349 INFO L87 Difference]: Start difference. First operand 25232 states and 75139 transitions. Second operand 8 states. [2019-12-27 01:57:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:17,334 INFO L93 Difference]: Finished difference Result 30062 states and 88356 transitions. [2019-12-27 01:57:17,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:57:17,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 01:57:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:17,377 INFO L225 Difference]: With dead ends: 30062 [2019-12-27 01:57:17,378 INFO L226 Difference]: Without dead ends: 30062 [2019-12-27 01:57:17,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:57:17,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30062 states. [2019-12-27 01:57:17,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30062 to 24704. [2019-12-27 01:57:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24704 states. [2019-12-27 01:57:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24704 states to 24704 states and 73613 transitions. [2019-12-27 01:57:17,821 INFO L78 Accepts]: Start accepts. Automaton has 24704 states and 73613 transitions. Word has length 64 [2019-12-27 01:57:17,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:17,821 INFO L462 AbstractCegarLoop]: Abstraction has 24704 states and 73613 transitions. [2019-12-27 01:57:17,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:57:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 24704 states and 73613 transitions. [2019-12-27 01:57:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:57:17,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:17,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:17,846 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 01:57:17,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:17,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1465014471, now seen corresponding path program 14 times [2019-12-27 01:57:17,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:17,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866564012] [2019-12-27 01:57:17,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:17,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866564012] [2019-12-27 01:57:17,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:17,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:57:17,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856639529] [2019-12-27 01:57:17,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:57:17,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:17,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:57:17,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:17,953 INFO L87 Difference]: Start difference. First operand 24704 states and 73613 transitions. Second operand 7 states. [2019-12-27 01:57:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:18,909 INFO L93 Difference]: Finished difference Result 41423 states and 122117 transitions. [2019-12-27 01:57:18,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 01:57:18,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:57:18,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:18,971 INFO L225 Difference]: With dead ends: 41423 [2019-12-27 01:57:18,971 INFO L226 Difference]: Without dead ends: 41423 [2019-12-27 01:57:18,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:57:19,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41423 states. [2019-12-27 01:57:19,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41423 to 26805. [2019-12-27 01:57:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26805 states. [2019-12-27 01:57:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26805 states to 26805 states and 79808 transitions. [2019-12-27 01:57:19,508 INFO L78 Accepts]: Start accepts. Automaton has 26805 states and 79808 transitions. Word has length 64 [2019-12-27 01:57:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:19,508 INFO L462 AbstractCegarLoop]: Abstraction has 26805 states and 79808 transitions. [2019-12-27 01:57:19,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:57:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 26805 states and 79808 transitions. [2019-12-27 01:57:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:57:19,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:19,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:19,537 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 01:57:19,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:19,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1910085177, now seen corresponding path program 15 times [2019-12-27 01:57:19,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:19,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342226070] [2019-12-27 01:57:19,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:19,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342226070] [2019-12-27 01:57:19,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:19,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:57:19,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544030324] [2019-12-27 01:57:19,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:57:19,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:19,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:57:19,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:57:19,645 INFO L87 Difference]: Start difference. First operand 26805 states and 79808 transitions. Second operand 9 states. [2019-12-27 01:57:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:21,206 INFO L93 Difference]: Finished difference Result 40950 states and 120760 transitions. [2019-12-27 01:57:21,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 01:57:21,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:57:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:21,261 INFO L225 Difference]: With dead ends: 40950 [2019-12-27 01:57:21,261 INFO L226 Difference]: Without dead ends: 40950 [2019-12-27 01:57:21,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:57:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40950 states. [2019-12-27 01:57:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40950 to 24552. [2019-12-27 01:57:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24552 states. [2019-12-27 01:57:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24552 states to 24552 states and 73089 transitions. [2019-12-27 01:57:21,768 INFO L78 Accepts]: Start accepts. Automaton has 24552 states and 73089 transitions. Word has length 64 [2019-12-27 01:57:21,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:21,768 INFO L462 AbstractCegarLoop]: Abstraction has 24552 states and 73089 transitions. [2019-12-27 01:57:21,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:57:21,768 INFO L276 IsEmpty]: Start isEmpty. Operand 24552 states and 73089 transitions. [2019-12-27 01:57:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:57:21,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:21,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:21,794 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 01:57:21,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:21,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1742611803, now seen corresponding path program 16 times [2019-12-27 01:57:21,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:21,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577874397] [2019-12-27 01:57:21,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:21,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 01:57:21,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577874397] [2019-12-27 01:57:21,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:21,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:57:21,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914629071] [2019-12-27 01:57:21,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:57:21,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:21,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:57:21,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:21,843 INFO L87 Difference]: Start difference. First operand 24552 states and 73089 transitions. Second operand 3 states. [2019-12-27 01:57:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:21,939 INFO L93 Difference]: Finished difference Result 24552 states and 73088 transitions. [2019-12-27 01:57:21,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:57:21,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:57:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:21,970 INFO L225 Difference]: With dead ends: 24552 [2019-12-27 01:57:21,970 INFO L226 Difference]: Without dead ends: 24552 [2019-12-27 01:57:21,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:22,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24552 states. [2019-12-27 01:57:22,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24552 to 21379. [2019-12-27 01:57:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21379 states. [2019-12-27 01:57:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21379 states to 21379 states and 64144 transitions. [2019-12-27 01:57:22,323 INFO L78 Accepts]: Start accepts. Automaton has 21379 states and 64144 transitions. Word has length 64 [2019-12-27 01:57:22,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:22,323 INFO L462 AbstractCegarLoop]: Abstraction has 21379 states and 64144 transitions. [2019-12-27 01:57:22,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:57:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 21379 states and 64144 transitions. [2019-12-27 01:57:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:57:22,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:22,345 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:22,345 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 01:57:22,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:22,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2117464962, now seen corresponding path program 1 times [2019-12-27 01:57:22,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:22,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769328923] [2019-12-27 01:57:22,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:22,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769328923] [2019-12-27 01:57:22,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:22,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:57:22,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4541505] [2019-12-27 01:57:22,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:57:22,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:22,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:57:22,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:22,413 INFO L87 Difference]: Start difference. First operand 21379 states and 64144 transitions. Second operand 3 states. [2019-12-27 01:57:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:22,488 INFO L93 Difference]: Finished difference Result 14552 states and 43201 transitions. [2019-12-27 01:57:22,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:57:22,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:57:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:22,520 INFO L225 Difference]: With dead ends: 14552 [2019-12-27 01:57:22,520 INFO L226 Difference]: Without dead ends: 14552 [2019-12-27 01:57:22,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14552 states. [2019-12-27 01:57:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14552 to 14345. [2019-12-27 01:57:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14345 states. [2019-12-27 01:57:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 42613 transitions. [2019-12-27 01:57:22,910 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 42613 transitions. Word has length 65 [2019-12-27 01:57:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:22,910 INFO L462 AbstractCegarLoop]: Abstraction has 14345 states and 42613 transitions. [2019-12-27 01:57:22,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:57:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 42613 transitions. [2019-12-27 01:57:22,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:57:22,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:22,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:22,934 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:22,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:22,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1338482558, now seen corresponding path program 1 times [2019-12-27 01:57:22,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:22,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7120466] [2019-12-27 01:57:22,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:23,632 WARN L192 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-27 01:57:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:23,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7120466] [2019-12-27 01:57:23,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:23,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:57:23,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645858734] [2019-12-27 01:57:23,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:57:23,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:23,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:57:23,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:57:23,662 INFO L87 Difference]: Start difference. First operand 14345 states and 42613 transitions. Second operand 8 states. [2019-12-27 01:57:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:24,444 INFO L93 Difference]: Finished difference Result 25482 states and 74721 transitions. [2019-12-27 01:57:24,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 01:57:24,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 01:57:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:24,469 INFO L225 Difference]: With dead ends: 25482 [2019-12-27 01:57:24,469 INFO L226 Difference]: Without dead ends: 18758 [2019-12-27 01:57:24,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:57:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18758 states. [2019-12-27 01:57:24,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18758 to 15008. [2019-12-27 01:57:24,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15008 states. [2019-12-27 01:57:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15008 states to 15008 states and 44099 transitions. [2019-12-27 01:57:24,723 INFO L78 Accepts]: Start accepts. Automaton has 15008 states and 44099 transitions. Word has length 66 [2019-12-27 01:57:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:24,724 INFO L462 AbstractCegarLoop]: Abstraction has 15008 states and 44099 transitions. [2019-12-27 01:57:24,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:57:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 15008 states and 44099 transitions. [2019-12-27 01:57:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:57:24,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:24,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:24,740 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:24,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:24,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1029826500, now seen corresponding path program 2 times [2019-12-27 01:57:24,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:24,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366686994] [2019-12-27 01:57:24,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:24,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 01:57:24,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366686994] [2019-12-27 01:57:24,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:24,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:57:24,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098826745] [2019-12-27 01:57:24,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:57:24,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:24,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:57:24,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:57:24,843 INFO L87 Difference]: Start difference. First operand 15008 states and 44099 transitions. Second operand 9 states. [2019-12-27 01:57:25,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:25,651 INFO L93 Difference]: Finished difference Result 24021 states and 69932 transitions. [2019-12-27 01:57:25,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:57:25,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 01:57:25,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:25,674 INFO L225 Difference]: With dead ends: 24021 [2019-12-27 01:57:25,674 INFO L226 Difference]: Without dead ends: 17577 [2019-12-27 01:57:25,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:57:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17577 states. [2019-12-27 01:57:25,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17577 to 14770. [2019-12-27 01:57:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14770 states. [2019-12-27 01:57:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14770 states to 14770 states and 43349 transitions. [2019-12-27 01:57:25,918 INFO L78 Accepts]: Start accepts. Automaton has 14770 states and 43349 transitions. Word has length 66 [2019-12-27 01:57:25,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:25,918 INFO L462 AbstractCegarLoop]: Abstraction has 14770 states and 43349 transitions. [2019-12-27 01:57:25,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:57:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 14770 states and 43349 transitions. [2019-12-27 01:57:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:57:25,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:25,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:25,934 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:25,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:25,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1662390436, now seen corresponding path program 3 times [2019-12-27 01:57:25,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:25,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259488606] [2019-12-27 01:57:25,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:26,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259488606] [2019-12-27 01:57:26,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:26,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:57:26,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109819507] [2019-12-27 01:57:26,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:57:26,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:26,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:57:26,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:57:26,078 INFO L87 Difference]: Start difference. First operand 14770 states and 43349 transitions. Second operand 10 states. [2019-12-27 01:57:27,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:27,757 INFO L93 Difference]: Finished difference Result 25274 states and 72784 transitions. [2019-12-27 01:57:27,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:57:27,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 01:57:27,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:27,790 INFO L225 Difference]: With dead ends: 25274 [2019-12-27 01:57:27,790 INFO L226 Difference]: Without dead ends: 25274 [2019-12-27 01:57:27,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:57:27,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25274 states. [2019-12-27 01:57:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25274 to 16246. [2019-12-27 01:57:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16246 states. [2019-12-27 01:57:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16246 states to 16246 states and 47556 transitions. [2019-12-27 01:57:28,650 INFO L78 Accepts]: Start accepts. Automaton has 16246 states and 47556 transitions. Word has length 66 [2019-12-27 01:57:28,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:28,650 INFO L462 AbstractCegarLoop]: Abstraction has 16246 states and 47556 transitions. [2019-12-27 01:57:28,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:57:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 16246 states and 47556 transitions. [2019-12-27 01:57:28,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:57:28,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:28,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:28,666 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:28,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:28,666 INFO L82 PathProgramCache]: Analyzing trace with hash -848717318, now seen corresponding path program 4 times [2019-12-27 01:57:28,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:28,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658054491] [2019-12-27 01:57:28,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:28,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658054491] [2019-12-27 01:57:28,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:28,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 01:57:28,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786332804] [2019-12-27 01:57:28,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:57:28,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:28,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:57:28,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:57:28,831 INFO L87 Difference]: Start difference. First operand 16246 states and 47556 transitions. Second operand 11 states. [2019-12-27 01:57:30,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:30,173 INFO L93 Difference]: Finished difference Result 24229 states and 69793 transitions. [2019-12-27 01:57:30,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:57:30,173 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:57:30,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:30,207 INFO L225 Difference]: With dead ends: 24229 [2019-12-27 01:57:30,207 INFO L226 Difference]: Without dead ends: 24229 [2019-12-27 01:57:30,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:57:30,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24229 states. [2019-12-27 01:57:30,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24229 to 16318. [2019-12-27 01:57:30,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16318 states. [2019-12-27 01:57:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16318 states to 16318 states and 47756 transitions. [2019-12-27 01:57:30,515 INFO L78 Accepts]: Start accepts. Automaton has 16318 states and 47756 transitions. Word has length 66 [2019-12-27 01:57:30,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:30,515 INFO L462 AbstractCegarLoop]: Abstraction has 16318 states and 47756 transitions. [2019-12-27 01:57:30,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:57:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 16318 states and 47756 transitions. [2019-12-27 01:57:30,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:57:30,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:30,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:30,530 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:30,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:30,530 INFO L82 PathProgramCache]: Analyzing trace with hash 150910970, now seen corresponding path program 5 times [2019-12-27 01:57:30,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:30,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533641404] [2019-12-27 01:57:30,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:30,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533641404] [2019-12-27 01:57:30,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:30,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 01:57:30,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402738120] [2019-12-27 01:57:30,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:57:30,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:30,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:57:30,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:57:30,709 INFO L87 Difference]: Start difference. First operand 16318 states and 47756 transitions. Second operand 11 states. [2019-12-27 01:57:32,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:32,514 INFO L93 Difference]: Finished difference Result 25237 states and 72487 transitions. [2019-12-27 01:57:32,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:57:32,515 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:57:32,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:32,547 INFO L225 Difference]: With dead ends: 25237 [2019-12-27 01:57:32,547 INFO L226 Difference]: Without dead ends: 25237 [2019-12-27 01:57:32,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:57:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25237 states. [2019-12-27 01:57:32,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25237 to 15766. [2019-12-27 01:57:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15766 states. [2019-12-27 01:57:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15766 states to 15766 states and 46172 transitions. [2019-12-27 01:57:32,857 INFO L78 Accepts]: Start accepts. Automaton has 15766 states and 46172 transitions. Word has length 66 [2019-12-27 01:57:32,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:32,858 INFO L462 AbstractCegarLoop]: Abstraction has 15766 states and 46172 transitions. [2019-12-27 01:57:32,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:57:32,858 INFO L276 IsEmpty]: Start isEmpty. Operand 15766 states and 46172 transitions. [2019-12-27 01:57:32,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:57:32,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:32,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:32,874 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:32,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:32,875 INFO L82 PathProgramCache]: Analyzing trace with hash 312790614, now seen corresponding path program 6 times [2019-12-27 01:57:32,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:32,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682679245] [2019-12-27 01:57:32,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:33,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682679245] [2019-12-27 01:57:33,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:33,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:57:33,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085602061] [2019-12-27 01:57:33,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:57:33,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:33,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:57:33,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:57:33,056 INFO L87 Difference]: Start difference. First operand 15766 states and 46172 transitions. Second operand 11 states. [2019-12-27 01:57:34,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:34,447 INFO L93 Difference]: Finished difference Result 23147 states and 66955 transitions. [2019-12-27 01:57:34,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 01:57:34,448 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:57:34,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:34,472 INFO L225 Difference]: With dead ends: 23147 [2019-12-27 01:57:34,472 INFO L226 Difference]: Without dead ends: 18005 [2019-12-27 01:57:34,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-27 01:57:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18005 states. [2019-12-27 01:57:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18005 to 15208. [2019-12-27 01:57:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15208 states. [2019-12-27 01:57:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15208 states to 15208 states and 44534 transitions. [2019-12-27 01:57:34,724 INFO L78 Accepts]: Start accepts. Automaton has 15208 states and 44534 transitions. Word has length 66 [2019-12-27 01:57:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:34,724 INFO L462 AbstractCegarLoop]: Abstraction has 15208 states and 44534 transitions. [2019-12-27 01:57:34,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:57:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 15208 states and 44534 transitions. [2019-12-27 01:57:34,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:57:34,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:34,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:34,739 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:34,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:34,739 INFO L82 PathProgramCache]: Analyzing trace with hash 777925054, now seen corresponding path program 7 times [2019-12-27 01:57:34,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:34,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766166020] [2019-12-27 01:57:34,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:34,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766166020] [2019-12-27 01:57:34,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:34,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:57:34,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845803058] [2019-12-27 01:57:34,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:57:34,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:34,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:57:34,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:57:34,885 INFO L87 Difference]: Start difference. First operand 15208 states and 44534 transitions. Second operand 10 states. [2019-12-27 01:57:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:37,151 INFO L93 Difference]: Finished difference Result 28214 states and 80972 transitions. [2019-12-27 01:57:37,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:57:37,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 01:57:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:37,190 INFO L225 Difference]: With dead ends: 28214 [2019-12-27 01:57:37,191 INFO L226 Difference]: Without dead ends: 28214 [2019-12-27 01:57:37,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:57:37,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28214 states. [2019-12-27 01:57:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28214 to 13004. [2019-12-27 01:57:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13004 states. [2019-12-27 01:57:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13004 states to 13004 states and 38434 transitions. [2019-12-27 01:57:37,491 INFO L78 Accepts]: Start accepts. Automaton has 13004 states and 38434 transitions. Word has length 66 [2019-12-27 01:57:37,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:37,491 INFO L462 AbstractCegarLoop]: Abstraction has 13004 states and 38434 transitions. [2019-12-27 01:57:37,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:57:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 13004 states and 38434 transitions. [2019-12-27 01:57:37,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:57:37,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:37,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:37,504 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:37,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:37,505 INFO L82 PathProgramCache]: Analyzing trace with hash -124195356, now seen corresponding path program 8 times [2019-12-27 01:57:37,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:37,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125850412] [2019-12-27 01:57:37,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:37,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125850412] [2019-12-27 01:57:37,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:37,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:57:37,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634859813] [2019-12-27 01:57:37,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:57:37,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:37,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:57:37,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:37,591 INFO L87 Difference]: Start difference. First operand 13004 states and 38434 transitions. Second operand 3 states. [2019-12-27 01:57:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:37,683 INFO L93 Difference]: Finished difference Result 14948 states and 44329 transitions. [2019-12-27 01:57:37,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:57:37,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 01:57:37,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:37,709 INFO L225 Difference]: With dead ends: 14948 [2019-12-27 01:57:37,709 INFO L226 Difference]: Without dead ends: 14948 [2019-12-27 01:57:37,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:37,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14948 states. [2019-12-27 01:57:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14948 to 12181. [2019-12-27 01:57:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12181 states. [2019-12-27 01:57:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12181 states to 12181 states and 36301 transitions. [2019-12-27 01:57:38,066 INFO L78 Accepts]: Start accepts. Automaton has 12181 states and 36301 transitions. Word has length 66 [2019-12-27 01:57:38,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:38,067 INFO L462 AbstractCegarLoop]: Abstraction has 12181 states and 36301 transitions. [2019-12-27 01:57:38,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:57:38,067 INFO L276 IsEmpty]: Start isEmpty. Operand 12181 states and 36301 transitions. [2019-12-27 01:57:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:57:38,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:38,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:38,084 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:38,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:38,084 INFO L82 PathProgramCache]: Analyzing trace with hash 8609018, now seen corresponding path program 1 times [2019-12-27 01:57:38,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:38,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909091443] [2019-12-27 01:57:38,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:38,811 WARN L192 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-27 01:57:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:57:38,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909091443] [2019-12-27 01:57:38,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:38,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:57:38,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144044304] [2019-12-27 01:57:38,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:57:38,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:38,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:57:38,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:57:38,820 INFO L87 Difference]: Start difference. First operand 12181 states and 36301 transitions. Second operand 12 states. [2019-12-27 01:57:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:39,580 INFO L93 Difference]: Finished difference Result 14914 states and 44027 transitions. [2019-12-27 01:57:39,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:57:39,581 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 01:57:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:39,601 INFO L225 Difference]: With dead ends: 14914 [2019-12-27 01:57:39,601 INFO L226 Difference]: Without dead ends: 14493 [2019-12-27 01:57:39,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:57:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14493 states. [2019-12-27 01:57:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14493 to 11927. [2019-12-27 01:57:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11927 states. [2019-12-27 01:57:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11927 states to 11927 states and 35657 transitions. [2019-12-27 01:57:39,801 INFO L78 Accepts]: Start accepts. Automaton has 11927 states and 35657 transitions. Word has length 67 [2019-12-27 01:57:39,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:39,801 INFO L462 AbstractCegarLoop]: Abstraction has 11927 states and 35657 transitions. [2019-12-27 01:57:39,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:57:39,801 INFO L276 IsEmpty]: Start isEmpty. Operand 11927 states and 35657 transitions. [2019-12-27 01:57:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:57:39,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:39,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:39,813 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:39,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:39,814 INFO L82 PathProgramCache]: Analyzing trace with hash -919262302, now seen corresponding path program 2 times [2019-12-27 01:57:39,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:39,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704530795] [2019-12-27 01:57:39,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:57:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:57:39,938 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:57:39,938 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:57:39,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_266) (= 0 v_~__unbuffered_p2_EAX~0_32) (= 0 v_~weak$$choice0~0_14) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t654~0.base_24|)) (= |v_#NULL.offset_6| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t654~0.base_24| 4)) (= 0 v_~a$w_buff0_used~0_826) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~a$r_buff0_thd2~0_102) (= |v_ULTIMATE.start_main_~#t654~0.offset_19| 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~a$r_buff0_thd0~0_110 0) (= v_~__unbuffered_cnt~0_102 0) (= v_~main$tmp_guard1~0_29 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t654~0.base_24|) (= v_~a$w_buff0~0_397 0) (= v_~a$flush_delayed~0_27 0) (= 0 |v_#NULL.base_6|) (= v_~y~0_39 0) (= v_~a$mem_tmp~0_16 0) (= v_~__unbuffered_p2_EBX~0_42 0) (= 0 v_~a$r_buff1_thd1~0_142) (= v_~a~0_178 0) (= v_~weak$$choice2~0_137 0) (= 0 v_~__unbuffered_p0_EAX~0_105) (= (store .cse0 |v_ULTIMATE.start_main_~#t654~0.base_24| 1) |v_#valid_63|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t654~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t654~0.base_24|) |v_ULTIMATE.start_main_~#t654~0.offset_19| 0))) (= v_~z~0_40 0) (= 0 v_~a$w_buff1_used~0_523) (= 0 v_~a$r_buff1_thd2~0_138) (= v_~a$r_buff1_thd3~0_297 0) (= v_~a$r_buff0_thd3~0_334 0) (= v_~a$r_buff1_thd0~0_145 0) (= v_~__unbuffered_p0_EBX~0_105 0) (= 0 v_~a$r_buff0_thd1~0_183) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t655~0.offset=|v_ULTIMATE.start_main_~#t655~0.offset_19|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_138, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_47|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_137|, ~a~0=v_~a~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ULTIMATE.start_main_~#t656~0.base=|v_ULTIMATE.start_main_~#t656~0.base_27|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_105, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_297, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_826, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_183, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_397, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_145, ULTIMATE.start_main_~#t656~0.offset=|v_ULTIMATE.start_main_~#t656~0.offset_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_88, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_102, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_129|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_~#t654~0.base=|v_ULTIMATE.start_main_~#t654~0.base_24|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~a$w_buff1~0=v_~a$w_buff1~0_266, ULTIMATE.start_main_~#t654~0.offset=|v_ULTIMATE.start_main_~#t654~0.offset_19|, ~y~0=v_~y~0_39, ULTIMATE.start_main_~#t655~0.base=|v_ULTIMATE.start_main_~#t655~0.base_26|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_29|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_142, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_334, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_40, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_523, ~weak$$choice2~0=v_~weak$$choice2~0_137, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t655~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t656~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t656~0.offset, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_~#t654~0.base, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t654~0.offset, ~y~0, ULTIMATE.start_main_~#t655~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 01:57:39,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L835-1-->L837: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t655~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t655~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t655~0.base_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t655~0.base_10|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t655~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t655~0.base_10|) |v_ULTIMATE.start_main_~#t655~0.offset_9| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t655~0.base_10| 4) |v_#length_17|) (= 0 |v_ULTIMATE.start_main_~#t655~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t655~0.base=|v_ULTIMATE.start_main_~#t655~0.base_10|, ULTIMATE.start_main_~#t655~0.offset=|v_ULTIMATE.start_main_~#t655~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t655~0.base, ULTIMATE.start_main_~#t655~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 01:57:39,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L837-1-->L839: Formula: (and (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t656~0.base_13| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t656~0.base_13|) (= |v_ULTIMATE.start_main_~#t656~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t656~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t656~0.base_13|) |v_ULTIMATE.start_main_~#t656~0.offset_11| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t656~0.base_13|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t656~0.base_13|) 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t656~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t656~0.base=|v_ULTIMATE.start_main_~#t656~0.base_13|, ULTIMATE.start_main_~#t656~0.offset=|v_ULTIMATE.start_main_~#t656~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t656~0.base, ULTIMATE.start_main_~#t656~0.offset, #length] because there is no mapped edge [2019-12-27 01:57:39,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_30 |v_P0Thread1of1ForFork1_#in~arg.offset_30|) (= v_~a$w_buff0_used~0_232 v_~a$w_buff1_used~0_149) (= 1 v_~a$w_buff0_used~0_231) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= v_~a$w_buff0~0_80 v_~a$w_buff1~0_62) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= 1 v_~a$w_buff0~0_79) (= |v_P0Thread1of1ForFork1_#in~arg.base_30| v_P0Thread1of1ForFork1_~arg.base_30) (= (mod v_~a$w_buff1_used~0_149 256) 0)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_80, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_232, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_62, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_79, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_231, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_30} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 01:57:39,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1896050819 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1896050819 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-1896050819| ~a~0_In-1896050819)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-1896050819| ~a$w_buff1~0_In-1896050819) (not .cse0)))) InVars {~a~0=~a~0_In-1896050819, ~a$w_buff1~0=~a$w_buff1~0_In-1896050819, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1896050819, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1896050819} OutVars{~a~0=~a~0_In-1896050819, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1896050819|, ~a$w_buff1~0=~a$w_buff1~0_In-1896050819, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1896050819, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1896050819} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 01:57:39,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In666786561 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In666786561 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out666786561| ~a$w_buff0_used~0_In666786561)) (and (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out666786561|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In666786561, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In666786561} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out666786561|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In666786561, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In666786561} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:57:39,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1480368562 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1480368562 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In1480368562 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In1480368562 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1480368562|)) (and (or .cse1 .cse0) (= ~a$w_buff1_used~0_In1480368562 |P0Thread1of1ForFork1_#t~ite6_Out1480368562|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1480368562, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1480368562, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1480368562, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1480368562} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1480368562|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1480368562, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1480368562, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1480368562, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1480368562} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:57:39,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1953025430 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In1953025430 256) 0))) (or (and (= 0 ~a$r_buff0_thd1~0_Out1953025430) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out1953025430 ~a$r_buff0_thd1~0_In1953025430)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1953025430, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1953025430} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1953025430|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1953025430, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1953025430} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:57:39,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1000000806 256))) (.cse3 (= (mod ~a$r_buff0_thd1~0_In-1000000806 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In-1000000806 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1000000806 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1000000806|)) (and (or .cse2 .cse3) (= ~a$r_buff1_thd1~0_In-1000000806 |P0Thread1of1ForFork1_#t~ite8_Out-1000000806|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1000000806, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1000000806, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1000000806, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1000000806} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1000000806|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1000000806, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1000000806, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1000000806, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1000000806} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:57:39,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L760-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:57:39,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1470766457 256) 0))) (or (and (= ~a$w_buff0~0_In-1470766457 |P2Thread1of1ForFork0_#t~ite21_Out-1470766457|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-1470766457| |P2Thread1of1ForFork0_#t~ite20_Out-1470766457|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite21_Out-1470766457| |P2Thread1of1ForFork0_#t~ite20_Out-1470766457|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1470766457 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-1470766457 256)) (and (= 0 (mod ~a$r_buff1_thd3~0_In-1470766457 256)) .cse1) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1470766457 256) 0)))) (= ~a$w_buff0~0_In-1470766457 |P2Thread1of1ForFork0_#t~ite20_Out-1470766457|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1470766457, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1470766457, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1470766457, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1470766457, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1470766457, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1470766457|, ~weak$$choice2~0=~weak$$choice2~0_In-1470766457} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1470766457|, ~a$w_buff0~0=~a$w_buff0~0_In-1470766457, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1470766457, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1470766457, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1470766457, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1470766457|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1470766457, ~weak$$choice2~0=~weak$$choice2~0_In-1470766457} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 01:57:39,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-441703573 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-441703573| ~a$w_buff0_used~0_In-441703573) (= |P2Thread1of1ForFork0_#t~ite26_In-441703573| |P2Thread1of1ForFork0_#t~ite26_Out-441703573|) (not .cse0)) (and .cse0 (= ~a$w_buff0_used~0_In-441703573 |P2Thread1of1ForFork0_#t~ite26_Out-441703573|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-441703573 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-441703573 256)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-441703573 256))) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-441703573 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite27_Out-441703573| |P2Thread1of1ForFork0_#t~ite26_Out-441703573|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-441703573|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-441703573, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-441703573, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-441703573, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-441703573, ~weak$$choice2~0=~weak$$choice2~0_In-441703573} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-441703573|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-441703573|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-441703573, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-441703573, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-441703573, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-441703573, ~weak$$choice2~0=~weak$$choice2~0_In-441703573} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 01:57:39,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L804-->L804-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In182762807 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out182762807| |P2Thread1of1ForFork0_#t~ite30_Out182762807|) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In182762807 256)))) (or (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In182762807 256))) (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In182762807 256))) (= (mod ~a$w_buff0_used~0_In182762807 256) 0))) (= |P2Thread1of1ForFork0_#t~ite29_Out182762807| ~a$w_buff1_used~0_In182762807) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite29_In182762807| |P2Thread1of1ForFork0_#t~ite29_Out182762807|) (= ~a$w_buff1_used~0_In182762807 |P2Thread1of1ForFork0_#t~ite30_Out182762807|) (not .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In182762807, ~a$w_buff0_used~0=~a$w_buff0_used~0_In182762807, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In182762807, ~a$w_buff1_used~0=~a$w_buff1_used~0_In182762807, ~weak$$choice2~0=~weak$$choice2~0_In182762807, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In182762807|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In182762807, ~a$w_buff0_used~0=~a$w_buff0_used~0_In182762807, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In182762807, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out182762807|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In182762807, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out182762807|, ~weak$$choice2~0=~weak$$choice2~0_In182762807} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:57:39,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 01:57:39,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_20| v_~a~0_46) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_20|} OutVars{~a~0=v_~a~0_46, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_19|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:57:39,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1242897951 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1242897951 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1242897951|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1242897951| ~a$w_buff0_used~0_In1242897951)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1242897951, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1242897951} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1242897951, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1242897951, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1242897951|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:57:39,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In95481971 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In95481971 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In95481971 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In95481971 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out95481971| ~a$w_buff1_used~0_In95481971) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite12_Out95481971| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In95481971, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In95481971, ~a$w_buff0_used~0=~a$w_buff0_used~0_In95481971, ~a$w_buff1_used~0=~a$w_buff1_used~0_In95481971} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In95481971, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In95481971, ~a$w_buff0_used~0=~a$w_buff0_used~0_In95481971, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out95481971|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In95481971} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:57:39,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1352066232 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1352066232 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out1352066232| 0) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In1352066232 |P1Thread1of1ForFork2_#t~ite13_Out1352066232|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1352066232, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1352066232} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1352066232, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1352066232, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1352066232|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:57:39,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In1523458567 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1523458567 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In1523458567 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1523458567 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out1523458567| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite14_Out1523458567| ~a$r_buff1_thd2~0_In1523458567)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1523458567, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1523458567, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1523458567, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1523458567} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1523458567, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1523458567, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1523458567, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1523458567, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1523458567|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:57:39,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_30| v_~a$r_buff1_thd2~0_61) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_30|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_61, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_29|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 01:57:39,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_8 0) (= v_~a~0_52 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_9 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_9} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_52, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 01:57:39,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-1316101592 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out-1316101592| |P2Thread1of1ForFork0_#t~ite38_Out-1316101592|)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1316101592 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1316101592| ~a~0_In-1316101592) .cse2) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1316101592| ~a$w_buff1~0_In-1316101592) (not .cse0) .cse2 (not .cse1)))) InVars {~a~0=~a~0_In-1316101592, ~a$w_buff1~0=~a$w_buff1~0_In-1316101592, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1316101592, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1316101592} OutVars{~a~0=~a~0_In-1316101592, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-1316101592|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1316101592|, ~a$w_buff1~0=~a$w_buff1~0_In-1316101592, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1316101592, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1316101592} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:57:39,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1705505880 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In1705505880 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out1705505880| ~a$w_buff0_used~0_In1705505880) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out1705505880| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1705505880, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1705505880} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1705505880|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1705505880, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1705505880} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:57:39,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In878973973 256))) (.cse2 (= (mod ~a$r_buff1_thd3~0_In878973973 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In878973973 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In878973973 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out878973973| ~a$w_buff1_used~0_In878973973) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out878973973| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In878973973, ~a$w_buff0_used~0=~a$w_buff0_used~0_In878973973, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In878973973, ~a$w_buff1_used~0=~a$w_buff1_used~0_In878973973} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In878973973, ~a$w_buff0_used~0=~a$w_buff0_used~0_In878973973, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In878973973, ~a$w_buff1_used~0=~a$w_buff1_used~0_In878973973, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out878973973|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:57:39,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In972494307 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In972494307 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out972494307| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out972494307| ~a$r_buff0_thd3~0_In972494307) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In972494307, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In972494307} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In972494307, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In972494307, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out972494307|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:57:39,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-548760201 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-548760201 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-548760201 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-548760201 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-548760201| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$r_buff1_thd3~0_In-548760201 |P2Thread1of1ForFork0_#t~ite43_Out-548760201|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-548760201, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-548760201, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-548760201, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-548760201} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-548760201|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-548760201, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-548760201, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-548760201, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-548760201} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:57:39,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_59 (+ v_~__unbuffered_cnt~0_60 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 01:57:39,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:57:39,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-2074424584| |ULTIMATE.start_main_#t~ite47_Out-2074424584|)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-2074424584 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-2074424584 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-2074424584| ~a$w_buff1~0_In-2074424584) .cse0 (not .cse1) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite47_Out-2074424584| ~a~0_In-2074424584) .cse0 (or .cse1 .cse2)))) InVars {~a~0=~a~0_In-2074424584, ~a$w_buff1~0=~a$w_buff1~0_In-2074424584, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2074424584, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2074424584} OutVars{~a~0=~a~0_In-2074424584, ~a$w_buff1~0=~a$w_buff1~0_In-2074424584, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-2074424584|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2074424584, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-2074424584|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2074424584} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 01:57:39,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-1209082905 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1209082905 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1209082905| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-1209082905| ~a$w_buff0_used~0_In-1209082905)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1209082905, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1209082905} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1209082905, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1209082905|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1209082905} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:57:39,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-32390208 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-32390208 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-32390208 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-32390208 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-32390208|)) (and (= ~a$w_buff1_used~0_In-32390208 |ULTIMATE.start_main_#t~ite50_Out-32390208|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-32390208, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-32390208, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-32390208, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-32390208} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-32390208|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-32390208, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-32390208, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-32390208, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-32390208} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:57:39,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-72271890 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-72271890 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-72271890| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out-72271890| ~a$r_buff0_thd0~0_In-72271890) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-72271890, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-72271890} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-72271890|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-72271890, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-72271890} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:57:39,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-629221283 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-629221283 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-629221283 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-629221283 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-629221283| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-629221283| ~a$r_buff1_thd0~0_In-629221283)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-629221283, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-629221283, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-629221283, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-629221283} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-629221283|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-629221283, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-629221283, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-629221283, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-629221283} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:57:39,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= 1 v_~__unbuffered_p0_EAX~0_40) (= 2 v_~__unbuffered_p2_EAX~0_20) (= |v_ULTIMATE.start_main_#t~ite52_35| v_~a$r_buff1_thd0~0_75) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~__unbuffered_p0_EBX~0_40 0) (= v_~z~0_25 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:57:40,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:57:40 BasicIcfg [2019-12-27 01:57:40,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:57:40,079 INFO L168 Benchmark]: Toolchain (without parser) took 116272.29 ms. Allocated memory was 137.4 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 98.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 01:57:40,079 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 01:57:40,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.51 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 98.2 MB in the beginning and 154.0 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:57:40,080 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.27 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 151.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:57:40,081 INFO L168 Benchmark]: Boogie Preprocessor took 41.38 ms. Allocated memory is still 201.9 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 01:57:40,082 INFO L168 Benchmark]: RCFGBuilder took 885.57 ms. Allocated memory is still 201.9 MB. Free memory was 149.2 MB in the beginning and 98.5 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:57:40,083 INFO L168 Benchmark]: TraceAbstraction took 114480.96 ms. Allocated memory was 201.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 97.8 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 01:57:40,084 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.54 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 800.51 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 98.2 MB in the beginning and 154.0 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.27 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 151.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.38 ms. Allocated memory is still 201.9 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 885.57 ms. Allocated memory is still 201.9 MB. Free memory was 149.2 MB in the beginning and 98.5 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114480.96 ms. Allocated memory was 201.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 97.8 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 215 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7050 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 78858 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t654, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t655, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t656, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L740] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L741] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L742] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L743] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L744] 1 a$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L750] 1 __unbuffered_p0_EAX = x [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 y = 1 [L773] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L756] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L757] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L790] 3 z = 2 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L758] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=2] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=2] [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L845] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L845] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 114.1s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 38.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8794 SDtfs, 12128 SDslu, 28279 SDs, 0 SdLazy, 18512 SolverSat, 567 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 534 GetRequests, 125 SyntacticMatches, 33 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151748occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 44.0s AutomataMinimizationTime, 39 MinimizatonAttempts, 253091 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2148 NumberOfCodeBlocks, 2148 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2042 ConstructedInterpolants, 0 QuantifiedInterpolants, 470365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...