/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:36:32,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:36:32,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:36:32,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:36:32,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:36:32,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:36:32,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:36:32,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:36:32,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:36:32,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:36:32,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:36:32,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:36:32,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:36:32,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:36:32,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:36:32,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:36:32,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:36:32,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:36:32,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:36:32,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:36:32,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:36:32,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:36:32,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:36:32,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:36:32,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:36:32,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:36:32,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:36:32,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:36:32,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:36:32,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:36:32,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:36:32,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:36:32,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:36:32,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:36:32,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:36:32,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:36:32,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:36:32,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:36:32,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:36:32,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:36:32,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:36:32,650 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-MCR.epf [2019-12-27 17:36:32,684 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:36:32,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:36:32,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:36:32,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:36:32,686 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:36:32,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:36:32,690 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:36:32,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:36:32,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:36:32,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:36:32,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:36:32,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:36:32,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:36:32,691 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:36:32,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:36:32,692 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:36:32,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:36:32,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:36:32,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:36:32,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:36:32,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:36:32,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:36:32,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:36:32,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:36:32,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:36:32,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:36:32,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:36:32,695 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:36:32,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:36:32,696 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:36:32,696 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:36:32,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:36:33,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:36:33,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:36:33,005 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:36:33,005 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:36:33,006 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_pso.oepc.i [2019-12-27 17:36:33,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f58d9df/4d11278a023b4b71b7cddf78cf2494a4/FLAGd2820e283 [2019-12-27 17:36:33,668 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:36:33,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_pso.oepc.i [2019-12-27 17:36:33,687 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f58d9df/4d11278a023b4b71b7cddf78cf2494a4/FLAGd2820e283 [2019-12-27 17:36:33,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f58d9df/4d11278a023b4b71b7cddf78cf2494a4 [2019-12-27 17:36:33,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:36:33,930 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:36:33,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:36:33,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:36:33,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:36:33,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:36:33" (1/1) ... [2019-12-27 17:36:33,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:33, skipping insertion in model container [2019-12-27 17:36:33,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:36:33" (1/1) ... [2019-12-27 17:36:33,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:36:34,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:36:34,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:36:34,577 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:36:34,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:36:34,754 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:36:34,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34 WrapperNode [2019-12-27 17:36:34,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:36:34,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:36:34,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:36:34,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:36:34,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:34,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:34,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:36:34,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:36:34,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:36:34,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:36:34,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:34,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:34,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:34,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:34,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:34,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:34,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:34,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:36:34,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:36:34,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:36:34,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:36:34,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:36:34,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:36:34,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:36:34,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:36:34,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:36:34,945 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:36:34,945 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:36:34,945 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:36:34,946 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:36:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:36:34,946 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:36:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:36:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:36:34,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:36:34,950 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:36:35,704 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:36:35,705 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:36:35,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:36:35 BoogieIcfgContainer [2019-12-27 17:36:35,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:36:35,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:36:35,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:36:35,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:36:35,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:36:33" (1/3) ... [2019-12-27 17:36:35,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c93bd1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:36:35, skipping insertion in model container [2019-12-27 17:36:35,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (2/3) ... [2019-12-27 17:36:35,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c93bd1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:36:35, skipping insertion in model container [2019-12-27 17:36:35,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:36:35" (3/3) ... [2019-12-27 17:36:35,715 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_pso.oepc.i [2019-12-27 17:36:35,726 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:36:35,727 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:36:35,735 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:36:35,736 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:36:35,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,780 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,780 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,781 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,781 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,782 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,789 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,790 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,817 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,817 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,852 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,854 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,861 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,862 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,862 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,867 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,868 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:35,893 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:36:35,913 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:36:35,914 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:36:35,914 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:36:35,914 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:36:35,914 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:36:35,914 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:36:35,914 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:36:35,915 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:36:35,931 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 17:36:35,933 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 17:36:36,041 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 17:36:36,042 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:36:36,059 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 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:36:36,086 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 17:36:36,140 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 17:36:36,140 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:36:36,149 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 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:36:36,170 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 17:36:36,171 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:36:38,949 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-12-27 17:36:41,576 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 17:36:41,713 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 17:36:42,060 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-27 17:36:42,060 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 17:36:42,064 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 17:37:05,518 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-27 17:37:05,520 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-27 17:37:05,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:37:05,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:05,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:37:05,526 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:05,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:05,530 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-27 17:37:05,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:05,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113405025] [2019-12-27 17:37:05,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:05,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113405025] [2019-12-27 17:37:05,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:05,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:37:05,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [85979250] [2019-12-27 17:37:05,745 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:05,749 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:05,761 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:37:05,762 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:05,765 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:05,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:37:05,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:05,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:37:05,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:37:05,783 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-27 17:37:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:07,412 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-27 17:37:07,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:37:07,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:37:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:08,088 INFO L225 Difference]: With dead ends: 125570 [2019-12-27 17:37:08,088 INFO L226 Difference]: Without dead ends: 111010 [2019-12-27 17:37:08,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:37:16,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-27 17:37:21,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-27 17:37:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-27 17:37:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-27 17:37:22,004 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-27 17:37:22,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:22,005 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-27 17:37:22,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:37:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-27 17:37:22,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:37:22,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:22,011 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:22,012 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:22,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:22,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-27 17:37:22,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:22,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275697631] [2019-12-27 17:37:22,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:22,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-27 17:37:22,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275697631] [2019-12-27 17:37:22,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:22,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:37:22,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [303297149] [2019-12-27 17:37:22,133 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:22,134 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:22,137 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:37:22,138 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:22,138 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:22,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:37:22,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:22,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:37:22,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:37:22,140 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-27 17:37:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:27,933 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-27 17:37:27,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:37:27,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:37:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:28,533 INFO L225 Difference]: With dead ends: 172646 [2019-12-27 17:37:28,534 INFO L226 Difference]: Without dead ends: 172548 [2019-12-27 17:37:28,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:37:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-27 17:37:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-27 17:37:36,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-27 17:37:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-27 17:37:37,438 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-27 17:37:37,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:37,439 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-27 17:37:37,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:37:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-27 17:37:37,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:37:37,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:37,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:37,451 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:37,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:37,453 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-27 17:37:37,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:37,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473082544] [2019-12-27 17:37:37,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:37,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473082544] [2019-12-27 17:37:37,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:37,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:37:37,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1483582298] [2019-12-27 17:37:37,534 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:37,537 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:37,539 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:37:37,539 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:37,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:37,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:37:37,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:37,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:37:37,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:37:37,541 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-27 17:37:42,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:42,513 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-27 17:37:42,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:37:42,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 17:37:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:42,613 INFO L225 Difference]: With dead ends: 34208 [2019-12-27 17:37:42,613 INFO L226 Difference]: Without dead ends: 34208 [2019-12-27 17:37:42,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:37:42,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-27 17:37:43,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-27 17:37:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-27 17:37:43,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-27 17:37:43,389 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-27 17:37:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:43,389 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-27 17:37:43,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:37:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-27 17:37:43,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:37:43,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:43,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:43,393 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:43,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:43,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-27 17:37:43,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:43,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925595991] [2019-12-27 17:37:43,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:43,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925595991] [2019-12-27 17:37:43,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:43,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:37:43,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [84318593] [2019-12-27 17:37:43,486 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:43,489 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:43,491 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:37:43,491 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:43,491 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:43,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:37:43,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:43,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:37:43,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:37:43,493 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-27 17:37:43,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:43,714 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-27 17:37:43,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:37:43,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 17:37:43,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:43,835 INFO L225 Difference]: With dead ends: 51809 [2019-12-27 17:37:43,836 INFO L226 Difference]: Without dead ends: 51809 [2019-12-27 17:37:43,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:37:44,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-27 17:37:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-27 17:37:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-27 17:37:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-27 17:37:44,761 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-27 17:37:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:44,762 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-27 17:37:44,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:37:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-27 17:37:44,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:37:44,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:44,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:44,766 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:44,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:44,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-27 17:37:44,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:44,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082764911] [2019-12-27 17:37:44,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:44,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082764911] [2019-12-27 17:37:44,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:44,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:37:44,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1220522897] [2019-12-27 17:37:44,851 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:44,854 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:45,100 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:37:45,101 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:45,101 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:45,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:37:45,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:45,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:37:45,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:37:45,102 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-27 17:37:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:45,706 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-27 17:37:45,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:37:45,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 17:37:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:45,814 INFO L225 Difference]: With dead ends: 53507 [2019-12-27 17:37:45,814 INFO L226 Difference]: Without dead ends: 53507 [2019-12-27 17:37:45,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:37:46,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-27 17:37:46,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-27 17:37:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-27 17:37:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-27 17:37:46,795 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-27 17:37:46,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:46,795 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-27 17:37:46,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:37:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-27 17:37:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 17:37:46,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:46,809 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:46,810 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:46,810 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-27 17:37:46,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:46,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483357845] [2019-12-27 17:37:46,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:46,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483357845] [2019-12-27 17:37:46,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:46,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:37:46,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [690808555] [2019-12-27 17:37:46,911 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:46,916 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:46,924 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 17:37:46,925 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:46,975 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:37:46,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:37:46,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:46,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:37:46,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:37:46,978 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 7 states. [2019-12-27 17:37:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:48,078 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-27 17:37:48,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:37:48,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 17:37:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:48,187 INFO L225 Difference]: With dead ends: 66834 [2019-12-27 17:37:48,188 INFO L226 Difference]: Without dead ends: 66820 [2019-12-27 17:37:48,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:37:48,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-27 17:37:49,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-27 17:37:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-27 17:37:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-27 17:37:49,443 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-27 17:37:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:49,443 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-27 17:37:49,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:37:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-27 17:37:49,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:37:49,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:49,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:49,460 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:49,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:49,460 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-27 17:37:49,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:49,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899012594] [2019-12-27 17:37:49,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:49,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899012594] [2019-12-27 17:37:49,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:49,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:37:49,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [728913588] [2019-12-27 17:37:49,537 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:49,542 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:49,552 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 17:37:49,552 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:49,575 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:37:49,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:37:49,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:49,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:37:49,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:37:49,576 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 5 states. [2019-12-27 17:37:49,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:49,682 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-27 17:37:49,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:37:49,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 17:37:49,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:49,716 INFO L225 Difference]: With dead ends: 18127 [2019-12-27 17:37:49,716 INFO L226 Difference]: Without dead ends: 18127 [2019-12-27 17:37:49,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:37:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-27 17:37:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-27 17:37:49,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-27 17:37:50,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-27 17:37:50,001 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-27 17:37:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:50,001 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-27 17:37:50,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:37:50,002 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-27 17:37:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:37:50,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:50,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:50,015 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:50,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:50,015 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-27 17:37:50,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:50,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36599048] [2019-12-27 17:37:50,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:50,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36599048] [2019-12-27 17:37:50,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:50,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:37:50,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1056909841] [2019-12-27 17:37:50,119 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:50,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:50,127 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:37:50,128 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:50,128 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:50,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:37:50,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:50,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:37:50,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:37:50,129 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-27 17:37:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:50,724 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-27 17:37:50,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:37:50,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:37:50,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:50,760 INFO L225 Difference]: With dead ends: 25206 [2019-12-27 17:37:50,760 INFO L226 Difference]: Without dead ends: 25206 [2019-12-27 17:37:50,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:37:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-27 17:37:51,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-27 17:37:51,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-27 17:37:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-27 17:37:51,113 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-27 17:37:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:51,113 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-27 17:37:51,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:37:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-27 17:37:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:37:51,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:51,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:51,135 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:51,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:51,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-27 17:37:51,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:51,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315003330] [2019-12-27 17:37:51,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:51,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315003330] [2019-12-27 17:37:51,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:51,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:37:51,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [37911343] [2019-12-27 17:37:51,228 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:51,235 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:51,249 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 17:37:51,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:51,266 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:37:51,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:37:51,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:51,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:37:51,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:37:51,267 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 8 states. [2019-12-27 17:37:52,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:52,702 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-27 17:37:52,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:37:52,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 17:37:52,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:52,741 INFO L225 Difference]: With dead ends: 28185 [2019-12-27 17:37:52,742 INFO L226 Difference]: Without dead ends: 28185 [2019-12-27 17:37:52,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:37:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-27 17:37:53,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-27 17:37:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-27 17:37:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-27 17:37:53,110 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-27 17:37:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:53,110 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-27 17:37:53,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:37:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-27 17:37:53,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:37:53,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:53,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:53,138 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:53,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:53,138 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-27 17:37:53,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:53,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687732576] [2019-12-27 17:37:53,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:53,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:53,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687732576] [2019-12-27 17:37:53,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:53,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:37:53,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1773177355] [2019-12-27 17:37:53,215 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:53,224 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:53,270 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 287 transitions. [2019-12-27 17:37:53,270 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:53,312 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:37:53,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:37:53,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:53,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:37:53,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:37:53,314 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 7 states. [2019-12-27 17:37:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:53,458 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-27 17:37:53,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:37:53,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 17:37:53,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:53,500 INFO L225 Difference]: With dead ends: 18279 [2019-12-27 17:37:53,500 INFO L226 Difference]: Without dead ends: 18279 [2019-12-27 17:37:53,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:37:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-27 17:37:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-27 17:37:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-27 17:37:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-27 17:37:53,990 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-27 17:37:53,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:53,991 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-27 17:37:53,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:37:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-27 17:37:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:37:54,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:54,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:54,025 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:54,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:54,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-27 17:37:54,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:54,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586119892] [2019-12-27 17:37:54,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:54,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:54,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586119892] [2019-12-27 17:37:54,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:54,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:37:54,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [136188739] [2019-12-27 17:37:54,159 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:54,178 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:54,357 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 313 transitions. [2019-12-27 17:37:54,358 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:54,379 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:37:54,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:37:54,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:54,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:37:54,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:37:54,381 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-27 17:37:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:54,963 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-27 17:37:54,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:37:54,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 17:37:54,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:55,049 INFO L225 Difference]: With dead ends: 48537 [2019-12-27 17:37:55,049 INFO L226 Difference]: Without dead ends: 38006 [2019-12-27 17:37:55,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:37:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-27 17:37:55,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-27 17:37:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-27 17:37:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-27 17:37:55,635 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-27 17:37:55,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:55,635 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-27 17:37:55,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:37:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-27 17:37:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:37:55,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:55,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:55,788 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:55,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:55,788 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-27 17:37:55,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:55,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303867560] [2019-12-27 17:37:55,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:55,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303867560] [2019-12-27 17:37:55,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:55,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:37:55,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [254803676] [2019-12-27 17:37:55,884 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:55,904 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:56,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 326 transitions. [2019-12-27 17:37:56,057 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:56,123 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:37:56,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:37:56,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:56,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:37:56,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:37:56,125 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 10 states. [2019-12-27 17:37:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:58,508 INFO L93 Difference]: Finished difference Result 67378 states and 209411 transitions. [2019-12-27 17:37:58,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 17:37:58,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 17:37:58,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:58,596 INFO L225 Difference]: With dead ends: 67378 [2019-12-27 17:37:58,596 INFO L226 Difference]: Without dead ends: 49917 [2019-12-27 17:37:58,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:37:58,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49917 states. [2019-12-27 17:37:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49917 to 24743. [2019-12-27 17:37:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-27 17:37:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-27 17:37:59,234 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-27 17:37:59,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:59,234 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-27 17:37:59,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:37:59,234 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-27 17:37:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:37:59,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:59,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:59,270 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:59,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:59,270 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-27 17:37:59,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:59,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115541075] [2019-12-27 17:37:59,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:59,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-27 17:37:59,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115541075] [2019-12-27 17:37:59,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:59,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:37:59,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2083084815] [2019-12-27 17:37:59,362 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:59,382 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:59,544 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 267 transitions. [2019-12-27 17:37:59,544 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:59,572 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:37:59,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:37:59,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:59,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:37:59,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:37:59,574 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 9 states. [2019-12-27 17:38:00,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:00,927 INFO L93 Difference]: Finished difference Result 83473 states and 258770 transitions. [2019-12-27 17:38:00,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 17:38:00,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 17:38:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:01,042 INFO L225 Difference]: With dead ends: 83473 [2019-12-27 17:38:01,043 INFO L226 Difference]: Without dead ends: 76594 [2019-12-27 17:38:01,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:38:01,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76594 states. [2019-12-27 17:38:01,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76594 to 24923. [2019-12-27 17:38:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-27 17:38:01,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-27 17:38:01,901 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-27 17:38:01,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:01,901 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-27 17:38:01,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:38:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-27 17:38:01,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:38:01,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:01,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:01,942 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:01,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:01,942 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-27 17:38:01,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:01,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908961144] [2019-12-27 17:38:01,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:02,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908961144] [2019-12-27 17:38:02,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:02,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:38:02,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2115605246] [2019-12-27 17:38:02,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:02,052 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:02,312 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 277 states and 500 transitions. [2019-12-27 17:38:02,313 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:02,321 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:38:02,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:38:02,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:02,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:38:02,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:38:02,324 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 4 states. [2019-12-27 17:38:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:02,691 INFO L93 Difference]: Finished difference Result 29331 states and 90024 transitions. [2019-12-27 17:38:02,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:38:02,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 17:38:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:02,762 INFO L225 Difference]: With dead ends: 29331 [2019-12-27 17:38:02,762 INFO L226 Difference]: Without dead ends: 29331 [2019-12-27 17:38:02,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:38:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29331 states. [2019-12-27 17:38:03,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29331 to 19827. [2019-12-27 17:38:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-27 17:38:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-27 17:38:03,304 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-27 17:38:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:03,304 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-27 17:38:03,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:38:03,304 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-27 17:38:03,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:38:03,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:03,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:03,454 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:03,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:03,454 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-27 17:38:03,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:03,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430770177] [2019-12-27 17:38:03,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:03,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430770177] [2019-12-27 17:38:03,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:03,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:38:03,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1099682857] [2019-12-27 17:38:03,560 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:03,596 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:03,798 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 318 transitions. [2019-12-27 17:38:03,798 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:03,799 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:38:03,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:38:03,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:03,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:38:03,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:38:03,800 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-27 17:38:03,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:03,933 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-27 17:38:03,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:38:03,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 17:38:03,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:03,968 INFO L225 Difference]: With dead ends: 24197 [2019-12-27 17:38:03,969 INFO L226 Difference]: Without dead ends: 24197 [2019-12-27 17:38:03,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:38:04,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-27 17:38:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-27 17:38:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-27 17:38:04,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-27 17:38:04,330 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-27 17:38:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:04,330 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-27 17:38:04,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:38:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-27 17:38:04,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:38:04,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:04,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:04,354 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:04,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:04,354 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-27 17:38:04,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:04,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936330305] [2019-12-27 17:38:04,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:04,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936330305] [2019-12-27 17:38:04,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:04,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:38:04,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [779247563] [2019-12-27 17:38:04,435 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:04,458 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:04,671 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 289 transitions. [2019-12-27 17:38:04,671 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:04,672 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:38:04,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:38:04,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:04,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:38:04,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:38:04,673 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-27 17:38:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:04,849 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-27 17:38:04,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:38:04,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 17:38:04,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:04,893 INFO L225 Difference]: With dead ends: 24621 [2019-12-27 17:38:04,893 INFO L226 Difference]: Without dead ends: 24621 [2019-12-27 17:38:04,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:38:04,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-27 17:38:05,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-27 17:38:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-27 17:38:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-27 17:38:05,255 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-27 17:38:05,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:05,256 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-27 17:38:05,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:38:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-27 17:38:05,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:38:05,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:05,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:05,279 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:05,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:05,279 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-27 17:38:05,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:05,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39353505] [2019-12-27 17:38:05,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:05,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39353505] [2019-12-27 17:38:05,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:05,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:38:05,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1888086369] [2019-12-27 17:38:05,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:05,457 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:05,776 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 321 transitions. [2019-12-27 17:38:05,776 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:05,878 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:38:05,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:38:05,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:05,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:38:05,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:38:05,879 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 12 states. [2019-12-27 17:38:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:08,399 INFO L93 Difference]: Finished difference Result 38488 states and 118451 transitions. [2019-12-27 17:38:08,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 17:38:08,399 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 17:38:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:08,450 INFO L225 Difference]: With dead ends: 38488 [2019-12-27 17:38:08,450 INFO L226 Difference]: Without dead ends: 30672 [2019-12-27 17:38:08,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:38:08,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30672 states. [2019-12-27 17:38:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30672 to 21745. [2019-12-27 17:38:08,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21745 states. [2019-12-27 17:38:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21745 states to 21745 states and 67061 transitions. [2019-12-27 17:38:08,863 INFO L78 Accepts]: Start accepts. Automaton has 21745 states and 67061 transitions. Word has length 66 [2019-12-27 17:38:08,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:08,864 INFO L462 AbstractCegarLoop]: Abstraction has 21745 states and 67061 transitions. [2019-12-27 17:38:08,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:38:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 21745 states and 67061 transitions. [2019-12-27 17:38:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:38:08,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:08,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:08,888 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:08,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:08,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1421968206, now seen corresponding path program 2 times [2019-12-27 17:38:08,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:08,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146462041] [2019-12-27 17:38:08,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:09,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146462041] [2019-12-27 17:38:09,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:09,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:38:09,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1468044290] [2019-12-27 17:38:09,063 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:09,082 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:09,292 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 340 transitions. [2019-12-27 17:38:09,292 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:09,441 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 17:38:09,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:38:09,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:09,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:38:09,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:38:09,442 INFO L87 Difference]: Start difference. First operand 21745 states and 67061 transitions. Second operand 13 states. [2019-12-27 17:38:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:12,614 INFO L93 Difference]: Finished difference Result 45951 states and 140703 transitions. [2019-12-27 17:38:12,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 17:38:12,615 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 17:38:12,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:12,673 INFO L225 Difference]: With dead ends: 45951 [2019-12-27 17:38:12,673 INFO L226 Difference]: Without dead ends: 39991 [2019-12-27 17:38:12,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2019-12-27 17:38:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39991 states. [2019-12-27 17:38:13,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39991 to 22197. [2019-12-27 17:38:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22197 states. [2019-12-27 17:38:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22197 states to 22197 states and 68309 transitions. [2019-12-27 17:38:13,368 INFO L78 Accepts]: Start accepts. Automaton has 22197 states and 68309 transitions. Word has length 66 [2019-12-27 17:38:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:13,368 INFO L462 AbstractCegarLoop]: Abstraction has 22197 states and 68309 transitions. [2019-12-27 17:38:13,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:38:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 22197 states and 68309 transitions. [2019-12-27 17:38:13,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:38:13,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:13,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:13,391 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:13,392 INFO L82 PathProgramCache]: Analyzing trace with hash 765284024, now seen corresponding path program 3 times [2019-12-27 17:38:13,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:13,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233363876] [2019-12-27 17:38:13,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:13,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233363876] [2019-12-27 17:38:13,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:13,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:38:13,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [718204484] [2019-12-27 17:38:13,552 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:13,569 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:13,784 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 616 transitions. [2019-12-27 17:38:13,784 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:13,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:38:13,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:38:14,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 17:38:14,538 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:38:14,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 17:38:14,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:14,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 17:38:14,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:38:14,540 INFO L87 Difference]: Start difference. First operand 22197 states and 68309 transitions. Second operand 19 states. [2019-12-27 17:38:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:17,810 INFO L93 Difference]: Finished difference Result 34983 states and 107283 transitions. [2019-12-27 17:38:17,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:38:17,811 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-27 17:38:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:17,855 INFO L225 Difference]: With dead ends: 34983 [2019-12-27 17:38:17,855 INFO L226 Difference]: Without dead ends: 31500 [2019-12-27 17:38:17,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2019-12-27 17:38:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31500 states. [2019-12-27 17:38:18,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31500 to 21765. [2019-12-27 17:38:18,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21765 states. [2019-12-27 17:38:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21765 states to 21765 states and 66977 transitions. [2019-12-27 17:38:18,255 INFO L78 Accepts]: Start accepts. Automaton has 21765 states and 66977 transitions. Word has length 66 [2019-12-27 17:38:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:18,255 INFO L462 AbstractCegarLoop]: Abstraction has 21765 states and 66977 transitions. [2019-12-27 17:38:18,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 17:38:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 21765 states and 66977 transitions. [2019-12-27 17:38:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:38:18,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:18,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:18,277 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:18,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:18,277 INFO L82 PathProgramCache]: Analyzing trace with hash 53330666, now seen corresponding path program 4 times [2019-12-27 17:38:18,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:18,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447079436] [2019-12-27 17:38:18,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:18,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:18,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447079436] [2019-12-27 17:38:18,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:18,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:38:18,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1847953934] [2019-12-27 17:38:18,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:18,454 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:18,736 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 323 transitions. [2019-12-27 17:38:18,736 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:18,860 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:38:18,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:38:18,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:18,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:38:18,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:38:18,862 INFO L87 Difference]: Start difference. First operand 21765 states and 66977 transitions. Second operand 14 states. [2019-12-27 17:38:21,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:21,649 INFO L93 Difference]: Finished difference Result 36536 states and 111333 transitions. [2019-12-27 17:38:21,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:38:21,650 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 17:38:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:21,694 INFO L225 Difference]: With dead ends: 36536 [2019-12-27 17:38:21,694 INFO L226 Difference]: Without dead ends: 31852 [2019-12-27 17:38:21,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:38:21,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31852 states. [2019-12-27 17:38:22,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31852 to 21989. [2019-12-27 17:38:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21989 states. [2019-12-27 17:38:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21989 states to 21989 states and 67561 transitions. [2019-12-27 17:38:22,111 INFO L78 Accepts]: Start accepts. Automaton has 21989 states and 67561 transitions. Word has length 66 [2019-12-27 17:38:22,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:22,111 INFO L462 AbstractCegarLoop]: Abstraction has 21989 states and 67561 transitions. [2019-12-27 17:38:22,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:38:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 21989 states and 67561 transitions. [2019-12-27 17:38:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:38:22,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:22,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:22,136 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:22,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:22,137 INFO L82 PathProgramCache]: Analyzing trace with hash 791396238, now seen corresponding path program 5 times [2019-12-27 17:38:22,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:22,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534143391] [2019-12-27 17:38:22,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:22,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534143391] [2019-12-27 17:38:22,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:22,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:38:22,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [712325470] [2019-12-27 17:38:22,288 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:22,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:22,556 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 635 transitions. [2019-12-27 17:38:22,556 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:22,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:38:22,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:38:22,855 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:38:22,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 17:38:22,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:22,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 17:38:22,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:38:22,857 INFO L87 Difference]: Start difference. First operand 21989 states and 67561 transitions. Second operand 19 states. [2019-12-27 17:38:28,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:28,396 INFO L93 Difference]: Finished difference Result 68522 states and 207755 transitions. [2019-12-27 17:38:28,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 17:38:28,402 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-27 17:38:28,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:28,494 INFO L225 Difference]: With dead ends: 68522 [2019-12-27 17:38:28,494 INFO L226 Difference]: Without dead ends: 65485 [2019-12-27 17:38:28,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=476, Invalid=2946, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 17:38:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65485 states. [2019-12-27 17:38:29,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65485 to 21855. [2019-12-27 17:38:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21855 states. [2019-12-27 17:38:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21855 states to 21855 states and 67213 transitions. [2019-12-27 17:38:29,154 INFO L78 Accepts]: Start accepts. Automaton has 21855 states and 67213 transitions. Word has length 66 [2019-12-27 17:38:29,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:29,154 INFO L462 AbstractCegarLoop]: Abstraction has 21855 states and 67213 transitions. [2019-12-27 17:38:29,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 17:38:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 21855 states and 67213 transitions. [2019-12-27 17:38:29,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:38:29,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:29,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:29,179 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:29,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:29,179 INFO L82 PathProgramCache]: Analyzing trace with hash -315236056, now seen corresponding path program 6 times [2019-12-27 17:38:29,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:29,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943403063] [2019-12-27 17:38:29,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:29,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943403063] [2019-12-27 17:38:29,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:29,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 17:38:29,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2066734645] [2019-12-27 17:38:29,552 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:29,568 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:29,925 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 276 states and 559 transitions. [2019-12-27 17:38:29,926 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:30,527 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 17:38:30,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 17:38:30,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:30,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 17:38:30,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2019-12-27 17:38:30,529 INFO L87 Difference]: Start difference. First operand 21855 states and 67213 transitions. Second operand 28 states. [2019-12-27 17:39:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:04,675 INFO L93 Difference]: Finished difference Result 135992 states and 405411 transitions. [2019-12-27 17:39:04,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2019-12-27 17:39:04,676 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 66 [2019-12-27 17:39:04,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:04,793 INFO L225 Difference]: With dead ends: 135992 [2019-12-27 17:39:04,793 INFO L226 Difference]: Without dead ends: 86378 [2019-12-27 17:39:04,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=4779, Invalid=38693, Unknown=0, NotChecked=0, Total=43472 [2019-12-27 17:39:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86378 states. [2019-12-27 17:39:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86378 to 31336. [2019-12-27 17:39:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31336 states. [2019-12-27 17:39:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31336 states to 31336 states and 95429 transitions. [2019-12-27 17:39:05,714 INFO L78 Accepts]: Start accepts. Automaton has 31336 states and 95429 transitions. Word has length 66 [2019-12-27 17:39:05,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:05,715 INFO L462 AbstractCegarLoop]: Abstraction has 31336 states and 95429 transitions. [2019-12-27 17:39:05,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 17:39:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 31336 states and 95429 transitions. [2019-12-27 17:39:05,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:39:05,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:05,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:39:05,746 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:05,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:05,747 INFO L82 PathProgramCache]: Analyzing trace with hash 163841160, now seen corresponding path program 7 times [2019-12-27 17:39:05,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:05,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684553069] [2019-12-27 17:39:05,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:39:05,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684553069] [2019-12-27 17:39:05,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:05,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:39:05,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [555530382] [2019-12-27 17:39:05,917 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:05,935 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:06,236 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 302 states and 620 transitions. [2019-12-27 17:39:06,236 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:06,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:39:06,480 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 17:39:06,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 17:39:06,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:06,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 17:39:06,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:39:06,481 INFO L87 Difference]: Start difference. First operand 31336 states and 95429 transitions. Second operand 16 states. [2019-12-27 17:39:12,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:12,838 INFO L93 Difference]: Finished difference Result 73771 states and 218199 transitions. [2019-12-27 17:39:12,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-27 17:39:12,839 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 17:39:12,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:12,942 INFO L225 Difference]: With dead ends: 73771 [2019-12-27 17:39:12,942 INFO L226 Difference]: Without dead ends: 73419 [2019-12-27 17:39:12,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=557, Invalid=3225, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 17:39:13,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73419 states. [2019-12-27 17:39:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73419 to 34090. [2019-12-27 17:39:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34090 states. [2019-12-27 17:39:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34090 states to 34090 states and 102928 transitions. [2019-12-27 17:39:13,794 INFO L78 Accepts]: Start accepts. Automaton has 34090 states and 102928 transitions. Word has length 66 [2019-12-27 17:39:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:13,794 INFO L462 AbstractCegarLoop]: Abstraction has 34090 states and 102928 transitions. [2019-12-27 17:39:13,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 17:39:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 34090 states and 102928 transitions. [2019-12-27 17:39:13,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:39:13,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:13,829 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:39:13,829 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:13,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:13,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1354348786, now seen corresponding path program 8 times [2019-12-27 17:39:13,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:13,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264485008] [2019-12-27 17:39:13,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:39:14,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264485008] [2019-12-27 17:39:14,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:14,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 17:39:14,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [681621520] [2019-12-27 17:39:14,512 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:14,524 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:14,987 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 297 states and 608 transitions. [2019-12-27 17:39:14,987 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:15,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:39:15,862 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 35 times. [2019-12-27 17:39:15,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 17:39:15,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:15,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 17:39:15,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1083, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 17:39:15,864 INFO L87 Difference]: Start difference. First operand 34090 states and 102928 transitions. Second operand 35 states. [2019-12-27 17:39:16,023 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-12-27 17:39:18,375 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-12-27 17:39:22,306 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-12-27 17:39:22,889 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-12-27 17:39:24,431 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-12-27 17:39:24,981 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-12-27 17:39:25,902 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-12-27 17:39:27,101 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-12-27 17:39:31,686 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-12-27 17:39:32,847 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-12-27 17:39:33,434 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-12-27 17:39:33,914 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-12-27 17:39:34,754 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-12-27 17:39:34,932 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-12-27 17:39:36,494 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-12-27 17:39:38,271 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-12-27 17:40:07,906 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-12-27 17:40:09,835 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-12-27 17:40:12,864 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-12-27 17:40:15,870 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-12-27 17:40:16,320 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-12-27 17:40:20,328 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-12-27 17:40:20,900 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-12-27 17:40:22,604 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 Received shutdown request... [2019-12-27 17:40:24,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 430 states. [2019-12-27 17:40:24,422 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 17:40:24,427 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 17:40:24,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:40:24 BasicIcfg [2019-12-27 17:40:24,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:40:24,429 INFO L168 Benchmark]: Toolchain (without parser) took 230500.31 ms. Allocated memory was 137.9 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 100.6 MB in the beginning and 938.6 MB in the end (delta: -838.0 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 17:40:24,429 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 17:40:24,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.26 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.4 MB in the beginning and 155.3 MB in the end (delta: -54.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:40:24,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.80 ms. Allocated memory is still 201.9 MB. Free memory was 155.3 MB in the beginning and 152.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:40:24,435 INFO L168 Benchmark]: Boogie Preprocessor took 51.35 ms. Allocated memory is still 201.9 MB. Free memory was 152.5 MB in the beginning and 150.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:40:24,437 INFO L168 Benchmark]: RCFGBuilder took 827.42 ms. Allocated memory is still 201.9 MB. Free memory was 150.5 MB in the beginning and 99.9 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:40:24,438 INFO L168 Benchmark]: TraceAbstraction took 228720.07 ms. Allocated memory was 201.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.9 MB in the beginning and 938.6 MB in the end (delta: -838.7 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 17:40:24,440 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 820.26 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.4 MB in the beginning and 155.3 MB in the end (delta: -54.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.80 ms. Allocated memory is still 201.9 MB. Free memory was 155.3 MB in the beginning and 152.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.35 ms. Allocated memory is still 201.9 MB. Free memory was 152.5 MB in the beginning and 150.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 827.42 ms. Allocated memory is still 201.9 MB. Free memory was 150.5 MB in the beginning and 99.9 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 228720.07 ms. Allocated memory was 201.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.9 MB in the beginning and 938.6 MB in the end (delta: -838.7 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (34090states) and FLOYD_HOARE automaton (currently 430 states, 35 states before enhancement),while ReachableStatesComputation was computing reachable states (115427 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (34090states) and FLOYD_HOARE automaton (currently 430 states, 35 states before enhancement),while ReachableStatesComputation was computing reachable states (115427 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: TIMEOUT, OverallTime: 228.5s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 150.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7792 SDtfs, 14592 SDslu, 48425 SDs, 0 SdLazy, 81199 SolverSat, 1555 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 70.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1240 GetRequests, 168 SyntacticMatches, 87 SemanticMatches, 985 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111736 ImplicationChecksByTransitivity, 51.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred 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: 35.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 366451 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1120 NumberOfCodeBlocks, 1120 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1096 ConstructedInterpolants, 0 QuantifiedInterpolants, 273457 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 could not prove your program: Timeout Completed graceful shutdown