/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:36:59,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:36:59,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:36:59,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:36:59,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:36:59,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:36:59,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:36:59,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:36:59,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:36:59,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:36:59,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:36:59,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:36:59,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:36:59,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:36:59,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:36:59,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:36:59,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:36:59,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:36:59,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:36:59,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:36:59,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:36:59,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:36:59,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:36:59,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:36:59,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:36:59,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:36:59,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:36:59,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:36:59,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:36:59,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:36:59,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:36:59,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:36:59,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:36:59,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:36:59,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:36:59,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:36:59,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:36:59,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:36:59,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:36:59,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:36:59,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:36:59,824 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:36:59,858 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:36:59,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:36:59,862 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:36:59,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:36:59,863 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:36:59,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:36:59,863 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:36:59,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:36:59,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:36:59,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:36:59,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:36:59,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:36:59,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:36:59,865 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:36:59,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:36:59,865 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:36:59,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:36:59,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:36:59,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:36:59,866 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:36:59,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:36:59,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:36:59,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:36:59,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:36:59,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:36:59,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:36:59,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:36:59,868 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:36:59,868 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:36:59,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:36:59,868 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:36:59,870 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:37:00,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:37:00,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:37:00,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:37:00,197 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:37:00,197 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:37:00,198 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_rmo.oepc.i [2019-12-27 21:37:00,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fba0917d/4365fc44ed0047ae87ee0e85da08fa10/FLAG61068bfb7 [2019-12-27 21:37:00,832 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:37:00,833 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_rmo.oepc.i [2019-12-27 21:37:00,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fba0917d/4365fc44ed0047ae87ee0e85da08fa10/FLAG61068bfb7 [2019-12-27 21:37:01,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fba0917d/4365fc44ed0047ae87ee0e85da08fa10 [2019-12-27 21:37:01,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:37:01,149 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:37:01,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:37:01,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:37:01,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:37:01,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:37:01" (1/1) ... [2019-12-27 21:37:01,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36036b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:01, skipping insertion in model container [2019-12-27 21:37:01,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:37:01" (1/1) ... [2019-12-27 21:37:01,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:37:01,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:37:01,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:37:01,711 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:37:01,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:37:01,899 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:37:01,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:01 WrapperNode [2019-12-27 21:37:01,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:37:01,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:37:01,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:37:01,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:37:01,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:01" (1/1) ... [2019-12-27 21:37:01,944 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:01" (1/1) ... [2019-12-27 21:37:01,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:37:01,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:37:01,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:37:01,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:37:02,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:01" (1/1) ... [2019-12-27 21:37:02,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:01" (1/1) ... [2019-12-27 21:37:02,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:01" (1/1) ... [2019-12-27 21:37:02,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:01" (1/1) ... [2019-12-27 21:37:02,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:01" (1/1) ... [2019-12-27 21:37:02,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:01" (1/1) ... [2019-12-27 21:37:02,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:01" (1/1) ... [2019-12-27 21:37:02,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:37:02,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:37:02,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:37:02,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:37:02,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:01" (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 21:37:02,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:37:02,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:37:02,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:37:02,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:37:02,118 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:37:02,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:37:02,119 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:37:02,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:37:02,120 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:37:02,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:37:02,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:37:02,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:37:02,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:37:02,123 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 21:37:02,939 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:37:02,940 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:37:02,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:37:02 BoogieIcfgContainer [2019-12-27 21:37:02,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:37:02,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:37:02,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:37:02,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:37:02,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:37:01" (1/3) ... [2019-12-27 21:37:02,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c111e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:37:02, skipping insertion in model container [2019-12-27 21:37:02,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:01" (2/3) ... [2019-12-27 21:37:02,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c111e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:37:02, skipping insertion in model container [2019-12-27 21:37:02,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:37:02" (3/3) ... [2019-12-27 21:37:02,950 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_rmo.oepc.i [2019-12-27 21:37:02,961 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:37:02,961 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:37:02,969 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:37:02,970 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:37:03,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,012 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,012 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,012 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,013 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,013 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,021 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,021 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,030 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,030 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,080 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,081 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,081 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,084 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,085 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,089 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,091 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:03,115 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:37:03,135 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:37:03,135 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:37:03,136 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:37:03,136 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:37:03,136 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:37:03,136 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:37:03,136 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:37:03,136 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:37:03,153 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 21:37:03,155 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 21:37:03,257 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 21:37:03,258 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:37:03,273 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:37:03,297 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 21:37:03,353 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 21:37:03,354 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:37:03,362 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:37:03,384 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 21:37:03,386 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:37:07,104 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 21:37:07,222 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 21:37:07,246 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-27 21:37:07,246 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 21:37:07,249 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 21:37:22,851 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-27 21:37:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-27 21:37:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:37:22,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:22,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:37:22,859 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 21:37:22,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:22,864 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-27 21:37:22,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:22,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450843908] [2019-12-27 21:37:22,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:37:23,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450843908] [2019-12-27 21:37:23,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:23,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:37:23,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1548761065] [2019-12-27 21:37:23,164 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:23,169 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:23,183 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:37:23,184 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:23,188 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:37:23,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:37:23,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:23,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:37:23,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:37:23,208 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-27 21:37:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:26,576 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-27 21:37:26,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:37:26,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:37:26,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:27,286 INFO L225 Difference]: With dead ends: 106230 [2019-12-27 21:37:27,287 INFO L226 Difference]: Without dead ends: 99639 [2019-12-27 21:37:27,297 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 21:37:31,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-27 21:37:33,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-27 21:37:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-27 21:37:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-27 21:37:38,941 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-27 21:37:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:38,941 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-27 21:37:38,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:37:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-27 21:37:38,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:37:38,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:38,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:37:38,947 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 21:37:38,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:38,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-27 21:37:38,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:38,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217155245] [2019-12-27 21:37:38,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:39,068 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 21:37:39,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217155245] [2019-12-27 21:37:39,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:39,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:37:39,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1877139646] [2019-12-27 21:37:39,069 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:39,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:39,078 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:37:39,078 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:39,078 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:37:39,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:37:39,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:39,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:37:39,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:37:39,081 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-27 21:37:40,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:40,264 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-27 21:37:40,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:37:40,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:37:40,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:45,894 INFO L225 Difference]: With dead ends: 159197 [2019-12-27 21:37:45,895 INFO L226 Difference]: Without dead ends: 159148 [2019-12-27 21:37:45,896 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 21:37:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-27 21:37:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-27 21:37:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-27 21:37:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-27 21:37:54,965 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-27 21:37:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:54,965 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-27 21:37:54,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:37:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-27 21:37:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:37:54,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:54,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:37:54,977 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 21:37:54,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:54,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-27 21:37:54,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:54,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636965280] [2019-12-27 21:37:54,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:55,065 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 21:37:55,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636965280] [2019-12-27 21:37:55,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:55,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:37:55,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1017434675] [2019-12-27 21:37:55,066 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:55,071 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:55,075 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:37:55,075 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:55,076 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:37:55,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:37:55,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:55,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:37:55,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:37:55,077 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-27 21:37:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:55,226 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-27 21:37:55,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:37:55,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:37:55,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:55,275 INFO L225 Difference]: With dead ends: 32092 [2019-12-27 21:37:55,276 INFO L226 Difference]: Without dead ends: 32092 [2019-12-27 21:37:55,276 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 21:37:55,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-27 21:37:55,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-27 21:37:55,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-27 21:37:55,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-27 21:37:55,898 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-27 21:37:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:55,899 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-27 21:37:55,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:37:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-27 21:37:55,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:37:55,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:55,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:37:55,902 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 21:37:55,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:55,902 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-27 21:37:55,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:55,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348353460] [2019-12-27 21:37:55,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:55,998 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 21:37:55,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348353460] [2019-12-27 21:37:55,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:55,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:37:55,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1370612905] [2019-12-27 21:37:55,999 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:56,001 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:56,004 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:37:56,004 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:56,004 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:37:56,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:37:56,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:56,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:37:56,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:37:56,005 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-27 21:37:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:56,530 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-27 21:37:56,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:37:56,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:37:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:56,599 INFO L225 Difference]: With dead ends: 43827 [2019-12-27 21:37:56,599 INFO L226 Difference]: Without dead ends: 43827 [2019-12-27 21:37:56,599 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 21:37:57,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-27 21:37:57,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-27 21:37:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-27 21:37:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-27 21:37:57,829 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-27 21:37:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:57,830 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-27 21:37:57,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:37:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-27 21:37:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:37:57,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:57,840 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 21:37:57,840 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 21:37:57,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:57,841 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-27 21:37:57,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:57,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950075142] [2019-12-27 21:37:57,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:58,018 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 21:37:58,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950075142] [2019-12-27 21:37:58,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:58,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:37:58,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1405431387] [2019-12-27 21:37:58,020 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:58,023 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:58,030 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 21:37:58,030 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:58,032 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:37:58,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:37:58,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:58,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:37:58,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:37:58,033 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-27 21:37:59,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:59,210 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-27 21:37:59,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:37:59,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 21:37:59,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:59,300 INFO L225 Difference]: With dead ends: 56855 [2019-12-27 21:37:59,300 INFO L226 Difference]: Without dead ends: 56848 [2019-12-27 21:37:59,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:37:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-27 21:38:00,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-27 21:38:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-27 21:38:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-27 21:38:00,508 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-27 21:38:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:00,508 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-27 21:38:00,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:38:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-27 21:38:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:38:00,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:00,523 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 21:38:00,523 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 21:38:00,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:00,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-27 21:38:00,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:00,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963932971] [2019-12-27 21:38:00,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:00,613 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 21:38:00,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963932971] [2019-12-27 21:38:00,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:00,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:38:00,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1754957179] [2019-12-27 21:38:00,615 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:00,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:00,628 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 21:38:00,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:00,665 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:38:00,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:38:00,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:00,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:38:00,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:38:00,667 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 5 states. [2019-12-27 21:38:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:00,738 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-27 21:38:00,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:38:00,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:38:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:00,760 INFO L225 Difference]: With dead ends: 15569 [2019-12-27 21:38:00,761 INFO L226 Difference]: Without dead ends: 15569 [2019-12-27 21:38:00,761 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 21:38:00,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-27 21:38:00,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-27 21:38:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 21:38:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-27 21:38:00,991 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-27 21:38:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:00,991 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-27 21:38:00,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:38:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-27 21:38:01,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:38:01,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:01,001 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 21:38:01,002 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 21:38:01,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:01,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-27 21:38:01,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:01,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250318099] [2019-12-27 21:38:01,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:01,119 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 21:38:01,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250318099] [2019-12-27 21:38:01,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:01,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:38:01,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1459536847] [2019-12-27 21:38:01,120 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:01,125 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:01,131 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:38:01,131 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:01,131 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:38:01,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:38:01,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:01,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:38:01,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:38:01,132 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 6 states. [2019-12-27 21:38:01,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:01,729 INFO L93 Difference]: Finished difference Result 21967 states and 64800 transitions. [2019-12-27 21:38:01,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:38:01,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:38:01,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:01,773 INFO L225 Difference]: With dead ends: 21967 [2019-12-27 21:38:01,774 INFO L226 Difference]: Without dead ends: 21967 [2019-12-27 21:38:01,774 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 21:38:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-12-27 21:38:02,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 17627. [2019-12-27 21:38:02,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-27 21:38:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-27 21:38:02,410 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-27 21:38:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:02,410 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-27 21:38:02,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:38:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-27 21:38:02,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:38:02,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:02,430 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 21:38:02,430 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 21:38:02,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:02,430 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-27 21:38:02,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:02,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041644778] [2019-12-27 21:38:02,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:02,581 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 21:38:02,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041644778] [2019-12-27 21:38:02,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:02,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:38:02,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [755100948] [2019-12-27 21:38:02,582 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:02,588 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:02,606 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 71 transitions. [2019-12-27 21:38:02,606 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:02,607 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:38:02,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:38:02,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:02,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:38:02,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:38:02,608 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 7 states. [2019-12-27 21:38:03,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:03,901 INFO L93 Difference]: Finished difference Result 24877 states and 72876 transitions. [2019-12-27 21:38:03,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:38:03,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 21:38:03,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:03,940 INFO L225 Difference]: With dead ends: 24877 [2019-12-27 21:38:03,941 INFO L226 Difference]: Without dead ends: 24877 [2019-12-27 21:38:03,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:38:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24877 states. [2019-12-27 21:38:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24877 to 16954. [2019-12-27 21:38:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 21:38:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50982 transitions. [2019-12-27 21:38:04,269 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50982 transitions. Word has length 33 [2019-12-27 21:38:04,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:04,269 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50982 transitions. [2019-12-27 21:38:04,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:38:04,269 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50982 transitions. [2019-12-27 21:38:04,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:38:04,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:04,291 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 21:38:04,292 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 21:38:04,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:04,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-27 21:38:04,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:04,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302397164] [2019-12-27 21:38:04,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:04,372 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 21:38:04,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302397164] [2019-12-27 21:38:04,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:04,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:38:04,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2099457039] [2019-12-27 21:38:04,374 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:04,381 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:04,448 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 424 transitions. [2019-12-27 21:38:04,448 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:04,660 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 21:38:04,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:38:04,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:04,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:38:04,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:38:04,661 INFO L87 Difference]: Start difference. First operand 16954 states and 50982 transitions. Second operand 11 states. [2019-12-27 21:38:05,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:05,599 INFO L93 Difference]: Finished difference Result 23664 states and 70656 transitions. [2019-12-27 21:38:05,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:38:05,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-12-27 21:38:05,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:05,632 INFO L225 Difference]: With dead ends: 23664 [2019-12-27 21:38:05,632 INFO L226 Difference]: Without dead ends: 23664 [2019-12-27 21:38:05,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:38:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23664 states. [2019-12-27 21:38:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23664 to 22129. [2019-12-27 21:38:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22129 states. [2019-12-27 21:38:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22129 states to 22129 states and 66460 transitions. [2019-12-27 21:38:06,308 INFO L78 Accepts]: Start accepts. Automaton has 22129 states and 66460 transitions. Word has length 39 [2019-12-27 21:38:06,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:06,309 INFO L462 AbstractCegarLoop]: Abstraction has 22129 states and 66460 transitions. [2019-12-27 21:38:06,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:38:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 22129 states and 66460 transitions. [2019-12-27 21:38:06,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:38:06,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:06,338 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 21:38:06,338 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 21:38:06,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:06,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1240175328, now seen corresponding path program 2 times [2019-12-27 21:38:06,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:06,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929901931] [2019-12-27 21:38:06,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:06,429 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 21:38:06,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929901931] [2019-12-27 21:38:06,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:06,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:38:06,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1354478899] [2019-12-27 21:38:06,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:06,438 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:06,499 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 378 transitions. [2019-12-27 21:38:06,499 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:06,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:38:06,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:38:06,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:06,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:38:06,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:38:06,545 INFO L87 Difference]: Start difference. First operand 22129 states and 66460 transitions. Second operand 7 states. [2019-12-27 21:38:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:06,701 INFO L93 Difference]: Finished difference Result 20882 states and 63572 transitions. [2019-12-27 21:38:06,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:38:06,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 21:38:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:06,746 INFO L225 Difference]: With dead ends: 20882 [2019-12-27 21:38:06,746 INFO L226 Difference]: Without dead ends: 20882 [2019-12-27 21:38:06,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:38:06,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20882 states. [2019-12-27 21:38:07,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20882 to 20042. [2019-12-27 21:38:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20042 states. [2019-12-27 21:38:07,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20042 states to 20042 states and 61305 transitions. [2019-12-27 21:38:07,236 INFO L78 Accepts]: Start accepts. Automaton has 20042 states and 61305 transitions. Word has length 39 [2019-12-27 21:38:07,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:07,236 INFO L462 AbstractCegarLoop]: Abstraction has 20042 states and 61305 transitions. [2019-12-27 21:38:07,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:38:07,236 INFO L276 IsEmpty]: Start isEmpty. Operand 20042 states and 61305 transitions. [2019-12-27 21:38:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:38:07,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:07,264 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 21:38:07,265 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 21:38:07,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:07,265 INFO L82 PathProgramCache]: Analyzing trace with hash 480370435, now seen corresponding path program 1 times [2019-12-27 21:38:07,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:07,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985755035] [2019-12-27 21:38:07,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:07,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:38:07,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985755035] [2019-12-27 21:38:07,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:07,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:38:07,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [869294251] [2019-12-27 21:38:07,337 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:07,359 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:07,568 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 269 states and 524 transitions. [2019-12-27 21:38:07,568 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:07,578 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:38:07,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:38:07,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:07,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:38:07,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:38:07,580 INFO L87 Difference]: Start difference. First operand 20042 states and 61305 transitions. Second operand 3 states. [2019-12-27 21:38:07,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:07,700 INFO L93 Difference]: Finished difference Result 29777 states and 91217 transitions. [2019-12-27 21:38:07,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:38:07,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 21:38:07,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:07,742 INFO L225 Difference]: With dead ends: 29777 [2019-12-27 21:38:07,742 INFO L226 Difference]: Without dead ends: 29777 [2019-12-27 21:38:07,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:38:07,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29777 states. [2019-12-27 21:38:08,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29777 to 22663. [2019-12-27 21:38:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22663 states. [2019-12-27 21:38:08,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22663 states to 22663 states and 70163 transitions. [2019-12-27 21:38:08,452 INFO L78 Accepts]: Start accepts. Automaton has 22663 states and 70163 transitions. Word has length 64 [2019-12-27 21:38:08,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:08,452 INFO L462 AbstractCegarLoop]: Abstraction has 22663 states and 70163 transitions. [2019-12-27 21:38:08,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:38:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 22663 states and 70163 transitions. [2019-12-27 21:38:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:38:08,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:08,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:38:08,480 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 21:38:08,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:08,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2036276616, now seen corresponding path program 1 times [2019-12-27 21:38:08,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:08,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580630858] [2019-12-27 21:38:08,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:08,562 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 21:38:08,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580630858] [2019-12-27 21:38:08,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:08,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:38:08,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [583823235] [2019-12-27 21:38:08,563 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:08,584 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:08,894 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 269 states and 524 transitions. [2019-12-27 21:38:08,894 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:09,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:38:09,105 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 21:38:09,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:38:09,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:09,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:38:09,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:38:09,106 INFO L87 Difference]: Start difference. First operand 22663 states and 70163 transitions. Second operand 8 states. [2019-12-27 21:38:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:10,138 INFO L93 Difference]: Finished difference Result 67977 states and 214677 transitions. [2019-12-27 21:38:10,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 21:38:10,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 21:38:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:10,206 INFO L225 Difference]: With dead ends: 67977 [2019-12-27 21:38:10,206 INFO L226 Difference]: Without dead ends: 45129 [2019-12-27 21:38:10,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 14 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:38:10,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45129 states. [2019-12-27 21:38:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45129 to 25327. [2019-12-27 21:38:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25327 states. [2019-12-27 21:38:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25327 states to 25327 states and 80143 transitions. [2019-12-27 21:38:11,098 INFO L78 Accepts]: Start accepts. Automaton has 25327 states and 80143 transitions. Word has length 64 [2019-12-27 21:38:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:11,099 INFO L462 AbstractCegarLoop]: Abstraction has 25327 states and 80143 transitions. [2019-12-27 21:38:11,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:38:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand 25327 states and 80143 transitions. [2019-12-27 21:38:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:38:11,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:11,134 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 21:38:11,134 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 21:38:11,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:11,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1674677294, now seen corresponding path program 2 times [2019-12-27 21:38:11,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:11,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199643528] [2019-12-27 21:38:11,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:11,234 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 21:38:11,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199643528] [2019-12-27 21:38:11,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:11,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:38:11,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1869367805] [2019-12-27 21:38:11,235 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:11,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:11,455 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 417 transitions. [2019-12-27 21:38:11,455 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:11,558 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:38:11,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:38:11,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:11,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:38:11,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:38:11,559 INFO L87 Difference]: Start difference. First operand 25327 states and 80143 transitions. Second operand 11 states. [2019-12-27 21:38:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:12,225 INFO L93 Difference]: Finished difference Result 70060 states and 217075 transitions. [2019-12-27 21:38:12,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:38:12,226 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 21:38:12,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:12,296 INFO L225 Difference]: With dead ends: 70060 [2019-12-27 21:38:12,296 INFO L226 Difference]: Without dead ends: 48367 [2019-12-27 21:38:12,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-12-27 21:38:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48367 states. [2019-12-27 21:38:13,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48367 to 28699. [2019-12-27 21:38:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28699 states. [2019-12-27 21:38:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28699 states to 28699 states and 90519 transitions. [2019-12-27 21:38:13,453 INFO L78 Accepts]: Start accepts. Automaton has 28699 states and 90519 transitions. Word has length 64 [2019-12-27 21:38:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:13,453 INFO L462 AbstractCegarLoop]: Abstraction has 28699 states and 90519 transitions. [2019-12-27 21:38:13,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:38:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 28699 states and 90519 transitions. [2019-12-27 21:38:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:38:13,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:13,484 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 21:38:13,485 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 21:38:13,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:13,485 INFO L82 PathProgramCache]: Analyzing trace with hash 4176110, now seen corresponding path program 3 times [2019-12-27 21:38:13,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:13,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449655595] [2019-12-27 21:38:13,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:13,585 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 21:38:13,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449655595] [2019-12-27 21:38:13,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:13,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:38:13,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [46679958] [2019-12-27 21:38:13,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:13,605 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:13,902 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 467 transitions. [2019-12-27 21:38:13,903 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:14,006 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 21:38:14,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:38:14,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:14,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:38:14,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:38:14,008 INFO L87 Difference]: Start difference. First operand 28699 states and 90519 transitions. Second operand 10 states. [2019-12-27 21:38:15,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:15,526 INFO L93 Difference]: Finished difference Result 142729 states and 437290 transitions. [2019-12-27 21:38:15,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 21:38:15,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 21:38:15,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:15,713 INFO L225 Difference]: With dead ends: 142729 [2019-12-27 21:38:15,713 INFO L226 Difference]: Without dead ends: 110560 [2019-12-27 21:38:15,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-12-27 21:38:16,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110560 states. [2019-12-27 21:38:17,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110560 to 33636. [2019-12-27 21:38:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33636 states. [2019-12-27 21:38:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33636 states to 33636 states and 106344 transitions. [2019-12-27 21:38:17,396 INFO L78 Accepts]: Start accepts. Automaton has 33636 states and 106344 transitions. Word has length 64 [2019-12-27 21:38:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:17,396 INFO L462 AbstractCegarLoop]: Abstraction has 33636 states and 106344 transitions. [2019-12-27 21:38:17,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:38:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 33636 states and 106344 transitions. [2019-12-27 21:38:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:38:17,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:17,433 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 21:38:17,433 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 21:38:17,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:17,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1890015084, now seen corresponding path program 4 times [2019-12-27 21:38:17,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:17,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696967670] [2019-12-27 21:38:17,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:17,534 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 21:38:17,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696967670] [2019-12-27 21:38:17,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:17,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:38:17,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [289930717] [2019-12-27 21:38:17,535 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:17,568 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:17,822 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 548 transitions. [2019-12-27 21:38:17,822 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:17,956 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:38:17,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:38:17,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:17,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:38:17,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:38:17,958 INFO L87 Difference]: Start difference. First operand 33636 states and 106344 transitions. Second operand 11 states. [2019-12-27 21:38:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:20,448 INFO L93 Difference]: Finished difference Result 94309 states and 291967 transitions. [2019-12-27 21:38:20,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:38:20,449 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 21:38:20,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:20,573 INFO L225 Difference]: With dead ends: 94309 [2019-12-27 21:38:20,573 INFO L226 Difference]: Without dead ends: 82051 [2019-12-27 21:38:20,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:38:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82051 states. [2019-12-27 21:38:21,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82051 to 34133. [2019-12-27 21:38:21,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34133 states. [2019-12-27 21:38:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34133 states to 34133 states and 107975 transitions. [2019-12-27 21:38:21,494 INFO L78 Accepts]: Start accepts. Automaton has 34133 states and 107975 transitions. Word has length 64 [2019-12-27 21:38:21,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:21,494 INFO L462 AbstractCegarLoop]: Abstraction has 34133 states and 107975 transitions. [2019-12-27 21:38:21,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:38:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 34133 states and 107975 transitions. [2019-12-27 21:38:21,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:38:21,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:21,533 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:21,533 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 21:38:21,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:21,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1853608678, now seen corresponding path program 5 times [2019-12-27 21:38:21,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:21,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120709048] [2019-12-27 21:38:21,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:21,599 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 21:38:21,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120709048] [2019-12-27 21:38:21,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:21,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:38:21,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2059381277] [2019-12-27 21:38:21,601 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:21,620 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:21,795 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 354 transitions. [2019-12-27 21:38:21,795 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:21,797 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:38:21,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:38:21,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:21,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:38:21,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:38:21,798 INFO L87 Difference]: Start difference. First operand 34133 states and 107975 transitions. Second operand 3 states. [2019-12-27 21:38:22,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:22,008 INFO L93 Difference]: Finished difference Result 40618 states and 127472 transitions. [2019-12-27 21:38:22,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:38:22,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 21:38:22,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:22,065 INFO L225 Difference]: With dead ends: 40618 [2019-12-27 21:38:22,065 INFO L226 Difference]: Without dead ends: 40618 [2019-12-27 21:38:22,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:38:22,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40618 states. [2019-12-27 21:38:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40618 to 30836. [2019-12-27 21:38:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30836 states. [2019-12-27 21:38:23,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30836 states to 30836 states and 95961 transitions. [2019-12-27 21:38:23,017 INFO L78 Accepts]: Start accepts. Automaton has 30836 states and 95961 transitions. Word has length 64 [2019-12-27 21:38:23,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:23,017 INFO L462 AbstractCegarLoop]: Abstraction has 30836 states and 95961 transitions. [2019-12-27 21:38:23,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:38:23,018 INFO L276 IsEmpty]: Start isEmpty. Operand 30836 states and 95961 transitions. [2019-12-27 21:38:23,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:38:23,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:23,052 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 21:38:23,052 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 21:38:23,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:23,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1838532524, now seen corresponding path program 1 times [2019-12-27 21:38:23,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:23,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543830992] [2019-12-27 21:38:23,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:23,129 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 21:38:23,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543830992] [2019-12-27 21:38:23,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:23,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:38:23,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1834267275] [2019-12-27 21:38:23,130 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:23,150 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:23,410 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 592 transitions. [2019-12-27 21:38:23,410 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:23,484 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:38:23,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:38:23,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:23,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:38:23,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:38:23,485 INFO L87 Difference]: Start difference. First operand 30836 states and 95961 transitions. Second operand 6 states. [2019-12-27 21:38:24,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:24,197 INFO L93 Difference]: Finished difference Result 54733 states and 169886 transitions. [2019-12-27 21:38:24,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:38:24,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 21:38:24,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:24,286 INFO L225 Difference]: With dead ends: 54733 [2019-12-27 21:38:24,286 INFO L226 Difference]: Without dead ends: 54733 [2019-12-27 21:38:24,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:38:24,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54733 states. [2019-12-27 21:38:25,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54733 to 31050. [2019-12-27 21:38:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31050 states. [2019-12-27 21:38:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31050 states to 31050 states and 96522 transitions. [2019-12-27 21:38:25,498 INFO L78 Accepts]: Start accepts. Automaton has 31050 states and 96522 transitions. Word has length 65 [2019-12-27 21:38:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:25,499 INFO L462 AbstractCegarLoop]: Abstraction has 31050 states and 96522 transitions. [2019-12-27 21:38:25,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:38:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 31050 states and 96522 transitions. [2019-12-27 21:38:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:38:25,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:25,533 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:25,533 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:25,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:25,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1631986328, now seen corresponding path program 2 times [2019-12-27 21:38:25,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:25,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755908842] [2019-12-27 21:38:25,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:25,639 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 21:38:25,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755908842] [2019-12-27 21:38:25,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:25,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:38:25,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [889651465] [2019-12-27 21:38:25,641 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:25,665 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:25,994 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 254 states and 497 transitions. [2019-12-27 21:38:25,994 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:26,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:38:26,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:38:26,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:38:26,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:38:26,289 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 21:38:26,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:38:26,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:26,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:38:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:38:26,290 INFO L87 Difference]: Start difference. First operand 31050 states and 96522 transitions. Second operand 12 states. [2019-12-27 21:38:28,465 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 21:38:29,227 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 21:38:29,401 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 21:38:30,284 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 21:38:33,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:33,623 INFO L93 Difference]: Finished difference Result 145008 states and 441349 transitions. [2019-12-27 21:38:33,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-27 21:38:33,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 21:38:33,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:33,810 INFO L225 Difference]: With dead ends: 145008 [2019-12-27 21:38:33,810 INFO L226 Difference]: Without dead ends: 119327 [2019-12-27 21:38:33,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=784, Invalid=3376, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 21:38:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119327 states. [2019-12-27 21:38:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119327 to 31635. [2019-12-27 21:38:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31635 states. [2019-12-27 21:38:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31635 states to 31635 states and 98776 transitions. [2019-12-27 21:38:34,993 INFO L78 Accepts]: Start accepts. Automaton has 31635 states and 98776 transitions. Word has length 65 [2019-12-27 21:38:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:34,993 INFO L462 AbstractCegarLoop]: Abstraction has 31635 states and 98776 transitions. [2019-12-27 21:38:34,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:38:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 31635 states and 98776 transitions. [2019-12-27 21:38:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:38:35,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:35,026 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 21:38:35,026 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 21:38:35,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:35,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1607407314, now seen corresponding path program 1 times [2019-12-27 21:38:35,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:35,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981205073] [2019-12-27 21:38:35,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:35,105 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 21:38:35,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981205073] [2019-12-27 21:38:35,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:35,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:38:35,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1891538159] [2019-12-27 21:38:35,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:35,125 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:35,320 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 273 transitions. [2019-12-27 21:38:35,320 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:35,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:38:35,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:38:35,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:35,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:38:35,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:38:35,369 INFO L87 Difference]: Start difference. First operand 31635 states and 98776 transitions. Second operand 5 states. [2019-12-27 21:38:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:36,895 INFO L93 Difference]: Finished difference Result 48003 states and 146796 transitions. [2019-12-27 21:38:36,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:38:36,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 21:38:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:36,962 INFO L225 Difference]: With dead ends: 48003 [2019-12-27 21:38:36,962 INFO L226 Difference]: Without dead ends: 47783 [2019-12-27 21:38:36,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:38:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47783 states. [2019-12-27 21:38:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47783 to 37821. [2019-12-27 21:38:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37821 states. [2019-12-27 21:38:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37821 states to 37821 states and 117767 transitions. [2019-12-27 21:38:37,601 INFO L78 Accepts]: Start accepts. Automaton has 37821 states and 117767 transitions. Word has length 65 [2019-12-27 21:38:37,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:37,601 INFO L462 AbstractCegarLoop]: Abstraction has 37821 states and 117767 transitions. [2019-12-27 21:38:37,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:38:37,601 INFO L276 IsEmpty]: Start isEmpty. Operand 37821 states and 117767 transitions. [2019-12-27 21:38:37,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:38:37,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:37,640 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 21:38:37,640 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 21:38:37,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:37,640 INFO L82 PathProgramCache]: Analyzing trace with hash 99240326, now seen corresponding path program 2 times [2019-12-27 21:38:37,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:37,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804504503] [2019-12-27 21:38:37,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:37,763 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 21:38:37,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804504503] [2019-12-27 21:38:37,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:37,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:38:37,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [211628585] [2019-12-27 21:38:37,764 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:37,783 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:37,943 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 304 transitions. [2019-12-27 21:38:37,943 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:38,047 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:38:38,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:38:38,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:38,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:38:38,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:38:38,048 INFO L87 Difference]: Start difference. First operand 37821 states and 117767 transitions. Second operand 12 states. [2019-12-27 21:38:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:41,117 INFO L93 Difference]: Finished difference Result 72164 states and 220001 transitions. [2019-12-27 21:38:41,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 21:38:41,117 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 21:38:41,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:41,244 INFO L225 Difference]: With dead ends: 72164 [2019-12-27 21:38:41,245 INFO L226 Difference]: Without dead ends: 72038 [2019-12-27 21:38:41,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-12-27 21:38:41,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72038 states. [2019-12-27 21:38:42,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72038 to 40078. [2019-12-27 21:38:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40078 states. [2019-12-27 21:38:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40078 states to 40078 states and 124479 transitions. [2019-12-27 21:38:42,635 INFO L78 Accepts]: Start accepts. Automaton has 40078 states and 124479 transitions. Word has length 65 [2019-12-27 21:38:42,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:42,635 INFO L462 AbstractCegarLoop]: Abstraction has 40078 states and 124479 transitions. [2019-12-27 21:38:42,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:38:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand 40078 states and 124479 transitions. [2019-12-27 21:38:42,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:38:42,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:42,681 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 21:38:42,682 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 21:38:42,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:42,682 INFO L82 PathProgramCache]: Analyzing trace with hash -154311598, now seen corresponding path program 3 times [2019-12-27 21:38:42,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:42,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696399880] [2019-12-27 21:38:42,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:42,833 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 21:38:42,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696399880] [2019-12-27 21:38:42,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:42,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:38:42,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [688535212] [2019-12-27 21:38:42,834 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:42,850 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:43,004 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 248 transitions. [2019-12-27 21:38:43,004 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:43,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:38:43,154 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:38:43,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:38:43,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:43,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:38:43,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:38:43,155 INFO L87 Difference]: Start difference. First operand 40078 states and 124479 transitions. Second operand 15 states. [2019-12-27 21:38:49,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:49,823 INFO L93 Difference]: Finished difference Result 72344 states and 219755 transitions. [2019-12-27 21:38:49,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 21:38:49,824 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-12-27 21:38:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:49,947 INFO L225 Difference]: With dead ends: 72344 [2019-12-27 21:38:49,947 INFO L226 Difference]: Without dead ends: 72048 [2019-12-27 21:38:49,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=631, Invalid=3029, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 21:38:50,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72048 states. [2019-12-27 21:38:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72048 to 41610. [2019-12-27 21:38:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41610 states. [2019-12-27 21:38:50,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41610 states to 41610 states and 128853 transitions. [2019-12-27 21:38:50,952 INFO L78 Accepts]: Start accepts. Automaton has 41610 states and 128853 transitions. Word has length 65 [2019-12-27 21:38:50,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:50,952 INFO L462 AbstractCegarLoop]: Abstraction has 41610 states and 128853 transitions. [2019-12-27 21:38:50,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:38:50,952 INFO L276 IsEmpty]: Start isEmpty. Operand 41610 states and 128853 transitions. [2019-12-27 21:38:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:38:51,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:51,014 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 21:38:51,014 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 21:38:51,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:51,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1583496514, now seen corresponding path program 4 times [2019-12-27 21:38:51,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:51,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189282863] [2019-12-27 21:38:51,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:51,068 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 21:38:51,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189282863] [2019-12-27 21:38:51,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:51,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:38:51,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1250308166] [2019-12-27 21:38:51,069 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:51,082 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:51,254 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 179 states and 288 transitions. [2019-12-27 21:38:51,254 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:51,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:38:51,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:38:51,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:51,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:38:51,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:38:51,309 INFO L87 Difference]: Start difference. First operand 41610 states and 128853 transitions. Second operand 6 states. [2019-12-27 21:38:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:51,891 INFO L93 Difference]: Finished difference Result 42552 states and 129377 transitions. [2019-12-27 21:38:51,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:38:51,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 21:38:51,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:51,956 INFO L225 Difference]: With dead ends: 42552 [2019-12-27 21:38:51,957 INFO L226 Difference]: Without dead ends: 42552 [2019-12-27 21:38:51,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:38:52,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42552 states. [2019-12-27 21:38:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42552 to 32392. [2019-12-27 21:38:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32392 states. [2019-12-27 21:38:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32392 states to 32392 states and 98676 transitions. [2019-12-27 21:38:52,962 INFO L78 Accepts]: Start accepts. Automaton has 32392 states and 98676 transitions. Word has length 65 [2019-12-27 21:38:52,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:52,963 INFO L462 AbstractCegarLoop]: Abstraction has 32392 states and 98676 transitions. [2019-12-27 21:38:52,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:38:52,963 INFO L276 IsEmpty]: Start isEmpty. Operand 32392 states and 98676 transitions. [2019-12-27 21:38:53,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:38:53,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:53,003 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 21:38:53,004 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 21:38:53,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:53,004 INFO L82 PathProgramCache]: Analyzing trace with hash 199812966, now seen corresponding path program 1 times [2019-12-27 21:38:53,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:53,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255370377] [2019-12-27 21:38:53,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:53,153 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 21:38:53,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255370377] [2019-12-27 21:38:53,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:53,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:38:53,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [642308044] [2019-12-27 21:38:53,154 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:53,171 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:53,418 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 334 states and 689 transitions. [2019-12-27 21:38:53,419 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:53,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:38:53,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:38:53,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:38:53,888 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 37 times. [2019-12-27 21:38:53,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 21:38:53,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:53,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 21:38:53,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:38:53,889 INFO L87 Difference]: Start difference. First operand 32392 states and 98676 transitions. Second operand 20 states. [2019-12-27 21:39:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:00,083 INFO L93 Difference]: Finished difference Result 49559 states and 147371 transitions. [2019-12-27 21:39:00,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 21:39:00,084 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-27 21:39:00,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:00,185 INFO L225 Difference]: With dead ends: 49559 [2019-12-27 21:39:00,185 INFO L226 Difference]: Without dead ends: 49559 [2019-12-27 21:39:00,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 33 SyntacticMatches, 13 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=572, Invalid=3210, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 21:39:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49559 states. [2019-12-27 21:39:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49559 to 32068. [2019-12-27 21:39:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32068 states. [2019-12-27 21:39:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32068 states to 32068 states and 97907 transitions. [2019-12-27 21:39:01,121 INFO L78 Accepts]: Start accepts. Automaton has 32068 states and 97907 transitions. Word has length 66 [2019-12-27 21:39:01,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:01,121 INFO L462 AbstractCegarLoop]: Abstraction has 32068 states and 97907 transitions. [2019-12-27 21:39:01,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 21:39:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 32068 states and 97907 transitions. [2019-12-27 21:39:01,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:39:01,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:01,165 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 21:39:01,165 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 21:39:01,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:01,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1022991488, now seen corresponding path program 2 times [2019-12-27 21:39:01,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:01,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753811708] [2019-12-27 21:39:01,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:01,314 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 21:39:01,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753811708] [2019-12-27 21:39:01,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:01,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:39:01,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [467825413] [2019-12-27 21:39:01,316 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:01,332 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:01,651 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 265 states and 507 transitions. [2019-12-27 21:39:01,651 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:01,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:39:02,031 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 21:39:02,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:39:02,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:02,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:39:02,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:39:02,033 INFO L87 Difference]: Start difference. First operand 32068 states and 97907 transitions. Second operand 15 states. [2019-12-27 21:39:04,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:04,971 INFO L93 Difference]: Finished difference Result 58392 states and 176550 transitions. [2019-12-27 21:39:04,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:39:04,972 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 21:39:04,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:05,042 INFO L225 Difference]: With dead ends: 58392 [2019-12-27 21:39:05,042 INFO L226 Difference]: Without dead ends: 45624 [2019-12-27 21:39:05,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2019-12-27 21:39:05,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45624 states. [2019-12-27 21:39:05,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45624 to 32494. [2019-12-27 21:39:05,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32494 states. [2019-12-27 21:39:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32494 states to 32494 states and 98771 transitions. [2019-12-27 21:39:05,659 INFO L78 Accepts]: Start accepts. Automaton has 32494 states and 98771 transitions. Word has length 66 [2019-12-27 21:39:05,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:05,659 INFO L462 AbstractCegarLoop]: Abstraction has 32494 states and 98771 transitions. [2019-12-27 21:39:05,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:39:05,660 INFO L276 IsEmpty]: Start isEmpty. Operand 32494 states and 98771 transitions. [2019-12-27 21:39:05,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:39:05,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:05,696 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 21:39:05,696 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:05,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:05,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1990266554, now seen corresponding path program 1 times [2019-12-27 21:39:05,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:05,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775468826] [2019-12-27 21:39:05,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:05,763 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 21:39:05,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775468826] [2019-12-27 21:39:05,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:05,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:39:05,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2108732766] [2019-12-27 21:39:05,764 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:05,778 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:06,256 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 246 states and 469 transitions. [2019-12-27 21:39:06,256 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:06,296 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:39:06,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:39:06,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:06,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:39:06,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:39:06,297 INFO L87 Difference]: Start difference. First operand 32494 states and 98771 transitions. Second operand 4 states. [2019-12-27 21:39:06,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:06,460 INFO L93 Difference]: Finished difference Result 32494 states and 98484 transitions. [2019-12-27 21:39:06,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:39:06,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 21:39:06,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:06,510 INFO L225 Difference]: With dead ends: 32494 [2019-12-27 21:39:06,510 INFO L226 Difference]: Without dead ends: 32494 [2019-12-27 21:39:06,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 8 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 21:39:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32494 states. [2019-12-27 21:39:06,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32494 to 29944. [2019-12-27 21:39:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29944 states. [2019-12-27 21:39:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29944 states to 29944 states and 90721 transitions. [2019-12-27 21:39:07,008 INFO L78 Accepts]: Start accepts. Automaton has 29944 states and 90721 transitions. Word has length 66 [2019-12-27 21:39:07,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:07,009 INFO L462 AbstractCegarLoop]: Abstraction has 29944 states and 90721 transitions. [2019-12-27 21:39:07,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:39:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 29944 states and 90721 transitions. [2019-12-27 21:39:07,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:39:07,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:07,045 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 21:39:07,045 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:07,046 INFO L82 PathProgramCache]: Analyzing trace with hash -855039682, now seen corresponding path program 3 times [2019-12-27 21:39:07,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:07,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611228912] [2019-12-27 21:39:07,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:07,114 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 21:39:07,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611228912] [2019-12-27 21:39:07,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:07,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:07,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1583069566] [2019-12-27 21:39:07,115 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:07,128 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:07,330 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 338 transitions. [2019-12-27 21:39:07,331 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:07,331 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:07,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:07,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:07,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:07,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:07,333 INFO L87 Difference]: Start difference. First operand 29944 states and 90721 transitions. Second operand 3 states. [2019-12-27 21:39:07,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:07,468 INFO L93 Difference]: Finished difference Result 29944 states and 90720 transitions. [2019-12-27 21:39:07,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:07,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 21:39:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:07,519 INFO L225 Difference]: With dead ends: 29944 [2019-12-27 21:39:07,520 INFO L226 Difference]: Without dead ends: 29944 [2019-12-27 21:39:07,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29944 states. [2019-12-27 21:39:08,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29944 to 23499. [2019-12-27 21:39:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23499 states. [2019-12-27 21:39:08,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23499 states to 23499 states and 72498 transitions. [2019-12-27 21:39:08,219 INFO L78 Accepts]: Start accepts. Automaton has 23499 states and 72498 transitions. Word has length 66 [2019-12-27 21:39:08,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:08,219 INFO L462 AbstractCegarLoop]: Abstraction has 23499 states and 72498 transitions. [2019-12-27 21:39:08,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:08,219 INFO L276 IsEmpty]: Start isEmpty. Operand 23499 states and 72498 transitions. [2019-12-27 21:39:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:39:08,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:08,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:08,247 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:08,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:08,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1134321916, now seen corresponding path program 1 times [2019-12-27 21:39:08,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:08,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443144243] [2019-12-27 21:39:08,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:08,662 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 21:39:08,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443144243] [2019-12-27 21:39:08,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:08,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 21:39:08,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [636472793] [2019-12-27 21:39:08,663 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:08,675 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:08,928 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 335 states and 690 transitions. [2019-12-27 21:39:08,928 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:09,346 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-27 21:39:09,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:39:10,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:39:10,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:39:10,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:39:10,605 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 40 times. [2019-12-27 21:39:10,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 21:39:10,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:10,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 21:39:10,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2019-12-27 21:39:10,606 INFO L87 Difference]: Start difference. First operand 23499 states and 72498 transitions. Second operand 30 states. [2019-12-27 21:39:13,688 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-12-27 21:39:34,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:34,372 INFO L93 Difference]: Finished difference Result 95281 states and 286674 transitions. [2019-12-27 21:39:34,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-12-27 21:39:34,372 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-27 21:39:34,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:34,486 INFO L225 Difference]: With dead ends: 95281 [2019-12-27 21:39:34,486 INFO L226 Difference]: Without dead ends: 75359 [2019-12-27 21:39:34,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 17 SyntacticMatches, 16 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9939 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=3689, Invalid=24703, Unknown=0, NotChecked=0, Total=28392 [2019-12-27 21:39:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75359 states. [2019-12-27 21:39:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75359 to 26952. [2019-12-27 21:39:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26952 states. [2019-12-27 21:39:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26952 states to 26952 states and 82851 transitions. [2019-12-27 21:39:35,262 INFO L78 Accepts]: Start accepts. Automaton has 26952 states and 82851 transitions. Word has length 67 [2019-12-27 21:39:35,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:35,262 INFO L462 AbstractCegarLoop]: Abstraction has 26952 states and 82851 transitions. [2019-12-27 21:39:35,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 21:39:35,262 INFO L276 IsEmpty]: Start isEmpty. Operand 26952 states and 82851 transitions. [2019-12-27 21:39:35,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:39:35,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:35,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:35,291 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:35,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:35,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1579837296, now seen corresponding path program 2 times [2019-12-27 21:39:35,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:35,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941749082] [2019-12-27 21:39:35,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:35,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941749082] [2019-12-27 21:39:35,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:35,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 21:39:35,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1895034991] [2019-12-27 21:39:35,719 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:35,744 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:36,306 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 356 states and 741 transitions. [2019-12-27 21:39:36,306 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:37,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:39:37,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:39:37,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:39:37,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:39:38,058 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 49 times. [2019-12-27 21:39:38,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 21:39:38,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:38,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 21:39:38,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 21:39:38,060 INFO L87 Difference]: Start difference. First operand 26952 states and 82851 transitions. Second operand 33 states. [2019-12-27 21:39:38,557 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-27 21:39:38,812 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-27 21:40:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:40:04,442 INFO L93 Difference]: Finished difference Result 89107 states and 268195 transitions. [2019-12-27 21:40:04,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-12-27 21:40:04,442 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 67 [2019-12-27 21:40:04,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:40:04,570 INFO L225 Difference]: With dead ends: 89107 [2019-12-27 21:40:04,571 INFO L226 Difference]: Without dead ends: 82021 [2019-12-27 21:40:04,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 16 SyntacticMatches, 17 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11460 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=4060, Invalid=28882, Unknown=0, NotChecked=0, Total=32942 [2019-12-27 21:40:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82021 states. [2019-12-27 21:40:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82021 to 32684. [2019-12-27 21:40:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32684 states. [2019-12-27 21:40:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32684 states to 32684 states and 100858 transitions. [2019-12-27 21:40:05,653 INFO L78 Accepts]: Start accepts. Automaton has 32684 states and 100858 transitions. Word has length 67 [2019-12-27 21:40:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:40:05,654 INFO L462 AbstractCegarLoop]: Abstraction has 32684 states and 100858 transitions. [2019-12-27 21:40:05,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 21:40:05,654 INFO L276 IsEmpty]: Start isEmpty. Operand 32684 states and 100858 transitions. [2019-12-27 21:40:05,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:40:05,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:40:05,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:40:05,690 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:40:05,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:40:05,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2122626696, now seen corresponding path program 3 times [2019-12-27 21:40:05,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:40:05,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832700375] [2019-12-27 21:40:05,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:40:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:40:06,247 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 21:40:06,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832700375] [2019-12-27 21:40:06,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:40:06,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 21:40:06,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [170165044] [2019-12-27 21:40:06,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:40:06,270 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:40:06,657 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 364 states and 767 transitions. [2019-12-27 21:40:06,658 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:40:07,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:40:07,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:40:07,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:40:07,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:40:08,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 54 times. [2019-12-27 21:40:08,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 21:40:08,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:40:08,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 21:40:08,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 21:40:08,503 INFO L87 Difference]: Start difference. First operand 32684 states and 100858 transitions. Second operand 34 states. [2019-12-27 21:40:29,627 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-12-27 21:40:32,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:40:32,479 INFO L93 Difference]: Finished difference Result 83828 states and 251996 transitions. [2019-12-27 21:40:32,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-12-27 21:40:32,480 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2019-12-27 21:40:32,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:40:32,606 INFO L225 Difference]: With dead ends: 83828 [2019-12-27 21:40:32,606 INFO L226 Difference]: Without dead ends: 82929 [2019-12-27 21:40:32,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 19 SyntacticMatches, 22 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8556 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=3097, Invalid=22663, Unknown=0, NotChecked=0, Total=25760 [2019-12-27 21:40:32,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82929 states. [2019-12-27 21:40:33,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82929 to 32696. [2019-12-27 21:40:33,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32696 states. [2019-12-27 21:40:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32696 states to 32696 states and 100890 transitions. [2019-12-27 21:40:33,490 INFO L78 Accepts]: Start accepts. Automaton has 32696 states and 100890 transitions. Word has length 67 [2019-12-27 21:40:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:40:33,491 INFO L462 AbstractCegarLoop]: Abstraction has 32696 states and 100890 transitions. [2019-12-27 21:40:33,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 21:40:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 32696 states and 100890 transitions. [2019-12-27 21:40:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:40:33,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:40:33,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:40:33,530 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:40:33,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:40:33,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2065181176, now seen corresponding path program 4 times [2019-12-27 21:40:33,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:40:33,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519040555] [2019-12-27 21:40:33,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:40:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:40:33,706 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 21:40:33,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519040555] [2019-12-27 21:40:33,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:40:33,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:40:33,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2050805262] [2019-12-27 21:40:33,707 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:40:33,716 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:40:33,960 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 307 states and 621 transitions. [2019-12-27 21:40:33,960 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:40:34,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:40:34,838 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 39 times. [2019-12-27 21:40:34,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 21:40:34,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:40:34,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 21:40:34,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:40:34,839 INFO L87 Difference]: Start difference. First operand 32696 states and 100890 transitions. Second operand 23 states. [2019-12-27 21:40:38,173 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-27 21:40:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:40:45,829 INFO L93 Difference]: Finished difference Result 82522 states and 250332 transitions. [2019-12-27 21:40:45,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-12-27 21:40:45,830 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-12-27 21:40:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:40:45,957 INFO L225 Difference]: With dead ends: 82522 [2019-12-27 21:40:45,957 INFO L226 Difference]: Without dead ends: 80205 [2019-12-27 21:40:45,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 15 SyntacticMatches, 14 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4481 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1760, Invalid=11580, Unknown=0, NotChecked=0, Total=13340 [2019-12-27 21:40:46,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80205 states. [2019-12-27 21:40:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80205 to 32502. [2019-12-27 21:40:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32502 states. [2019-12-27 21:40:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32502 states to 32502 states and 100304 transitions. [2019-12-27 21:40:46,845 INFO L78 Accepts]: Start accepts. Automaton has 32502 states and 100304 transitions. Word has length 67 [2019-12-27 21:40:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:40:46,845 INFO L462 AbstractCegarLoop]: Abstraction has 32502 states and 100304 transitions. [2019-12-27 21:40:46,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 21:40:46,845 INFO L276 IsEmpty]: Start isEmpty. Operand 32502 states and 100304 transitions. [2019-12-27 21:40:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:40:46,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:40:46,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:40:46,882 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:40:46,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:40:46,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1596380696, now seen corresponding path program 5 times [2019-12-27 21:40:46,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:40:46,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682238536] [2019-12-27 21:40:46,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:40:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2019-12-27 21:40:47,019 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 21:40:47,023 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 21:40:47,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:40:47 BasicIcfg [2019-12-27 21:40:47,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:40:47,029 INFO L168 Benchmark]: Toolchain (without parser) took 225877.18 ms. Allocated memory was 138.9 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 99.4 MB in the beginning and 613.7 MB in the end (delta: -514.3 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2019-12-27 21:40:47,029 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 138.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:40:47,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.14 ms. Allocated memory was 138.9 MB in the beginning and 200.3 MB in the end (delta: 61.3 MB). Free memory was 99.2 MB in the beginning and 153.4 MB in the end (delta: -54.2 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:40:47,032 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.87 ms. Allocated memory is still 200.3 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:40:47,033 INFO L168 Benchmark]: Boogie Preprocessor took 52.23 ms. Allocated memory is still 200.3 MB. Free memory was 150.7 MB in the beginning and 148.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:40:47,033 INFO L168 Benchmark]: RCFGBuilder took 896.76 ms. Allocated memory is still 200.3 MB. Free memory was 148.6 MB in the beginning and 98.4 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:40:47,033 INFO L168 Benchmark]: TraceAbstraction took 224080.78 ms. Allocated memory was 200.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 98.4 MB in the beginning and 613.7 MB in the end (delta: -515.3 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 21:40:47,037 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.26 ms. Allocated memory is still 138.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 750.14 ms. Allocated memory was 138.9 MB in the beginning and 200.3 MB in the end (delta: 61.3 MB). Free memory was 99.2 MB in the beginning and 153.4 MB in the end (delta: -54.2 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 91.87 ms. Allocated memory is still 200.3 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.23 ms. Allocated memory is still 200.3 MB. Free memory was 150.7 MB in the beginning and 148.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 896.76 ms. Allocated memory is still 200.3 MB. Free memory was 148.6 MB in the beginning and 98.4 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 224080.78 ms. Allocated memory was 200.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 98.4 MB in the beginning and 613.7 MB in the end (delta: -515.3 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6848 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 66 interpolants. - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 66 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: TIMEOUT, OverallTime: 223.8s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 138.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9182 SDtfs, 25181 SDslu, 43733 SDs, 0 SdLazy, 57816 SolverSat, 1907 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 71.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1480 GetRequests, 276 SyntacticMatches, 183 SemanticMatches, 1021 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38740 ImplicationChecksByTransitivity, 43.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 45.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 664334 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1534 NumberOfCodeBlocks, 1534 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1504 ConstructedInterpolants, 0 QuantifiedInterpolants, 359629 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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