/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/mix025_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:52:38,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:52:38,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:52:38,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:52:38,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:52:38,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:52:38,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:52:38,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:52:38,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:52:38,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:52:38,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:52:38,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:52:38,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:52:38,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:52:38,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:52:38,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:52:38,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:52:38,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:52:38,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:52:38,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:52:38,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:52:38,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:52:38,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:52:38,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:52:38,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:52:38,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:52:38,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:52:38,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:52:38,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:52:38,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:52:38,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:52:38,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:52:38,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:52:38,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:52:38,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:52:38,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:52:38,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:52:38,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:52:38,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:52:38,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:52:38,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:52:38,690 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-18 16:52:38,705 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:52:38,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:52:38,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:52:38,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:52:38,707 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:52:38,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:52:38,707 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:52:38,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:52:38,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:52:38,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:52:38,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:52:38,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:52:38,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:52:38,708 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:52:38,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:52:38,709 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:52:38,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:52:38,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:52:38,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:52:38,710 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:52:38,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:52:38,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:52:38,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:52:38,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:52:38,711 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:52:38,711 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:52:38,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:52:38,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:52:38,712 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:52:38,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:52:39,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:52:39,004 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:52:39,005 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:52:39,005 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:52:39,007 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i [2019-12-18 16:52:39,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f515ac1c6/2e5315625c81464693bb377a00b404b7/FLAGa30825620 [2019-12-18 16:52:39,638 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:52:39,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i [2019-12-18 16:52:39,659 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f515ac1c6/2e5315625c81464693bb377a00b404b7/FLAGa30825620 [2019-12-18 16:52:39,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f515ac1c6/2e5315625c81464693bb377a00b404b7 [2019-12-18 16:52:39,882 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:52:39,884 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:52:39,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:52:39,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:52:39,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:52:39,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:52:39" (1/1) ... [2019-12-18 16:52:39,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4645c18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:39, skipping insertion in model container [2019-12-18 16:52:39,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:52:39" (1/1) ... [2019-12-18 16:52:39,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:52:39,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:52:40,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:52:40,491 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:52:40,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:52:40,641 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:52:40,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:40 WrapperNode [2019-12-18 16:52:40,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:52:40,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:52:40,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:52:40,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:52:40,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:40" (1/1) ... [2019-12-18 16:52:40,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:40" (1/1) ... [2019-12-18 16:52:40,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:52:40,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:52:40,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:52:40,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:52:40,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:40" (1/1) ... [2019-12-18 16:52:40,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:40" (1/1) ... [2019-12-18 16:52:40,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:40" (1/1) ... [2019-12-18 16:52:40,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:40" (1/1) ... [2019-12-18 16:52:40,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:40" (1/1) ... [2019-12-18 16:52:40,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:40" (1/1) ... [2019-12-18 16:52:40,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:40" (1/1) ... [2019-12-18 16:52:40,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:52:40,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:52:40,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:52:40,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:52:40,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:52:40,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:52:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:52:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:52:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:52:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:52:40,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:52:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:52:40,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:52:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:52:40,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:52:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:52:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:52:40,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:52:40,811 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:52:41,603 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:52:41,604 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:52:41,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:52:41 BoogieIcfgContainer [2019-12-18 16:52:41,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:52:41,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:52:41,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:52:41,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:52:41,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:52:39" (1/3) ... [2019-12-18 16:52:41,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1011bbb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:52:41, skipping insertion in model container [2019-12-18 16:52:41,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:40" (2/3) ... [2019-12-18 16:52:41,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1011bbb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:52:41, skipping insertion in model container [2019-12-18 16:52:41,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:52:41" (3/3) ... [2019-12-18 16:52:41,618 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_tso.opt.i [2019-12-18 16:52:41,629 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:52:41,629 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:52:41,638 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:52:41,639 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:52:41,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,690 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,692 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,692 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,701 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,701 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,731 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,731 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,779 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,781 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,789 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,790 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,790 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,792 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,792 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:41,813 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:52:41,835 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:52:41,835 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:52:41,835 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:52:41,835 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:52:41,836 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:52:41,836 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:52:41,836 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:52:41,836 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:52:41,857 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 16:52:41,859 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 16:52:41,983 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 16:52:41,984 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:52:42,007 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:52:42,034 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 16:52:42,122 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 16:52:42,122 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:52:42,133 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:52:42,157 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 16:52:42,158 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:52:47,434 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 16:52:47,572 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 16:52:47,833 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-18 16:52:47,833 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 16:52:47,837 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-18 16:53:08,335 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-18 16:53:08,337 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-18 16:53:08,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 16:53:08,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:08,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 16:53:08,343 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:08,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:08,348 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-18 16:53:08,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:08,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915544798] [2019-12-18 16:53:08,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:08,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915544798] [2019-12-18 16:53:08,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:08,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:53:08,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110623244] [2019-12-18 16:53:08,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:53:08,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:08,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:53:08,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:53:08,600 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-18 16:53:09,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:09,712 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-18 16:53:09,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:53:09,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 16:53:09,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:13,859 INFO L225 Difference]: With dead ends: 121140 [2019-12-18 16:53:13,859 INFO L226 Difference]: Without dead ends: 107958 [2019-12-18 16:53:13,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:53:18,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-18 16:53:20,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-18 16:53:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-18 16:53:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-18 16:53:21,393 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-18 16:53:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:21,394 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-18 16:53:21,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:53:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-18 16:53:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 16:53:21,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:21,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:21,399 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:21,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-18 16:53:21,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:21,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302268106] [2019-12-18 16:53:21,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:21,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302268106] [2019-12-18 16:53:21,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:21,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:53:21,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832649829] [2019-12-18 16:53:21,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:53:21,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:21,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:53:21,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:53:21,504 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-18 16:53:27,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:27,407 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-18 16:53:27,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:53:27,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 16:53:27,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:27,979 INFO L225 Difference]: With dead ends: 172022 [2019-12-18 16:53:27,980 INFO L226 Difference]: Without dead ends: 171924 [2019-12-18 16:53:27,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:53:33,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-18 16:53:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-18 16:53:38,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-18 16:53:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-18 16:53:39,275 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-18 16:53:39,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:39,275 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-18 16:53:39,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:53:39,276 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-18 16:53:39,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:53:39,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:39,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:39,282 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:39,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:39,283 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-18 16:53:39,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:39,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558262730] [2019-12-18 16:53:39,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:39,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558262730] [2019-12-18 16:53:39,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:39,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:53:39,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181084178] [2019-12-18 16:53:39,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:53:39,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:39,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:53:39,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:53:39,340 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-18 16:53:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:39,485 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-18 16:53:39,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:53:39,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 16:53:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:39,574 INFO L225 Difference]: With dead ends: 33388 [2019-12-18 16:53:39,574 INFO L226 Difference]: Without dead ends: 33388 [2019-12-18 16:53:39,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:53:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-18 16:53:44,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-18 16:53:44,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-18 16:53:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-18 16:53:44,936 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-18 16:53:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:44,936 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-18 16:53:44,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:53:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-18 16:53:44,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:53:44,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:44,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:44,940 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:44,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:44,940 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-18 16:53:44,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:44,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497992696] [2019-12-18 16:53:44,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:45,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-18 16:53:45,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497992696] [2019-12-18 16:53:45,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:45,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:53:45,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363372490] [2019-12-18 16:53:45,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:53:45,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:45,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:53:45,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:53:45,024 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-18 16:53:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:45,267 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-18 16:53:45,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:53:45,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 16:53:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:45,378 INFO L225 Difference]: With dead ends: 52822 [2019-12-18 16:53:45,378 INFO L226 Difference]: Without dead ends: 52822 [2019-12-18 16:53:45,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:53:45,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-18 16:53:46,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-18 16:53:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-18 16:53:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-18 16:53:46,253 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-18 16:53:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:46,255 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-18 16:53:46,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:53:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-18 16:53:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:53:46,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:46,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:46,258 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:46,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:46,259 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-18 16:53:46,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:46,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106551693] [2019-12-18 16:53:46,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:46,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106551693] [2019-12-18 16:53:46,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:46,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:53:46,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354356947] [2019-12-18 16:53:46,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:53:46,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:46,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:53:46,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:53:46,326 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-18 16:53:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:46,738 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-18 16:53:46,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:53:46,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:53:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:46,809 INFO L225 Difference]: With dead ends: 46903 [2019-12-18 16:53:46,809 INFO L226 Difference]: Without dead ends: 46903 [2019-12-18 16:53:46,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:53:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-18 16:53:47,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-18 16:53:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-18 16:53:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-18 16:53:48,097 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-18 16:53:48,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:48,097 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-18 16:53:48,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:53:48,097 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-18 16:53:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:53:48,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:48,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:48,101 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:48,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:48,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-18 16:53:48,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:48,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268132756] [2019-12-18 16:53:48,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:48,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268132756] [2019-12-18 16:53:48,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:48,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:53:48,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845025408] [2019-12-18 16:53:48,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:53:48,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:48,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:53:48,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:53:48,162 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-18 16:53:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:48,517 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-18 16:53:48,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:53:48,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:53:48,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:48,610 INFO L225 Difference]: With dead ends: 51478 [2019-12-18 16:53:48,610 INFO L226 Difference]: Without dead ends: 51478 [2019-12-18 16:53:48,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:53:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-18 16:53:49,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-18 16:53:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-18 16:53:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-18 16:53:49,413 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-18 16:53:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:49,413 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-18 16:53:49,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:53:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-18 16:53:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:53:49,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:49,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] [2019-12-18 16:53:49,423 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:49,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:49,423 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-18 16:53:49,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:49,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988084253] [2019-12-18 16:53:49,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:49,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988084253] [2019-12-18 16:53:49,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:49,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:53:49,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908865537] [2019-12-18 16:53:49,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:53:49,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:49,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:53:49,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:53:49,495 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-18 16:53:50,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:50,162 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-18 16:53:50,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:53:50,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:53:50,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:50,705 INFO L225 Difference]: With dead ends: 61264 [2019-12-18 16:53:50,705 INFO L226 Difference]: Without dead ends: 61250 [2019-12-18 16:53:50,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:53:50,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-18 16:53:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-18 16:53:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-18 16:53:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-18 16:53:51,553 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-18 16:53:51,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:51,553 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-18 16:53:51,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:53:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-18 16:53:51,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:53:51,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:51,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:51,563 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:51,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:51,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-18 16:53:51,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:51,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637365414] [2019-12-18 16:53:51,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:51,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-18 16:53:51,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637365414] [2019-12-18 16:53:51,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:51,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:53:51,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291885786] [2019-12-18 16:53:51,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:53:51,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:51,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:53:51,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:53:51,645 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-18 16:53:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:52,304 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-18 16:53:52,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:53:52,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:53:52,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:52,411 INFO L225 Difference]: With dead ends: 63752 [2019-12-18 16:53:52,412 INFO L226 Difference]: Without dead ends: 63738 [2019-12-18 16:53:52,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:53:52,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-18 16:53:53,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-18 16:53:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-18 16:53:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-18 16:53:53,938 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-18 16:53:53,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:53,939 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-18 16:53:53,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:53:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-18 16:53:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:53:53,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:53,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:53,951 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:53,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:53,951 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-18 16:53:53,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:53,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422463173] [2019-12-18 16:53:53,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:54,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422463173] [2019-12-18 16:53:54,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:54,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:53:54,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676428292] [2019-12-18 16:53:54,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:53:54,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:54,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:53:54,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:53:54,008 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-18 16:53:54,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:54,093 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-18 16:53:54,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:53:54,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:53:54,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:54,129 INFO L225 Difference]: With dead ends: 17193 [2019-12-18 16:53:54,129 INFO L226 Difference]: Without dead ends: 17193 [2019-12-18 16:53:54,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:53:54,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-18 16:53:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-18 16:53:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-18 16:53:54,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-18 16:53:54,439 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-18 16:53:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:54,440 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-18 16:53:54,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:53:54,440 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-18 16:53:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 16:53:54,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:54,452 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] [2019-12-18 16:53:54,452 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:54,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:54,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-18 16:53:54,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:54,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858609734] [2019-12-18 16:53:54,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:54,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858609734] [2019-12-18 16:53:54,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:54,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:53:54,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772926586] [2019-12-18 16:53:54,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:53:54,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:54,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:53:54,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:53:54,560 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-18 16:53:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:54,933 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-18 16:53:54,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:53:54,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 16:53:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:54,965 INFO L225 Difference]: With dead ends: 21613 [2019-12-18 16:53:54,965 INFO L226 Difference]: Without dead ends: 21613 [2019-12-18 16:53:54,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:53:55,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-18 16:53:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-18 16:53:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-18 16:53:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-18 16:53:55,269 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-18 16:53:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:55,269 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-18 16:53:55,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:53:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-18 16:53:55,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:53:55,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:55,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:55,284 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:55,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:55,284 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-18 16:53:55,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:55,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165219470] [2019-12-18 16:53:55,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:55,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165219470] [2019-12-18 16:53:55,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:55,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:53:55,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759367108] [2019-12-18 16:53:55,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:53:55,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:55,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:53:55,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:53:55,361 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-18 16:53:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:55,748 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-18 16:53:55,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:53:55,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 16:53:55,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:55,783 INFO L225 Difference]: With dead ends: 23624 [2019-12-18 16:53:55,783 INFO L226 Difference]: Without dead ends: 23624 [2019-12-18 16:53:55,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:53:55,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-18 16:53:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-18 16:53:56,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-18 16:53:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-18 16:53:56,082 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-18 16:53:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:56,082 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-18 16:53:56,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:53:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-18 16:53:56,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 16:53:56,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:56,102 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] [2019-12-18 16:53:56,102 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:56,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:56,103 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-18 16:53:56,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:56,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841245003] [2019-12-18 16:53:56,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:56,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841245003] [2019-12-18 16:53:56,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:56,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:53:56,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778994004] [2019-12-18 16:53:56,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:53:56,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:56,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:53:56,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:53:56,182 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-18 16:53:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:56,943 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-18 16:53:56,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:53:56,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 16:53:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:56,998 INFO L225 Difference]: With dead ends: 27031 [2019-12-18 16:53:56,998 INFO L226 Difference]: Without dead ends: 27031 [2019-12-18 16:53:56,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:53:57,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-18 16:53:57,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-18 16:53:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-18 16:53:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-18 16:53:57,360 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-18 16:53:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:57,360 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-18 16:53:57,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:53:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-18 16:53:57,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 16:53:57,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:57,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:57,672 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:57,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:57,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-18 16:53:57,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:57,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245144263] [2019-12-18 16:53:57,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:57,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245144263] [2019-12-18 16:53:57,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:57,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:53:57,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059377912] [2019-12-18 16:53:57,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:53:57,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:57,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:53:57,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:53:57,756 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-18 16:53:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:58,431 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-18 16:53:58,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:53:58,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 16:53:58,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:58,469 INFO L225 Difference]: With dead ends: 26334 [2019-12-18 16:53:58,469 INFO L226 Difference]: Without dead ends: 26334 [2019-12-18 16:53:58,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:53:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-18 16:53:58,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-18 16:53:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-18 16:53:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-18 16:53:58,781 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-18 16:53:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:58,782 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-18 16:53:58,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:53:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-18 16:53:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:53:58,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:58,800 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:58,800 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:58,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-18 16:53:58,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:58,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159314650] [2019-12-18 16:53:58,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:58,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159314650] [2019-12-18 16:53:58,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:58,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:53:58,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707141733] [2019-12-18 16:53:58,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:53:58,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:58,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:53:58,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:53:58,867 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-18 16:53:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:58,940 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-18 16:53:58,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:53:58,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 16:53:58,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:58,976 INFO L225 Difference]: With dead ends: 17641 [2019-12-18 16:53:58,977 INFO L226 Difference]: Without dead ends: 17641 [2019-12-18 16:53:58,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:53:59,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-18 16:53:59,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-18 16:53:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-18 16:53:59,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-18 16:53:59,379 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-18 16:53:59,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:59,381 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-18 16:53:59,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:53:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-18 16:53:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:53:59,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:59,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:59,415 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:59,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:59,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-18 16:53:59,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:59,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107327533] [2019-12-18 16:53:59,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:59,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:59,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107327533] [2019-12-18 16:53:59,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:59,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:53:59,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759824947] [2019-12-18 16:53:59,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:53:59,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:59,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:53:59,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:53:59,531 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-18 16:54:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:00,129 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-18 16:54:00,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:54:00,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:54:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:00,176 INFO L225 Difference]: With dead ends: 25346 [2019-12-18 16:54:00,177 INFO L226 Difference]: Without dead ends: 25346 [2019-12-18 16:54:00,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:54:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-18 16:54:00,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-18 16:54:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-18 16:54:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-18 16:54:00,537 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-18 16:54:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:00,537 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-18 16:54:00,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:54:00,537 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-18 16:54:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:54:00,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:00,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:00,568 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:00,568 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-18 16:54:00,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:00,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289680539] [2019-12-18 16:54:00,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:00,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289680539] [2019-12-18 16:54:00,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:00,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:54:00,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404840384] [2019-12-18 16:54:00,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:54:00,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:00,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:54:00,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:54:00,631 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-18 16:54:00,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:00,742 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-18 16:54:00,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:54:00,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:54:00,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:00,783 INFO L225 Difference]: With dead ends: 22175 [2019-12-18 16:54:00,784 INFO L226 Difference]: Without dead ends: 22175 [2019-12-18 16:54:00,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:54:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-18 16:54:01,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-18 16:54:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-18 16:54:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-18 16:54:01,138 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-18 16:54:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:01,138 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-18 16:54:01,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:54:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-18 16:54:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:54:01,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:01,167 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] [2019-12-18 16:54:01,168 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:01,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:01,168 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-18 16:54:01,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:01,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814300711] [2019-12-18 16:54:01,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:01,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814300711] [2019-12-18 16:54:01,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:01,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:54:01,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72375265] [2019-12-18 16:54:01,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:54:01,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:01,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:54:01,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:54:01,582 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-18 16:54:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:02,253 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-18 16:54:02,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 16:54:02,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:54:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:02,331 INFO L225 Difference]: With dead ends: 62478 [2019-12-18 16:54:02,331 INFO L226 Difference]: Without dead ends: 47634 [2019-12-18 16:54:02,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:54:02,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-18 16:54:02,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-18 16:54:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-18 16:54:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-18 16:54:02,897 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-18 16:54:02,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:02,897 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-18 16:54:02,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:54:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-18 16:54:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:54:02,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:02,927 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] [2019-12-18 16:54:02,927 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:02,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:02,928 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-18 16:54:02,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:02,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645365471] [2019-12-18 16:54:02,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:03,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-18 16:54:03,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645365471] [2019-12-18 16:54:03,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:03,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:54:03,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601988354] [2019-12-18 16:54:03,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:54:03,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:03,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:54:03,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:54:03,024 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-18 16:54:03,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:03,572 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-18 16:54:03,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:54:03,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:54:03,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:03,646 INFO L225 Difference]: With dead ends: 68433 [2019-12-18 16:54:03,646 INFO L226 Difference]: Without dead ends: 48478 [2019-12-18 16:54:03,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:54:03,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-18 16:54:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-18 16:54:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-18 16:54:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-18 16:54:04,247 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-18 16:54:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:04,248 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-18 16:54:04,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:54:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-18 16:54:04,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:54:04,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:04,280 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] [2019-12-18 16:54:04,280 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:04,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:04,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-18 16:54:04,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:04,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783265708] [2019-12-18 16:54:04,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:04,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783265708] [2019-12-18 16:54:04,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:04,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:54:04,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392930849] [2019-12-18 16:54:04,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:54:04,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:04,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:54:04,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:54:04,360 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-18 16:54:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:04,903 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-18 16:54:04,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:54:04,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:54:04,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:05,376 INFO L225 Difference]: With dead ends: 59843 [2019-12-18 16:54:05,376 INFO L226 Difference]: Without dead ends: 52762 [2019-12-18 16:54:05,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:54:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-18 16:54:05,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-18 16:54:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-18 16:54:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-18 16:54:05,967 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-18 16:54:05,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:05,968 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-18 16:54:05,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:54:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-18 16:54:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:54:05,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:05,999 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] [2019-12-18 16:54:05,999 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:05,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-18 16:54:05,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:06,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705354567] [2019-12-18 16:54:06,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:06,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705354567] [2019-12-18 16:54:06,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:06,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:54:06,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524525469] [2019-12-18 16:54:06,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:54:06,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:06,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:54:06,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:54:06,098 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 7 states. [2019-12-18 16:54:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:07,194 INFO L93 Difference]: Finished difference Result 38094 states and 116230 transitions. [2019-12-18 16:54:07,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 16:54:07,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:54:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:07,248 INFO L225 Difference]: With dead ends: 38094 [2019-12-18 16:54:07,248 INFO L226 Difference]: Without dead ends: 37870 [2019-12-18 16:54:07,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:54:07,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37870 states. [2019-12-18 16:54:07,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37870 to 31894. [2019-12-18 16:54:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31894 states. [2019-12-18 16:54:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31894 states to 31894 states and 98893 transitions. [2019-12-18 16:54:07,802 INFO L78 Accepts]: Start accepts. Automaton has 31894 states and 98893 transitions. Word has length 63 [2019-12-18 16:54:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:07,802 INFO L462 AbstractCegarLoop]: Abstraction has 31894 states and 98893 transitions. [2019-12-18 16:54:07,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:54:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 31894 states and 98893 transitions. [2019-12-18 16:54:07,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:54:07,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:07,839 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] [2019-12-18 16:54:07,839 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:07,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:07,839 INFO L82 PathProgramCache]: Analyzing trace with hash 232911163, now seen corresponding path program 5 times [2019-12-18 16:54:07,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:07,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298379336] [2019-12-18 16:54:07,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:07,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298379336] [2019-12-18 16:54:07,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:07,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:54:07,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480294919] [2019-12-18 16:54:07,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:54:07,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:07,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:54:07,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:54:07,952 INFO L87 Difference]: Start difference. First operand 31894 states and 98893 transitions. Second operand 7 states. [2019-12-18 16:54:09,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:09,637 INFO L93 Difference]: Finished difference Result 54976 states and 166682 transitions. [2019-12-18 16:54:09,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 16:54:09,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:54:09,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:09,720 INFO L225 Difference]: With dead ends: 54976 [2019-12-18 16:54:09,720 INFO L226 Difference]: Without dead ends: 54653 [2019-12-18 16:54:09,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:54:10,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54653 states. [2019-12-18 16:54:10,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54653 to 34658. [2019-12-18 16:54:10,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34658 states. [2019-12-18 16:54:10,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34658 states to 34658 states and 107721 transitions. [2019-12-18 16:54:10,685 INFO L78 Accepts]: Start accepts. Automaton has 34658 states and 107721 transitions. Word has length 63 [2019-12-18 16:54:10,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:10,685 INFO L462 AbstractCegarLoop]: Abstraction has 34658 states and 107721 transitions. [2019-12-18 16:54:10,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:54:10,685 INFO L276 IsEmpty]: Start isEmpty. Operand 34658 states and 107721 transitions. [2019-12-18 16:54:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:54:10,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:10,723 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] [2019-12-18 16:54:10,724 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:10,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:10,724 INFO L82 PathProgramCache]: Analyzing trace with hash 908177687, now seen corresponding path program 6 times [2019-12-18 16:54:10,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:10,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845864462] [2019-12-18 16:54:10,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:10,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845864462] [2019-12-18 16:54:10,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:10,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:54:10,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184684932] [2019-12-18 16:54:10,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:54:10,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:10,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:54:10,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:54:10,846 INFO L87 Difference]: Start difference. First operand 34658 states and 107721 transitions. Second operand 7 states. [2019-12-18 16:54:11,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:11,886 INFO L93 Difference]: Finished difference Result 57288 states and 175480 transitions. [2019-12-18 16:54:11,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:54:11,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:54:11,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:11,983 INFO L225 Difference]: With dead ends: 57288 [2019-12-18 16:54:11,983 INFO L226 Difference]: Without dead ends: 57068 [2019-12-18 16:54:11,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:54:12,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57068 states. [2019-12-18 16:54:12,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57068 to 40390. [2019-12-18 16:54:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40390 states. [2019-12-18 16:54:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40390 states to 40390 states and 125252 transitions. [2019-12-18 16:54:12,746 INFO L78 Accepts]: Start accepts. Automaton has 40390 states and 125252 transitions. Word has length 63 [2019-12-18 16:54:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:12,747 INFO L462 AbstractCegarLoop]: Abstraction has 40390 states and 125252 transitions. [2019-12-18 16:54:12,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:54:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 40390 states and 125252 transitions. [2019-12-18 16:54:12,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:54:12,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:12,790 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] [2019-12-18 16:54:12,790 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:12,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:12,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1577046585, now seen corresponding path program 7 times [2019-12-18 16:54:12,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:12,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417650332] [2019-12-18 16:54:12,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:12,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417650332] [2019-12-18 16:54:12,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:12,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:54:12,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893426559] [2019-12-18 16:54:12,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:54:12,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:12,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:54:12,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:54:12,896 INFO L87 Difference]: Start difference. First operand 40390 states and 125252 transitions. Second operand 8 states. [2019-12-18 16:54:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:14,207 INFO L93 Difference]: Finished difference Result 60008 states and 183321 transitions. [2019-12-18 16:54:14,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 16:54:14,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 16:54:14,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:14,296 INFO L225 Difference]: With dead ends: 60008 [2019-12-18 16:54:14,296 INFO L226 Difference]: Without dead ends: 59756 [2019-12-18 16:54:14,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-18 16:54:14,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59756 states. [2019-12-18 16:54:15,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59756 to 40339. [2019-12-18 16:54:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40339 states. [2019-12-18 16:54:15,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40339 states to 40339 states and 125109 transitions. [2019-12-18 16:54:15,427 INFO L78 Accepts]: Start accepts. Automaton has 40339 states and 125109 transitions. Word has length 63 [2019-12-18 16:54:15,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:15,427 INFO L462 AbstractCegarLoop]: Abstraction has 40339 states and 125109 transitions. [2019-12-18 16:54:15,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:54:15,427 INFO L276 IsEmpty]: Start isEmpty. Operand 40339 states and 125109 transitions. [2019-12-18 16:54:15,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:54:15,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:15,472 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] [2019-12-18 16:54:15,472 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:15,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:15,472 INFO L82 PathProgramCache]: Analyzing trace with hash 593914995, now seen corresponding path program 8 times [2019-12-18 16:54:15,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:15,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41915141] [2019-12-18 16:54:15,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:15,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41915141] [2019-12-18 16:54:15,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:15,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:54:15,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766934286] [2019-12-18 16:54:15,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:54:15,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:15,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:54:15,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:54:15,577 INFO L87 Difference]: Start difference. First operand 40339 states and 125109 transitions. Second operand 8 states. [2019-12-18 16:54:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:17,443 INFO L93 Difference]: Finished difference Result 58458 states and 177165 transitions. [2019-12-18 16:54:17,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:54:17,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 16:54:17,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:17,529 INFO L225 Difference]: With dead ends: 58458 [2019-12-18 16:54:17,530 INFO L226 Difference]: Without dead ends: 58458 [2019-12-18 16:54:17,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2019-12-18 16:54:17,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58458 states. [2019-12-18 16:54:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58458 to 39692. [2019-12-18 16:54:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39692 states. [2019-12-18 16:54:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39692 states to 39692 states and 123217 transitions. [2019-12-18 16:54:18,315 INFO L78 Accepts]: Start accepts. Automaton has 39692 states and 123217 transitions. Word has length 63 [2019-12-18 16:54:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:18,316 INFO L462 AbstractCegarLoop]: Abstraction has 39692 states and 123217 transitions. [2019-12-18 16:54:18,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:54:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 39692 states and 123217 transitions. [2019-12-18 16:54:18,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:54:18,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:18,361 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] [2019-12-18 16:54:18,361 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:18,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:18,361 INFO L82 PathProgramCache]: Analyzing trace with hash 194134925, now seen corresponding path program 9 times [2019-12-18 16:54:18,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:18,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968742195] [2019-12-18 16:54:18,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:18,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968742195] [2019-12-18 16:54:18,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:18,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:54:18,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38042686] [2019-12-18 16:54:18,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:54:18,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:18,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:54:18,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:54:18,495 INFO L87 Difference]: Start difference. First operand 39692 states and 123217 transitions. Second operand 9 states. [2019-12-18 16:54:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:19,861 INFO L93 Difference]: Finished difference Result 55159 states and 169085 transitions. [2019-12-18 16:54:19,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 16:54:19,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 16:54:19,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:19,944 INFO L225 Difference]: With dead ends: 55159 [2019-12-18 16:54:19,944 INFO L226 Difference]: Without dead ends: 55159 [2019-12-18 16:54:19,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:54:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55159 states. [2019-12-18 16:54:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55159 to 38889. [2019-12-18 16:54:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38889 states. [2019-12-18 16:54:20,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38889 states to 38889 states and 120766 transitions. [2019-12-18 16:54:20,693 INFO L78 Accepts]: Start accepts. Automaton has 38889 states and 120766 transitions. Word has length 63 [2019-12-18 16:54:20,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:20,694 INFO L462 AbstractCegarLoop]: Abstraction has 38889 states and 120766 transitions. [2019-12-18 16:54:20,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:54:20,694 INFO L276 IsEmpty]: Start isEmpty. Operand 38889 states and 120766 transitions. [2019-12-18 16:54:20,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:54:20,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:20,737 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] [2019-12-18 16:54:20,737 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:20,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:20,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1930988027, now seen corresponding path program 10 times [2019-12-18 16:54:20,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:20,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807641364] [2019-12-18 16:54:20,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:20,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807641364] [2019-12-18 16:54:20,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:20,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:54:20,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939720512] [2019-12-18 16:54:20,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:54:20,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:20,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:54:20,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:54:20,872 INFO L87 Difference]: Start difference. First operand 38889 states and 120766 transitions. Second operand 10 states. [2019-12-18 16:54:22,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:22,420 INFO L93 Difference]: Finished difference Result 56103 states and 171957 transitions. [2019-12-18 16:54:22,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:54:22,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-12-18 16:54:22,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:22,507 INFO L225 Difference]: With dead ends: 56103 [2019-12-18 16:54:22,507 INFO L226 Difference]: Without dead ends: 56103 [2019-12-18 16:54:22,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2019-12-18 16:54:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56103 states. [2019-12-18 16:54:23,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56103 to 36616. [2019-12-18 16:54:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36616 states. [2019-12-18 16:54:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36616 states to 36616 states and 113998 transitions. [2019-12-18 16:54:23,271 INFO L78 Accepts]: Start accepts. Automaton has 36616 states and 113998 transitions. Word has length 63 [2019-12-18 16:54:23,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:23,271 INFO L462 AbstractCegarLoop]: Abstraction has 36616 states and 113998 transitions. [2019-12-18 16:54:23,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:54:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 36616 states and 113998 transitions. [2019-12-18 16:54:23,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:54:23,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:23,313 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] [2019-12-18 16:54:23,313 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:23,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:23,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1638823163, now seen corresponding path program 11 times [2019-12-18 16:54:23,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:23,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836337229] [2019-12-18 16:54:23,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:23,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836337229] [2019-12-18 16:54:23,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:23,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:54:23,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321247262] [2019-12-18 16:54:23,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:54:23,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:23,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:54:23,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:54:23,411 INFO L87 Difference]: Start difference. First operand 36616 states and 113998 transitions. Second operand 7 states. [2019-12-18 16:54:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:24,544 INFO L93 Difference]: Finished difference Result 57418 states and 175676 transitions. [2019-12-18 16:54:24,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:54:24,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:54:24,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:24,629 INFO L225 Difference]: With dead ends: 57418 [2019-12-18 16:54:24,629 INFO L226 Difference]: Without dead ends: 57418 [2019-12-18 16:54:24,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:54:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57418 states. [2019-12-18 16:54:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57418 to 39035. [2019-12-18 16:54:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39035 states. [2019-12-18 16:54:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39035 states to 39035 states and 121312 transitions. [2019-12-18 16:54:25,342 INFO L78 Accepts]: Start accepts. Automaton has 39035 states and 121312 transitions. Word has length 63 [2019-12-18 16:54:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:25,342 INFO L462 AbstractCegarLoop]: Abstraction has 39035 states and 121312 transitions. [2019-12-18 16:54:25,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:54:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 39035 states and 121312 transitions. [2019-12-18 16:54:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:54:25,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:25,383 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] [2019-12-18 16:54:25,383 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:25,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:25,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1952090881, now seen corresponding path program 12 times [2019-12-18 16:54:25,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:25,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391163561] [2019-12-18 16:54:25,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:25,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391163561] [2019-12-18 16:54:25,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:25,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:54:25,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2234930] [2019-12-18 16:54:25,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:54:25,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:25,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:54:25,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:54:25,552 INFO L87 Difference]: Start difference. First operand 39035 states and 121312 transitions. Second operand 9 states. [2019-12-18 16:54:26,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:26,481 INFO L93 Difference]: Finished difference Result 57209 states and 175096 transitions. [2019-12-18 16:54:26,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:54:26,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 16:54:26,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:26,565 INFO L225 Difference]: With dead ends: 57209 [2019-12-18 16:54:26,566 INFO L226 Difference]: Without dead ends: 57209 [2019-12-18 16:54:26,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:54:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57209 states. [2019-12-18 16:54:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57209 to 37148. [2019-12-18 16:54:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37148 states. [2019-12-18 16:54:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37148 states to 37148 states and 115695 transitions. [2019-12-18 16:54:27,285 INFO L78 Accepts]: Start accepts. Automaton has 37148 states and 115695 transitions. Word has length 63 [2019-12-18 16:54:27,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:27,286 INFO L462 AbstractCegarLoop]: Abstraction has 37148 states and 115695 transitions. [2019-12-18 16:54:27,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:54:27,286 INFO L276 IsEmpty]: Start isEmpty. Operand 37148 states and 115695 transitions. [2019-12-18 16:54:27,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:54:27,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:27,324 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] [2019-12-18 16:54:27,324 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:27,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:27,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1981956519, now seen corresponding path program 13 times [2019-12-18 16:54:27,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:27,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106275517] [2019-12-18 16:54:27,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:27,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106275517] [2019-12-18 16:54:27,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:27,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:54:27,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938795278] [2019-12-18 16:54:27,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:54:27,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:27,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:54:27,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:54:27,444 INFO L87 Difference]: Start difference. First operand 37148 states and 115695 transitions. Second operand 8 states. [2019-12-18 16:54:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:29,431 INFO L93 Difference]: Finished difference Result 72816 states and 221017 transitions. [2019-12-18 16:54:29,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:54:29,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 16:54:29,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:29,538 INFO L225 Difference]: With dead ends: 72816 [2019-12-18 16:54:29,538 INFO L226 Difference]: Without dead ends: 72548 [2019-12-18 16:54:29,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-12-18 16:54:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72548 states. [2019-12-18 16:54:30,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72548 to 37598. [2019-12-18 16:54:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37598 states. [2019-12-18 16:54:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37598 states to 37598 states and 117247 transitions. [2019-12-18 16:54:30,331 INFO L78 Accepts]: Start accepts. Automaton has 37598 states and 117247 transitions. Word has length 63 [2019-12-18 16:54:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:30,331 INFO L462 AbstractCegarLoop]: Abstraction has 37598 states and 117247 transitions. [2019-12-18 16:54:30,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:54:30,331 INFO L276 IsEmpty]: Start isEmpty. Operand 37598 states and 117247 transitions. [2019-12-18 16:54:30,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:54:30,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:30,370 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] [2019-12-18 16:54:30,370 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:30,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:30,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1745238685, now seen corresponding path program 14 times [2019-12-18 16:54:30,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:30,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920511224] [2019-12-18 16:54:30,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:30,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920511224] [2019-12-18 16:54:30,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:30,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:54:30,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53424862] [2019-12-18 16:54:30,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:54:30,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:30,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:54:30,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:54:30,491 INFO L87 Difference]: Start difference. First operand 37598 states and 117247 transitions. Second operand 8 states. [2019-12-18 16:54:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:31,525 INFO L93 Difference]: Finished difference Result 52221 states and 160353 transitions. [2019-12-18 16:54:31,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:54:31,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 16:54:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:31,604 INFO L225 Difference]: With dead ends: 52221 [2019-12-18 16:54:31,604 INFO L226 Difference]: Without dead ends: 52165 [2019-12-18 16:54:31,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:54:31,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52165 states. [2019-12-18 16:54:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52165 to 37418. [2019-12-18 16:54:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37418 states. [2019-12-18 16:54:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37418 states to 37418 states and 115770 transitions. [2019-12-18 16:54:32,267 INFO L78 Accepts]: Start accepts. Automaton has 37418 states and 115770 transitions. Word has length 63 [2019-12-18 16:54:32,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:32,268 INFO L462 AbstractCegarLoop]: Abstraction has 37418 states and 115770 transitions. [2019-12-18 16:54:32,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:54:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 37418 states and 115770 transitions. [2019-12-18 16:54:32,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:54:32,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:32,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:32,306 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:32,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:32,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1876409601, now seen corresponding path program 15 times [2019-12-18 16:54:32,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:32,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951144412] [2019-12-18 16:54:32,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:32,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951144412] [2019-12-18 16:54:32,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:32,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:54:32,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499780578] [2019-12-18 16:54:32,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:54:32,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:32,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:54:32,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:54:32,363 INFO L87 Difference]: Start difference. First operand 37418 states and 115770 transitions. Second operand 3 states. [2019-12-18 16:54:32,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:32,524 INFO L93 Difference]: Finished difference Result 37417 states and 115768 transitions. [2019-12-18 16:54:32,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:54:32,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-18 16:54:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:32,615 INFO L225 Difference]: With dead ends: 37417 [2019-12-18 16:54:32,615 INFO L226 Difference]: Without dead ends: 37417 [2019-12-18 16:54:32,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:54:33,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37417 states. [2019-12-18 16:54:33,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37417 to 32016. [2019-12-18 16:54:33,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32016 states. [2019-12-18 16:54:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32016 states to 32016 states and 99859 transitions. [2019-12-18 16:54:33,837 INFO L78 Accepts]: Start accepts. Automaton has 32016 states and 99859 transitions. Word has length 63 [2019-12-18 16:54:33,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:33,837 INFO L462 AbstractCegarLoop]: Abstraction has 32016 states and 99859 transitions. [2019-12-18 16:54:33,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:54:33,837 INFO L276 IsEmpty]: Start isEmpty. Operand 32016 states and 99859 transitions. [2019-12-18 16:54:33,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:54:33,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:33,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:33,874 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:33,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:33,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2010713375, now seen corresponding path program 1 times [2019-12-18 16:54:33,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:33,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739049315] [2019-12-18 16:54:33,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:33,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:33,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739049315] [2019-12-18 16:54:33,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:33,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:54:33,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492292025] [2019-12-18 16:54:33,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:54:33,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:33,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:54:33,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:54:33,931 INFO L87 Difference]: Start difference. First operand 32016 states and 99859 transitions. Second operand 3 states. [2019-12-18 16:54:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:34,018 INFO L93 Difference]: Finished difference Result 24805 states and 76665 transitions. [2019-12-18 16:54:34,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:54:34,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:54:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:34,052 INFO L225 Difference]: With dead ends: 24805 [2019-12-18 16:54:34,052 INFO L226 Difference]: Without dead ends: 24805 [2019-12-18 16:54:34,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:54:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24805 states. [2019-12-18 16:54:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24805 to 23051. [2019-12-18 16:54:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23051 states. [2019-12-18 16:54:34,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23051 states to 23051 states and 71181 transitions. [2019-12-18 16:54:34,389 INFO L78 Accepts]: Start accepts. Automaton has 23051 states and 71181 transitions. Word has length 64 [2019-12-18 16:54:34,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:34,389 INFO L462 AbstractCegarLoop]: Abstraction has 23051 states and 71181 transitions. [2019-12-18 16:54:34,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:54:34,389 INFO L276 IsEmpty]: Start isEmpty. Operand 23051 states and 71181 transitions. [2019-12-18 16:54:34,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:54:34,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:34,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:34,412 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-18 16:54:34,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:34,412 INFO L82 PathProgramCache]: Analyzing trace with hash -668679299, now seen corresponding path program 1 times [2019-12-18 16:54:34,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:34,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787894626] [2019-12-18 16:54:34,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:34,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787894626] [2019-12-18 16:54:34,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:34,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:54:34,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688472452] [2019-12-18 16:54:34,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:54:34,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:34,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:54:34,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:54:34,488 INFO L87 Difference]: Start difference. First operand 23051 states and 71181 transitions. Second operand 6 states. [2019-12-18 16:54:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:35,508 INFO L93 Difference]: Finished difference Result 31959 states and 97303 transitions. [2019-12-18 16:54:35,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:54:35,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 16:54:35,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:35,573 INFO L225 Difference]: With dead ends: 31959 [2019-12-18 16:54:35,573 INFO L226 Difference]: Without dead ends: 31959 [2019-12-18 16:54:35,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:54:35,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31959 states. [2019-12-18 16:54:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31959 to 24235. [2019-12-18 16:54:35,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24235 states. [2019-12-18 16:54:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24235 states to 24235 states and 74721 transitions. [2019-12-18 16:54:36,000 INFO L78 Accepts]: Start accepts. Automaton has 24235 states and 74721 transitions. Word has length 65 [2019-12-18 16:54:36,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:36,000 INFO L462 AbstractCegarLoop]: Abstraction has 24235 states and 74721 transitions. [2019-12-18 16:54:36,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:54:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 24235 states and 74721 transitions. [2019-12-18 16:54:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:54:36,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:36,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:36,025 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-18 16:54:36,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:36,025 INFO L82 PathProgramCache]: Analyzing trace with hash 339295601, now seen corresponding path program 2 times [2019-12-18 16:54:36,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:36,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094098247] [2019-12-18 16:54:36,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:36,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094098247] [2019-12-18 16:54:36,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:36,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:54:36,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866436509] [2019-12-18 16:54:36,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:54:36,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:36,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:54:36,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:54:36,133 INFO L87 Difference]: Start difference. First operand 24235 states and 74721 transitions. Second operand 7 states. [2019-12-18 16:54:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:37,656 INFO L93 Difference]: Finished difference Result 32735 states and 99302 transitions. [2019-12-18 16:54:37,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 16:54:37,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 16:54:37,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:37,703 INFO L225 Difference]: With dead ends: 32735 [2019-12-18 16:54:37,703 INFO L226 Difference]: Without dead ends: 32735 [2019-12-18 16:54:37,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-18 16:54:37,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32735 states. [2019-12-18 16:54:38,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32735 to 23590. [2019-12-18 16:54:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23590 states. [2019-12-18 16:54:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23590 states to 23590 states and 72809 transitions. [2019-12-18 16:54:38,433 INFO L78 Accepts]: Start accepts. Automaton has 23590 states and 72809 transitions. Word has length 65 [2019-12-18 16:54:38,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:38,433 INFO L462 AbstractCegarLoop]: Abstraction has 23590 states and 72809 transitions. [2019-12-18 16:54:38,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:54:38,433 INFO L276 IsEmpty]: Start isEmpty. Operand 23590 states and 72809 transitions. [2019-12-18 16:54:38,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:54:38,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:38,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:38,462 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-18 16:54:38,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:38,463 INFO L82 PathProgramCache]: Analyzing trace with hash 903189921, now seen corresponding path program 3 times [2019-12-18 16:54:38,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:38,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877024373] [2019-12-18 16:54:38,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:38,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877024373] [2019-12-18 16:54:38,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:38,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:54:38,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20499125] [2019-12-18 16:54:38,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:54:38,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:38,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:54:38,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:54:38,712 INFO L87 Difference]: Start difference. First operand 23590 states and 72809 transitions. Second operand 11 states. [2019-12-18 16:54:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:40,078 INFO L93 Difference]: Finished difference Result 33991 states and 104292 transitions. [2019-12-18 16:54:40,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 16:54:40,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 16:54:40,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:40,122 INFO L225 Difference]: With dead ends: 33991 [2019-12-18 16:54:40,122 INFO L226 Difference]: Without dead ends: 27865 [2019-12-18 16:54:40,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-12-18 16:54:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27865 states. [2019-12-18 16:54:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27865 to 23901. [2019-12-18 16:54:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23901 states. [2019-12-18 16:54:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23901 states to 23901 states and 73604 transitions. [2019-12-18 16:54:40,507 INFO L78 Accepts]: Start accepts. Automaton has 23901 states and 73604 transitions. Word has length 65 [2019-12-18 16:54:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:40,507 INFO L462 AbstractCegarLoop]: Abstraction has 23901 states and 73604 transitions. [2019-12-18 16:54:40,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:54:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 23901 states and 73604 transitions. [2019-12-18 16:54:40,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:54:40,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:40,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:40,536 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-18 16:54:40,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:40,536 INFO L82 PathProgramCache]: Analyzing trace with hash 416369971, now seen corresponding path program 4 times [2019-12-18 16:54:40,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:40,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333462355] [2019-12-18 16:54:40,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:40,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333462355] [2019-12-18 16:54:40,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:40,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:54:40,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249574143] [2019-12-18 16:54:40,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:54:40,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:40,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:54:40,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:54:40,739 INFO L87 Difference]: Start difference. First operand 23901 states and 73604 transitions. Second operand 11 states. [2019-12-18 16:54:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:42,148 INFO L93 Difference]: Finished difference Result 33795 states and 102769 transitions. [2019-12-18 16:54:42,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 16:54:42,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 16:54:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:42,190 INFO L225 Difference]: With dead ends: 33795 [2019-12-18 16:54:42,190 INFO L226 Difference]: Without dead ends: 29373 [2019-12-18 16:54:42,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:54:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29373 states. [2019-12-18 16:54:42,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29373 to 24075. [2019-12-18 16:54:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24075 states. [2019-12-18 16:54:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24075 states to 24075 states and 73835 transitions. [2019-12-18 16:54:42,581 INFO L78 Accepts]: Start accepts. Automaton has 24075 states and 73835 transitions. Word has length 65 [2019-12-18 16:54:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:42,583 INFO L462 AbstractCegarLoop]: Abstraction has 24075 states and 73835 transitions. [2019-12-18 16:54:42,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:54:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 24075 states and 73835 transitions. [2019-12-18 16:54:42,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:54:42,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:42,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:42,610 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-18 16:54:42,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:42,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1050757295, now seen corresponding path program 5 times [2019-12-18 16:54:42,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:42,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764325518] [2019-12-18 16:54:42,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:42,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764325518] [2019-12-18 16:54:42,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:42,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 16:54:42,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420103522] [2019-12-18 16:54:42,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 16:54:42,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:42,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 16:54:42,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:54:42,958 INFO L87 Difference]: Start difference. First operand 24075 states and 73835 transitions. Second operand 15 states. [2019-12-18 16:54:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:47,886 INFO L93 Difference]: Finished difference Result 56869 states and 172272 transitions. [2019-12-18 16:54:47,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 16:54:47,887 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-12-18 16:54:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:47,959 INFO L225 Difference]: With dead ends: 56869 [2019-12-18 16:54:47,959 INFO L226 Difference]: Without dead ends: 53961 [2019-12-18 16:54:47,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=562, Invalid=3220, Unknown=0, NotChecked=0, Total=3782 [2019-12-18 16:54:48,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53961 states. [2019-12-18 16:54:48,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53961 to 28028. [2019-12-18 16:54:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28028 states. [2019-12-18 16:54:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28028 states to 28028 states and 85429 transitions. [2019-12-18 16:54:48,563 INFO L78 Accepts]: Start accepts. Automaton has 28028 states and 85429 transitions. Word has length 65 [2019-12-18 16:54:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:48,564 INFO L462 AbstractCegarLoop]: Abstraction has 28028 states and 85429 transitions. [2019-12-18 16:54:48,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 16:54:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 28028 states and 85429 transitions. [2019-12-18 16:54:48,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:54:48,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:48,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:48,595 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-18 16:54:48,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:48,596 INFO L82 PathProgramCache]: Analyzing trace with hash -330874671, now seen corresponding path program 6 times [2019-12-18 16:54:48,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:48,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720956672] [2019-12-18 16:54:48,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:48,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:48,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720956672] [2019-12-18 16:54:48,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:48,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 16:54:48,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107289820] [2019-12-18 16:54:48,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 16:54:48,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:48,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 16:54:48,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:54:48,976 INFO L87 Difference]: Start difference. First operand 28028 states and 85429 transitions. Second operand 15 states. [2019-12-18 16:54:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:53,244 INFO L93 Difference]: Finished difference Result 54536 states and 163805 transitions. [2019-12-18 16:54:53,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 16:54:53,245 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-12-18 16:54:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:53,311 INFO L225 Difference]: With dead ends: 54536 [2019-12-18 16:54:53,311 INFO L226 Difference]: Without dead ends: 45198 [2019-12-18 16:54:53,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=476, Invalid=2176, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 16:54:53,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45198 states. [2019-12-18 16:54:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45198 to 23967. [2019-12-18 16:54:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23967 states. [2019-12-18 16:54:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23967 states to 23967 states and 73405 transitions. [2019-12-18 16:54:53,817 INFO L78 Accepts]: Start accepts. Automaton has 23967 states and 73405 transitions. Word has length 65 [2019-12-18 16:54:53,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:53,817 INFO L462 AbstractCegarLoop]: Abstraction has 23967 states and 73405 transitions. [2019-12-18 16:54:53,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 16:54:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 23967 states and 73405 transitions. [2019-12-18 16:54:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:54:53,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:53,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:53,842 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-18 16:54:53,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:53,842 INFO L82 PathProgramCache]: Analyzing trace with hash 899441441, now seen corresponding path program 7 times [2019-12-18 16:54:53,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:53,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308161633] [2019-12-18 16:54:53,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:54,378 WARN L192 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 7 [2019-12-18 16:54:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:54,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308161633] [2019-12-18 16:54:54,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:54,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:54:54,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790433849] [2019-12-18 16:54:54,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:54:54,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:54,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:54:54,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:54:54,412 INFO L87 Difference]: Start difference. First operand 23967 states and 73405 transitions. Second operand 11 states. [2019-12-18 16:54:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:55,727 INFO L93 Difference]: Finished difference Result 32998 states and 100439 transitions. [2019-12-18 16:54:55,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 16:54:55,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 16:54:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:55,767 INFO L225 Difference]: With dead ends: 32998 [2019-12-18 16:54:55,767 INFO L226 Difference]: Without dead ends: 27849 [2019-12-18 16:54:55,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-18 16:54:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27849 states. [2019-12-18 16:54:56,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27849 to 24087. [2019-12-18 16:54:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24087 states. [2019-12-18 16:54:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24087 states to 24087 states and 73755 transitions. [2019-12-18 16:54:56,148 INFO L78 Accepts]: Start accepts. Automaton has 24087 states and 73755 transitions. Word has length 65 [2019-12-18 16:54:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:56,149 INFO L462 AbstractCegarLoop]: Abstraction has 24087 states and 73755 transitions. [2019-12-18 16:54:56,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:54:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 24087 states and 73755 transitions. [2019-12-18 16:54:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:54:56,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:56,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:56,177 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-18 16:54:56,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:56,177 INFO L82 PathProgramCache]: Analyzing trace with hash -131369463, now seen corresponding path program 8 times [2019-12-18 16:54:56,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:56,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090003472] [2019-12-18 16:54:56,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:56,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090003472] [2019-12-18 16:54:56,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:56,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:54:56,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981903695] [2019-12-18 16:54:56,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:54:56,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:56,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:54:56,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:54:56,372 INFO L87 Difference]: Start difference. First operand 24087 states and 73755 transitions. Second operand 12 states. [2019-12-18 16:54:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:57,810 INFO L93 Difference]: Finished difference Result 31443 states and 95405 transitions. [2019-12-18 16:54:57,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 16:54:57,810 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-18 16:54:57,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:57,849 INFO L225 Difference]: With dead ends: 31443 [2019-12-18 16:54:57,850 INFO L226 Difference]: Without dead ends: 27377 [2019-12-18 16:54:57,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:54:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27377 states. [2019-12-18 16:54:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27377 to 23967. [2019-12-18 16:54:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23967 states. [2019-12-18 16:54:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23967 states to 23967 states and 73397 transitions. [2019-12-18 16:54:58,211 INFO L78 Accepts]: Start accepts. Automaton has 23967 states and 73397 transitions. Word has length 65 [2019-12-18 16:54:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:58,211 INFO L462 AbstractCegarLoop]: Abstraction has 23967 states and 73397 transitions. [2019-12-18 16:54:58,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:54:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 23967 states and 73397 transitions. [2019-12-18 16:54:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:54:58,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:58,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:58,239 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:58,240 INFO L82 PathProgramCache]: Analyzing trace with hash 979273527, now seen corresponding path program 9 times [2019-12-18 16:54:58,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:58,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896745970] [2019-12-18 16:54:58,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:58,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896745970] [2019-12-18 16:54:58,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:58,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 16:54:58,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083559540] [2019-12-18 16:54:58,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 16:54:58,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:58,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 16:54:58,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 16:54:58,613 INFO L87 Difference]: Start difference. First operand 23967 states and 73397 transitions. Second operand 16 states. [2019-12-18 16:55:03,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:03,402 INFO L93 Difference]: Finished difference Result 49070 states and 148769 transitions. [2019-12-18 16:55:03,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 16:55:03,402 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2019-12-18 16:55:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:03,791 INFO L225 Difference]: With dead ends: 49070 [2019-12-18 16:55:03,791 INFO L226 Difference]: Without dead ends: 47757 [2019-12-18 16:55:03,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=490, Invalid=2702, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 16:55:03,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47757 states. [2019-12-18 16:55:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47757 to 26937. [2019-12-18 16:55:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26937 states. [2019-12-18 16:55:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26937 states to 26937 states and 82044 transitions. [2019-12-18 16:55:04,330 INFO L78 Accepts]: Start accepts. Automaton has 26937 states and 82044 transitions. Word has length 65 [2019-12-18 16:55:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:04,330 INFO L462 AbstractCegarLoop]: Abstraction has 26937 states and 82044 transitions. [2019-12-18 16:55:04,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 16:55:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand 26937 states and 82044 transitions. [2019-12-18 16:55:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:55:04,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:04,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:04,358 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:04,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:04,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1699156151, now seen corresponding path program 10 times [2019-12-18 16:55:04,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:04,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618545430] [2019-12-18 16:55:04,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:04,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618545430] [2019-12-18 16:55:04,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:04,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 16:55:04,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71228306] [2019-12-18 16:55:04,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 16:55:04,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:04,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 16:55:04,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-18 16:55:04,723 INFO L87 Difference]: Start difference. First operand 26937 states and 82044 transitions. Second operand 16 states. [2019-12-18 16:55:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:09,194 INFO L93 Difference]: Finished difference Result 48323 states and 145647 transitions. [2019-12-18 16:55:09,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 16:55:09,195 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2019-12-18 16:55:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:09,256 INFO L225 Difference]: With dead ends: 48323 [2019-12-18 16:55:09,256 INFO L226 Difference]: Without dead ends: 44274 [2019-12-18 16:55:09,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=497, Invalid=2365, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 16:55:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44274 states. [2019-12-18 16:55:09,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44274 to 23727. [2019-12-18 16:55:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23727 states. [2019-12-18 16:55:09,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23727 states to 23727 states and 72693 transitions. [2019-12-18 16:55:09,762 INFO L78 Accepts]: Start accepts. Automaton has 23727 states and 72693 transitions. Word has length 65 [2019-12-18 16:55:09,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:09,762 INFO L462 AbstractCegarLoop]: Abstraction has 23727 states and 72693 transitions. [2019-12-18 16:55:09,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 16:55:09,762 INFO L276 IsEmpty]: Start isEmpty. Operand 23727 states and 72693 transitions. [2019-12-18 16:55:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:55:09,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:09,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:09,789 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:09,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:09,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1019867375, now seen corresponding path program 11 times [2019-12-18 16:55:09,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:09,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445826590] [2019-12-18 16:55:09,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:09,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445826590] [2019-12-18 16:55:09,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:09,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:55:09,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472203026] [2019-12-18 16:55:09,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:55:09,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:09,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:55:09,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:55:09,860 INFO L87 Difference]: Start difference. First operand 23727 states and 72693 transitions. Second operand 4 states. [2019-12-18 16:55:10,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:10,034 INFO L93 Difference]: Finished difference Result 28554 states and 87043 transitions. [2019-12-18 16:55:10,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:55:10,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 16:55:10,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:10,072 INFO L225 Difference]: With dead ends: 28554 [2019-12-18 16:55:10,073 INFO L226 Difference]: Without dead ends: 28554 [2019-12-18 16:55:10,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:55:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28554 states. [2019-12-18 16:55:10,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28554 to 23810. [2019-12-18 16:55:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23810 states. [2019-12-18 16:55:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23810 states to 23810 states and 73188 transitions. [2019-12-18 16:55:10,465 INFO L78 Accepts]: Start accepts. Automaton has 23810 states and 73188 transitions. Word has length 65 [2019-12-18 16:55:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:10,465 INFO L462 AbstractCegarLoop]: Abstraction has 23810 states and 73188 transitions. [2019-12-18 16:55:10,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:55:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 23810 states and 73188 transitions. [2019-12-18 16:55:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:55:10,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:10,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:10,691 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:10,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1524862519, now seen corresponding path program 1 times [2019-12-18 16:55:10,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:10,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089384044] [2019-12-18 16:55:10,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:10,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089384044] [2019-12-18 16:55:10,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:10,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:55:10,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746099690] [2019-12-18 16:55:10,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:55:10,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:10,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:55:10,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:55:10,901 INFO L87 Difference]: Start difference. First operand 23810 states and 73188 transitions. Second operand 12 states. [2019-12-18 16:55:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:12,371 INFO L93 Difference]: Finished difference Result 49676 states and 152793 transitions. [2019-12-18 16:55:12,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 16:55:12,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 16:55:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:12,439 INFO L225 Difference]: With dead ends: 49676 [2019-12-18 16:55:12,439 INFO L226 Difference]: Without dead ends: 47083 [2019-12-18 16:55:12,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 16:55:12,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47083 states. [2019-12-18 16:55:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47083 to 25858. [2019-12-18 16:55:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25858 states. [2019-12-18 16:55:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25858 states to 25858 states and 79232 transitions. [2019-12-18 16:55:13,001 INFO L78 Accepts]: Start accepts. Automaton has 25858 states and 79232 transitions. Word has length 66 [2019-12-18 16:55:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:13,001 INFO L462 AbstractCegarLoop]: Abstraction has 25858 states and 79232 transitions. [2019-12-18 16:55:13,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:55:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 25858 states and 79232 transitions. [2019-12-18 16:55:13,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:55:13,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:13,030 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:13,030 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:13,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:13,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1239159877, now seen corresponding path program 2 times [2019-12-18 16:55:13,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:13,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238442919] [2019-12-18 16:55:13,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:13,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238442919] [2019-12-18 16:55:13,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:13,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:55:13,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550616913] [2019-12-18 16:55:13,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:55:13,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:13,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:55:13,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:55:13,243 INFO L87 Difference]: Start difference. First operand 25858 states and 79232 transitions. Second operand 12 states. [2019-12-18 16:55:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:14,461 INFO L93 Difference]: Finished difference Result 31333 states and 94677 transitions. [2019-12-18 16:55:14,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:55:14,461 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 16:55:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:14,501 INFO L225 Difference]: With dead ends: 31333 [2019-12-18 16:55:14,501 INFO L226 Difference]: Without dead ends: 29250 [2019-12-18 16:55:14,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2019-12-18 16:55:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29250 states. [2019-12-18 16:55:14,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29250 to 25184. [2019-12-18 16:55:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25184 states. [2019-12-18 16:55:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25184 states to 25184 states and 77263 transitions. [2019-12-18 16:55:14,927 INFO L78 Accepts]: Start accepts. Automaton has 25184 states and 77263 transitions. Word has length 66 [2019-12-18 16:55:14,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:14,927 INFO L462 AbstractCegarLoop]: Abstraction has 25184 states and 77263 transitions. [2019-12-18 16:55:14,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:55:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 25184 states and 77263 transitions. [2019-12-18 16:55:14,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:55:14,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:14,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:14,957 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:14,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:14,957 INFO L82 PathProgramCache]: Analyzing trace with hash 346764361, now seen corresponding path program 3 times [2019-12-18 16:55:14,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:14,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637685426] [2019-12-18 16:55:14,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:15,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637685426] [2019-12-18 16:55:15,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:15,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:55:15,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613407933] [2019-12-18 16:55:15,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:55:15,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:15,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:55:15,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:55:15,175 INFO L87 Difference]: Start difference. First operand 25184 states and 77263 transitions. Second operand 12 states. [2019-12-18 16:55:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:16,556 INFO L93 Difference]: Finished difference Result 48122 states and 147329 transitions. [2019-12-18 16:55:16,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 16:55:16,557 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 16:55:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:16,622 INFO L225 Difference]: With dead ends: 48122 [2019-12-18 16:55:16,622 INFO L226 Difference]: Without dead ends: 47487 [2019-12-18 16:55:16,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-12-18 16:55:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47487 states. [2019-12-18 16:55:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47487 to 25752. [2019-12-18 16:55:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25752 states. [2019-12-18 16:55:17,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25752 states to 25752 states and 78889 transitions. [2019-12-18 16:55:17,344 INFO L78 Accepts]: Start accepts. Automaton has 25752 states and 78889 transitions. Word has length 66 [2019-12-18 16:55:17,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:17,344 INFO L462 AbstractCegarLoop]: Abstraction has 25752 states and 78889 transitions. [2019-12-18 16:55:17,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:55:17,344 INFO L276 IsEmpty]: Start isEmpty. Operand 25752 states and 78889 transitions. [2019-12-18 16:55:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:55:17,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:17,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:17,370 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:17,370 INFO L82 PathProgramCache]: Analyzing trace with hash 632467003, now seen corresponding path program 4 times [2019-12-18 16:55:17,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:17,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867445520] [2019-12-18 16:55:17,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:17,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867445520] [2019-12-18 16:55:17,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:17,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:55:17,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280909362] [2019-12-18 16:55:17,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:55:17,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:17,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:55:17,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:55:17,565 INFO L87 Difference]: Start difference. First operand 25752 states and 78889 transitions. Second operand 12 states. [2019-12-18 16:55:18,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:18,809 INFO L93 Difference]: Finished difference Result 47660 states and 145488 transitions. [2019-12-18 16:55:18,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 16:55:18,810 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 16:55:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:18,867 INFO L225 Difference]: With dead ends: 47660 [2019-12-18 16:55:18,867 INFO L226 Difference]: Without dead ends: 42687 [2019-12-18 16:55:18,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2019-12-18 16:55:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42687 states. [2019-12-18 16:55:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42687 to 23004. [2019-12-18 16:55:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23004 states. [2019-12-18 16:55:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23004 states to 23004 states and 70659 transitions. [2019-12-18 16:55:19,341 INFO L78 Accepts]: Start accepts. Automaton has 23004 states and 70659 transitions. Word has length 66 [2019-12-18 16:55:19,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:19,341 INFO L462 AbstractCegarLoop]: Abstraction has 23004 states and 70659 transitions. [2019-12-18 16:55:19,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:55:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 23004 states and 70659 transitions. [2019-12-18 16:55:19,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:55:19,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:19,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:19,368 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:19,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:19,368 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 5 times [2019-12-18 16:55:19,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:19,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093770968] [2019-12-18 16:55:19,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:19,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093770968] [2019-12-18 16:55:19,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:19,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 16:55:19,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93928114] [2019-12-18 16:55:19,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 16:55:19,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:19,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 16:55:19,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:55:19,555 INFO L87 Difference]: Start difference. First operand 23004 states and 70659 transitions. Second operand 13 states. [2019-12-18 16:55:20,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:20,768 INFO L93 Difference]: Finished difference Result 42854 states and 131393 transitions. [2019-12-18 16:55:20,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 16:55:20,768 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-18 16:55:20,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:20,827 INFO L225 Difference]: With dead ends: 42854 [2019-12-18 16:55:20,827 INFO L226 Difference]: Without dead ends: 42379 [2019-12-18 16:55:20,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2019-12-18 16:55:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42379 states. [2019-12-18 16:55:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42379 to 22736. [2019-12-18 16:55:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22736 states. [2019-12-18 16:55:21,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22736 states to 22736 states and 69971 transitions. [2019-12-18 16:55:21,280 INFO L78 Accepts]: Start accepts. Automaton has 22736 states and 69971 transitions. Word has length 66 [2019-12-18 16:55:21,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:21,281 INFO L462 AbstractCegarLoop]: Abstraction has 22736 states and 69971 transitions. [2019-12-18 16:55:21,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 16:55:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand 22736 states and 69971 transitions. [2019-12-18 16:55:21,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:55:21,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:21,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:21,302 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:21,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:21,302 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 6 times [2019-12-18 16:55:21,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:21,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856757833] [2019-12-18 16:55:21,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:55:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:55:21,406 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:55:21,407 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:55:21,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t678~0.base_22|) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t678~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t678~0.base_22|) |v_ULTIMATE.start_main_~#t678~0.offset_16| 0))) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t678~0.base_22| 1) |v_#valid_69|) (= v_~z$w_buff1_used~0_500 0) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t678~0.base_22| 4)) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (= (select .cse0 |v_ULTIMATE.start_main_~#t678~0.base_22|) 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= 0 |v_ULTIMATE.start_main_~#t678~0.offset_16|) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd3~0_379) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t678~0.offset=|v_ULTIMATE.start_main_~#t678~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_~#t680~0.offset=|v_ULTIMATE.start_main_~#t680~0.offset_14|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ULTIMATE.start_main_~#t680~0.base=|v_ULTIMATE.start_main_~#t680~0.base_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_133, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t679~0.base=|v_ULTIMATE.start_main_~#t679~0.base_19|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ULTIMATE.start_main_~#t679~0.offset=|v_ULTIMATE.start_main_~#t679~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ULTIMATE.start_main_~#t678~0.base=|v_ULTIMATE.start_main_~#t678~0.base_22|, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t678~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t680~0.offset, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t680~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t679~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t679~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t678~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:55:21,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:55:21,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (not (= |v_ULTIMATE.start_main_~#t679~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t679~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t679~0.base_11|) |v_ULTIMATE.start_main_~#t679~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t679~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t679~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t679~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t679~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t679~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t679~0.base=|v_ULTIMATE.start_main_~#t679~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t679~0.offset=|v_ULTIMATE.start_main_~#t679~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t679~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t679~0.offset] because there is no mapped edge [2019-12-18 16:55:21,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t680~0.base_12|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t680~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t680~0.base_12| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t680~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t680~0.base_12|) |v_ULTIMATE.start_main_~#t680~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t680~0.base_12|) (= |v_ULTIMATE.start_main_~#t680~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t680~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t680~0.offset=|v_ULTIMATE.start_main_~#t680~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t680~0.base=|v_ULTIMATE.start_main_~#t680~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t680~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t680~0.base] because there is no mapped edge [2019-12-18 16:55:21,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite10_Out-1164900903| |P1Thread1of1ForFork2_#t~ite9_Out-1164900903|)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1164900903 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1164900903 256) 0))) (or (and .cse0 (= ~z$w_buff1~0_In-1164900903 |P1Thread1of1ForFork2_#t~ite9_Out-1164900903|) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~z~0_In-1164900903 |P1Thread1of1ForFork2_#t~ite9_Out-1164900903|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1164900903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1164900903, ~z$w_buff1~0=~z$w_buff1~0_In-1164900903, ~z~0=~z~0_In-1164900903} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1164900903|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1164900903, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1164900903|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1164900903, ~z$w_buff1~0=~z$w_buff1~0_In-1164900903, ~z~0=~z~0_In-1164900903} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 16:55:21,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1668157647 256) 0))) (or (and (= ~z$w_buff1~0_In-1668157647 |P2Thread1of1ForFork0_#t~ite23_Out-1668157647|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1668157647 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-1668157647 256)) .cse0) (= (mod ~z$w_buff0_used~0_In-1668157647 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-1668157647 256)) .cse0))) (= |P2Thread1of1ForFork0_#t~ite24_Out-1668157647| |P2Thread1of1ForFork0_#t~ite23_Out-1668157647|) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite23_In-1668157647| |P2Thread1of1ForFork0_#t~ite23_Out-1668157647|) (= ~z$w_buff1~0_In-1668157647 |P2Thread1of1ForFork0_#t~ite24_Out-1668157647|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1668157647, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1668157647, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1668157647|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1668157647, ~z$w_buff1~0=~z$w_buff1~0_In-1668157647, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1668157647, ~weak$$choice2~0=~weak$$choice2~0_In-1668157647} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1668157647, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1668157647|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1668157647, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1668157647|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1668157647, ~z$w_buff1~0=~z$w_buff1~0_In-1668157647, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1668157647, ~weak$$choice2~0=~weak$$choice2~0_In-1668157647} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 16:55:21,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse4 (= (mod ~z$w_buff1_used~0_In-2108089628 256) 0)) (.cse5 (= 0 (mod ~z$w_buff0_used~0_In-2108089628 256))) (.cse0 (= (mod ~weak$$choice2~0_In-2108089628 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-2108089628 256) 0)) (.cse1 (= |P2Thread1of1ForFork0_#t~ite30_Out-2108089628| |P2Thread1of1ForFork0_#t~ite29_Out-2108089628|)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-2108089628 256) 0))) (or (and (or (and .cse0 (= ~z$w_buff1_used~0_In-2108089628 |P2Thread1of1ForFork0_#t~ite29_Out-2108089628|) .cse1 (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite29_In-2108089628| |P2Thread1of1ForFork0_#t~ite29_Out-2108089628|) (= |P2Thread1of1ForFork0_#t~ite30_Out-2108089628| ~z$w_buff1_used~0_In-2108089628))) (= |P2Thread1of1ForFork0_#t~ite28_In-2108089628| |P2Thread1of1ForFork0_#t~ite28_Out-2108089628|)) (let ((.cse6 (not .cse2))) (and (or .cse6 (not .cse4)) (not .cse5) .cse0 (= 0 |P2Thread1of1ForFork0_#t~ite28_Out-2108089628|) (= |P2Thread1of1ForFork0_#t~ite29_Out-2108089628| |P2Thread1of1ForFork0_#t~ite28_Out-2108089628|) (or (not .cse3) .cse6) .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-2108089628|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2108089628, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2108089628, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2108089628, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2108089628, ~weak$$choice2~0=~weak$$choice2~0_In-2108089628, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-2108089628|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-2108089628|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2108089628, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2108089628, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2108089628, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2108089628, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-2108089628|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-2108089628|, ~weak$$choice2~0=~weak$$choice2~0_In-2108089628} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 16:55:21,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 16:55:21,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 16:55:21,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In356948822 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out356948822| |P2Thread1of1ForFork0_#t~ite38_Out356948822|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In356948822 256)))) (or (and (= ~z~0_In356948822 |P2Thread1of1ForFork0_#t~ite38_Out356948822|) (or .cse0 .cse1) .cse2) (and (= ~z$w_buff1~0_In356948822 |P2Thread1of1ForFork0_#t~ite38_Out356948822|) (not .cse1) .cse2 (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In356948822, ~z$w_buff1_used~0=~z$w_buff1_used~0_In356948822, ~z$w_buff1~0=~z$w_buff1~0_In356948822, ~z~0=~z~0_In356948822} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out356948822|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out356948822|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In356948822, ~z$w_buff1_used~0=~z$w_buff1_used~0_In356948822, ~z$w_buff1~0=~z$w_buff1~0_In356948822, ~z~0=~z~0_In356948822} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 16:55:21,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-783185423 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-783185423 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-783185423| ~z$w_buff0_used~0_In-783185423)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-783185423| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-783185423, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-783185423} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-783185423, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-783185423|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-783185423} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 16:55:21,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-781630561 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-781630561 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-781630561 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-781630561 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-781630561| ~z$w_buff1_used~0_In-781630561)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-781630561| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-781630561, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-781630561, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-781630561, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-781630561} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-781630561, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-781630561, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-781630561, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-781630561, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-781630561|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 16:55:21,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1536818269 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1536818269 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1536818269| ~z$r_buff0_thd3~0_In-1536818269) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1536818269| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1536818269, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1536818269} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1536818269, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1536818269, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1536818269|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 16:55:21,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-815774038 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-815774038 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-815774038 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-815774038 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-815774038 |P2Thread1of1ForFork0_#t~ite43_Out-815774038|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite43_Out-815774038| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-815774038, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-815774038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-815774038, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-815774038} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-815774038|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-815774038, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-815774038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-815774038, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-815774038} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 16:55:21,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 16:55:21,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In486236519 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In486236519 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out486236519| 0)) (and (= ~z$w_buff0_used~0_In486236519 |P0Thread1of1ForFork1_#t~ite5_Out486236519|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In486236519, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In486236519} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out486236519|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In486236519, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In486236519} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 16:55:21,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-2087583137 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2087583137 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-2087583137 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-2087583137 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-2087583137 |P0Thread1of1ForFork1_#t~ite6_Out-2087583137|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-2087583137|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2087583137, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2087583137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2087583137, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2087583137} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2087583137, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-2087583137|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2087583137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2087583137, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2087583137} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 16:55:21,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1475381694 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1475381694 256) 0))) (or (and (= 0 ~z$r_buff0_thd1~0_Out1475381694) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In1475381694 ~z$r_buff0_thd1~0_Out1475381694) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1475381694, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1475381694} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1475381694, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1475381694|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1475381694} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:55:21,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In34037515 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In34037515 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In34037515 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In34037515 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out34037515|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In34037515 |P0Thread1of1ForFork1_#t~ite8_Out34037515|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In34037515, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In34037515, ~z$w_buff1_used~0=~z$w_buff1_used~0_In34037515, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In34037515} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out34037515|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In34037515, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In34037515, ~z$w_buff1_used~0=~z$w_buff1_used~0_In34037515, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In34037515} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 16:55:21,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:55:21,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-419754275 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-419754275 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-419754275| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-419754275| ~z$w_buff0_used~0_In-419754275)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-419754275, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-419754275} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-419754275, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-419754275|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-419754275} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 16:55:21,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In2142948678 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In2142948678 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In2142948678 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2142948678 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2142948678 |P1Thread1of1ForFork2_#t~ite12_Out2142948678|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out2142948678|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2142948678, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2142948678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2142948678, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2142948678} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2142948678, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2142948678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2142948678, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out2142948678|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2142948678} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 16:55:21,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1008227128 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1008227128 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-1008227128 |P1Thread1of1ForFork2_#t~ite13_Out-1008227128|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1008227128|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1008227128, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1008227128} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1008227128, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1008227128|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1008227128} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 16:55:21,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1082685591 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1082685591 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1082685591 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1082685591 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-1082685591 |P1Thread1of1ForFork2_#t~ite14_Out-1082685591|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1082685591|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1082685591, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1082685591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1082685591, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1082685591} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1082685591, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1082685591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1082685591, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1082685591|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1082685591} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 16:55:21,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 16:55:21,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: 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_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:55:21,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In952905959 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In952905959 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out952905959| ~z~0_In952905959)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out952905959| ~z$w_buff1~0_In952905959) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In952905959, ~z$w_buff1_used~0=~z$w_buff1_used~0_In952905959, ~z$w_buff1~0=~z$w_buff1~0_In952905959, ~z~0=~z~0_In952905959} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In952905959, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out952905959|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In952905959, ~z$w_buff1~0=~z$w_buff1~0_In952905959, ~z~0=~z~0_In952905959} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 16:55:21,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-18 16:55:21,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1222921742 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1222921742 256)))) (or (and (= ~z$w_buff0_used~0_In-1222921742 |ULTIMATE.start_main_#t~ite49_Out-1222921742|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1222921742|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1222921742, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1222921742} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1222921742, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1222921742, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1222921742|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 16:55:21,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1197839756 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1197839756 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1197839756 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1197839756 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1197839756 |ULTIMATE.start_main_#t~ite50_Out1197839756|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1197839756|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1197839756, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1197839756, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1197839756, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1197839756} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1197839756|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1197839756, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1197839756, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1197839756, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1197839756} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 16:55:21,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1134206574 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1134206574 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-1134206574| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1134206574| ~z$r_buff0_thd0~0_In-1134206574)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1134206574, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1134206574} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1134206574, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1134206574|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1134206574} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 16:55:21,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1096502918 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1096502918 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1096502918 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In1096502918 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1096502918|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1096502918 |ULTIMATE.start_main_#t~ite52_Out1096502918|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1096502918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1096502918, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1096502918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1096502918} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1096502918|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1096502918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1096502918, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1096502918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1096502918} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 16:55:21,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:55:21,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:55:21 BasicIcfg [2019-12-18 16:55:21,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:55:21,551 INFO L168 Benchmark]: Toolchain (without parser) took 161668.01 ms. Allocated memory was 145.2 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.4 MB in the beginning and 825.6 MB in the end (delta: -724.1 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-18 16:55:21,551 INFO L168 Benchmark]: CDTParser took 0.73 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 16:55:21,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.93 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 156.1 MB in the end (delta: -54.8 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 16:55:21,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.01 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:55:21,553 INFO L168 Benchmark]: Boogie Preprocessor took 42.37 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:55:21,553 INFO L168 Benchmark]: RCFGBuilder took 858.85 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 101.1 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 16:55:21,553 INFO L168 Benchmark]: TraceAbstraction took 159942.80 ms. Allocated memory was 202.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.5 MB in the beginning and 825.6 MB in the end (delta: -725.1 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-18 16:55:21,555 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.73 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.93 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 156.1 MB in the end (delta: -54.8 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.01 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.37 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 858.85 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 101.1 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 159942.80 ms. Allocated memory was 202.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.5 MB in the beginning and 825.6 MB in the end (delta: -725.1 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t678, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t679, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t680, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 159.5s, OverallIterations: 49, TraceHistogramMax: 1, AutomataDifference: 71.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 14418 SDtfs, 20255 SDslu, 58667 SDs, 0 SdLazy, 38825 SolverSat, 841 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 901 GetRequests, 122 SyntacticMatches, 44 SemanticMatches, 735 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5080 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred 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: 51.9s AutomataMinimizationTime, 48 MinimizatonAttempts, 590187 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2503 NumberOfCodeBlocks, 2503 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2389 ConstructedInterpolants, 0 QuantifiedInterpolants, 665917 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 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...