/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/mix015_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:09:02,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:09:02,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:09:02,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:09:02,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:09:02,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:09:02,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:09:02,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:09:02,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:09:02,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:09:03,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:09:03,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:09:03,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:09:03,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:09:03,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:09:03,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:09:03,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:09:03,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:09:03,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:09:03,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:09:03,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:09:03,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:09:03,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:09:03,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:09:03,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:09:03,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:09:03,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:09:03,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:09:03,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:09:03,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:09:03,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:09:03,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:09:03,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:09:03,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:09:03,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:09:03,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:09:03,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:09:03,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:09:03,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:09:03,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:09:03,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:09:03,039 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 20:09:03,066 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:09:03,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:09:03,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:09:03,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:09:03,071 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:09:03,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:09:03,072 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:09:03,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:09:03,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:09:03,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:09:03,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:09:03,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:09:03,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:09:03,073 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:09:03,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:09:03,073 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:09:03,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:09:03,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:09:03,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:09:03,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:09:03,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:09:03,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:09:03,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:09:03,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:09:03,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:09:03,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:09:03,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:09:03,081 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:09:03,081 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:09:03,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:09:03,082 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:09:03,082 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:09:03,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:09:03,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:09:03,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:09:03,391 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:09:03,393 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:09:03,395 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_rmo.oepc.i [2019-12-27 20:09:03,457 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ce10225/e264639d9f0444c2b41e3b6e2a6de442/FLAGd400a2782 [2019-12-27 20:09:03,993 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:09:03,994 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_rmo.oepc.i [2019-12-27 20:09:04,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ce10225/e264639d9f0444c2b41e3b6e2a6de442/FLAGd400a2782 [2019-12-27 20:09:04,295 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ce10225/e264639d9f0444c2b41e3b6e2a6de442 [2019-12-27 20:09:04,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:09:04,308 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:09:04,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:09:04,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:09:04,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:09:04,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:09:04" (1/1) ... [2019-12-27 20:09:04,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc7b548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:04, skipping insertion in model container [2019-12-27 20:09:04,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:09:04" (1/1) ... [2019-12-27 20:09:04,324 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:09:04,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:09:04,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:09:04,890 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:09:04,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:09:05,057 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:09:05,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:05 WrapperNode [2019-12-27 20:09:05,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:09:05,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:09:05,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:09:05,059 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:09:05,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:05" (1/1) ... [2019-12-27 20:09:05,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:05" (1/1) ... [2019-12-27 20:09:05,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:09:05,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:09:05,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:09:05,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:09:05,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:05" (1/1) ... [2019-12-27 20:09:05,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:05" (1/1) ... [2019-12-27 20:09:05,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:05" (1/1) ... [2019-12-27 20:09:05,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:05" (1/1) ... [2019-12-27 20:09:05,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:05" (1/1) ... [2019-12-27 20:09:05,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:05" (1/1) ... [2019-12-27 20:09:05,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:05" (1/1) ... [2019-12-27 20:09:05,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:09:05,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:09:05,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:09:05,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:09:05,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:05" (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 20:09:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:09:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:09:05,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:09:05,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:09:05,236 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:09:05,237 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:09:05,237 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:09:05,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:09:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:09:05,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:09:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:09:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:09:05,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:09:05,240 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 20:09:06,083 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:09:06,083 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:09:06,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:09:06 BoogieIcfgContainer [2019-12-27 20:09:06,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:09:06,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:09:06,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:09:06,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:09:06,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:09:04" (1/3) ... [2019-12-27 20:09:06,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0b5c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:09:06, skipping insertion in model container [2019-12-27 20:09:06,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:05" (2/3) ... [2019-12-27 20:09:06,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0b5c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:09:06, skipping insertion in model container [2019-12-27 20:09:06,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:09:06" (3/3) ... [2019-12-27 20:09:06,094 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_rmo.oepc.i [2019-12-27 20:09:06,105 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:09:06,105 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:09:06,113 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:09:06,114 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:09:06,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,159 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,159 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,160 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,160 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,161 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,185 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,186 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,193 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,194 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,221 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,223 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,231 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,231 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,232 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,233 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,234 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:09:06,250 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:09:06,271 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:09:06,271 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:09:06,271 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:09:06,271 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:09:06,271 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:09:06,272 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:09:06,272 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:09:06,272 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:09:06,289 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 20:09:06,291 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 20:09:06,396 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 20:09:06,396 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:09:06,415 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:09:06,442 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 20:09:06,497 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 20:09:06,497 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:09:06,506 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:09:06,528 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 20:09:06,530 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:09:10,215 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 20:09:10,367 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 20:09:10,457 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83227 [2019-12-27 20:09:10,457 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 20:09:10,461 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-27 20:09:29,107 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120962 states. [2019-12-27 20:09:29,109 INFO L276 IsEmpty]: Start isEmpty. Operand 120962 states. [2019-12-27 20:09:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:09:29,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:29,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:09:29,117 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 20:09:29,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:29,122 INFO L82 PathProgramCache]: Analyzing trace with hash 919898, now seen corresponding path program 1 times [2019-12-27 20:09:29,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:29,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401966953] [2019-12-27 20:09:29,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:29,320 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 20:09:29,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401966953] [2019-12-27 20:09:29,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:29,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:09:29,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [248139905] [2019-12-27 20:09:29,323 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:29,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:29,338 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:09:29,338 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:29,341 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:09:29,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:09:29,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:29,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:09:29,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:09:29,359 INFO L87 Difference]: Start difference. First operand 120962 states. Second operand 3 states. [2019-12-27 20:09:32,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:32,396 INFO L93 Difference]: Finished difference Result 119798 states and 510282 transitions. [2019-12-27 20:09:32,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:09:32,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:09:32,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:33,121 INFO L225 Difference]: With dead ends: 119798 [2019-12-27 20:09:33,121 INFO L226 Difference]: Without dead ends: 112910 [2019-12-27 20:09:33,123 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 20:09:40,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112910 states. [2019-12-27 20:09:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112910 to 112910. [2019-12-27 20:09:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112910 states. [2019-12-27 20:09:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112910 states to 112910 states and 480308 transitions. [2019-12-27 20:09:47,970 INFO L78 Accepts]: Start accepts. Automaton has 112910 states and 480308 transitions. Word has length 3 [2019-12-27 20:09:47,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:47,971 INFO L462 AbstractCegarLoop]: Abstraction has 112910 states and 480308 transitions. [2019-12-27 20:09:47,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:09:47,971 INFO L276 IsEmpty]: Start isEmpty. Operand 112910 states and 480308 transitions. [2019-12-27 20:09:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:09:47,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:47,978 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:47,978 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 20:09:47,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:47,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1163520711, now seen corresponding path program 1 times [2019-12-27 20:09:47,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:47,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054955779] [2019-12-27 20:09:47,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:48,147 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 20:09:48,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054955779] [2019-12-27 20:09:48,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:48,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:09:48,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1587758211] [2019-12-27 20:09:48,149 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:48,150 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:48,154 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:09:48,154 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:48,154 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:09:48,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:09:48,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:48,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:09:48,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:09:48,156 INFO L87 Difference]: Start difference. First operand 112910 states and 480308 transitions. Second operand 4 states. [2019-12-27 20:09:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:50,353 INFO L93 Difference]: Finished difference Result 175260 states and 715456 transitions. [2019-12-27 20:09:50,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:09:50,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:09:50,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:51,178 INFO L225 Difference]: With dead ends: 175260 [2019-12-27 20:09:51,179 INFO L226 Difference]: Without dead ends: 175211 [2019-12-27 20:09:51,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:10:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175211 states. [2019-12-27 20:10:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175211 to 160651. [2019-12-27 20:10:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160651 states. [2019-12-27 20:10:11,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160651 states to 160651 states and 663882 transitions. [2019-12-27 20:10:11,296 INFO L78 Accepts]: Start accepts. Automaton has 160651 states and 663882 transitions. Word has length 11 [2019-12-27 20:10:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:11,297 INFO L462 AbstractCegarLoop]: Abstraction has 160651 states and 663882 transitions. [2019-12-27 20:10:11,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:10:11,297 INFO L276 IsEmpty]: Start isEmpty. Operand 160651 states and 663882 transitions. [2019-12-27 20:10:11,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:10:11,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:11,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:10:11,305 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 20:10:11,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:11,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1406257601, now seen corresponding path program 1 times [2019-12-27 20:10:11,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:11,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65526621] [2019-12-27 20:10:11,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:11,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 20:10:11,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65526621] [2019-12-27 20:10:11,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:11,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:10:11,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [80085599] [2019-12-27 20:10:11,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:11,379 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:11,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:10:11,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:11,384 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:10:11,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:10:11,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:11,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:10:11,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:10:11,386 INFO L87 Difference]: Start difference. First operand 160651 states and 663882 transitions. Second operand 3 states. [2019-12-27 20:10:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:11,564 INFO L93 Difference]: Finished difference Result 34503 states and 111808 transitions. [2019-12-27 20:10:11,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:10:11,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:10:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:11,631 INFO L225 Difference]: With dead ends: 34503 [2019-12-27 20:10:11,631 INFO L226 Difference]: Without dead ends: 34503 [2019-12-27 20:10:11,631 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 20:10:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34503 states. [2019-12-27 20:10:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34503 to 34503. [2019-12-27 20:10:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34503 states. [2019-12-27 20:10:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34503 states to 34503 states and 111808 transitions. [2019-12-27 20:10:12,381 INFO L78 Accepts]: Start accepts. Automaton has 34503 states and 111808 transitions. Word has length 13 [2019-12-27 20:10:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:12,381 INFO L462 AbstractCegarLoop]: Abstraction has 34503 states and 111808 transitions. [2019-12-27 20:10:12,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:10:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 34503 states and 111808 transitions. [2019-12-27 20:10:12,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:10:12,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:12,384 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:10:12,385 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 20:10:12,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:12,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1992610691, now seen corresponding path program 1 times [2019-12-27 20:10:12,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:12,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835494808] [2019-12-27 20:10:12,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:12,488 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 20:10:12,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835494808] [2019-12-27 20:10:12,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:12,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:10:12,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [457830432] [2019-12-27 20:10:12,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:12,492 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:12,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:10:12,495 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:12,496 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:10:12,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:10:12,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:12,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:10:12,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:10:12,497 INFO L87 Difference]: Start difference. First operand 34503 states and 111808 transitions. Second operand 4 states. [2019-12-27 20:10:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:12,868 INFO L93 Difference]: Finished difference Result 42846 states and 138316 transitions. [2019-12-27 20:10:12,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:10:12,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:10:12,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:12,939 INFO L225 Difference]: With dead ends: 42846 [2019-12-27 20:10:12,939 INFO L226 Difference]: Without dead ends: 42846 [2019-12-27 20:10:12,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:10:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42846 states. [2019-12-27 20:10:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42846 to 38560. [2019-12-27 20:10:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38560 states. [2019-12-27 20:10:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38560 states to 38560 states and 124897 transitions. [2019-12-27 20:10:14,639 INFO L78 Accepts]: Start accepts. Automaton has 38560 states and 124897 transitions. Word has length 16 [2019-12-27 20:10:14,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:14,640 INFO L462 AbstractCegarLoop]: Abstraction has 38560 states and 124897 transitions. [2019-12-27 20:10:14,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:10:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 38560 states and 124897 transitions. [2019-12-27 20:10:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:10:14,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:14,651 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 20:10:14,651 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 20:10:14,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:14,652 INFO L82 PathProgramCache]: Analyzing trace with hash 352437866, now seen corresponding path program 1 times [2019-12-27 20:10:14,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:14,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254510478] [2019-12-27 20:10:14,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:14,796 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 20:10:14,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254510478] [2019-12-27 20:10:14,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:14,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:10:14,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1532051249] [2019-12-27 20:10:14,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:14,804 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:14,813 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 64 transitions. [2019-12-27 20:10:14,813 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:14,816 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:10:14,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:10:14,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:14,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:10:14,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:10:14,818 INFO L87 Difference]: Start difference. First operand 38560 states and 124897 transitions. Second operand 5 states. [2019-12-27 20:10:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:15,512 INFO L93 Difference]: Finished difference Result 49556 states and 157804 transitions. [2019-12-27 20:10:15,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:10:15,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 20:10:15,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:15,599 INFO L225 Difference]: With dead ends: 49556 [2019-12-27 20:10:15,599 INFO L226 Difference]: Without dead ends: 49549 [2019-12-27 20:10:15,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:10:15,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49549 states. [2019-12-27 20:10:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49549 to 38223. [2019-12-27 20:10:16,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38223 states. [2019-12-27 20:10:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38223 states to 38223 states and 123617 transitions. [2019-12-27 20:10:16,899 INFO L78 Accepts]: Start accepts. Automaton has 38223 states and 123617 transitions. Word has length 22 [2019-12-27 20:10:16,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:16,900 INFO L462 AbstractCegarLoop]: Abstraction has 38223 states and 123617 transitions. [2019-12-27 20:10:16,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:10:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 38223 states and 123617 transitions. [2019-12-27 20:10:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:10:16,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:16,916 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 20:10:16,916 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 20:10:16,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:16,917 INFO L82 PathProgramCache]: Analyzing trace with hash -772014791, now seen corresponding path program 1 times [2019-12-27 20:10:16,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:16,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931460753] [2019-12-27 20:10:16,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:16,976 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 20:10:16,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931460753] [2019-12-27 20:10:16,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:16,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:10:16,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1211210240] [2019-12-27 20:10:16,978 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:16,985 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:16,996 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 20:10:16,997 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:17,045 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:10:17,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:10:17,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:17,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:10:17,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:10:17,047 INFO L87 Difference]: Start difference. First operand 38223 states and 123617 transitions. Second operand 5 states. [2019-12-27 20:10:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:17,126 INFO L93 Difference]: Finished difference Result 14858 states and 45301 transitions. [2019-12-27 20:10:17,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:10:17,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:10:17,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:17,149 INFO L225 Difference]: With dead ends: 14858 [2019-12-27 20:10:17,149 INFO L226 Difference]: Without dead ends: 14858 [2019-12-27 20:10:17,150 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 20:10:17,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14858 states. [2019-12-27 20:10:17,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14858 to 14614. [2019-12-27 20:10:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14614 states. [2019-12-27 20:10:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14614 states to 14614 states and 44605 transitions. [2019-12-27 20:10:17,392 INFO L78 Accepts]: Start accepts. Automaton has 14614 states and 44605 transitions. Word has length 25 [2019-12-27 20:10:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:17,393 INFO L462 AbstractCegarLoop]: Abstraction has 14614 states and 44605 transitions. [2019-12-27 20:10:17,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:10:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 14614 states and 44605 transitions. [2019-12-27 20:10:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:10:17,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:17,408 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 20:10:17,408 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 20:10:17,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:17,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1959375522, now seen corresponding path program 1 times [2019-12-27 20:10:17,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:17,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630782679] [2019-12-27 20:10:17,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:10:17,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630782679] [2019-12-27 20:10:17,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:17,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:10:17,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [762683502] [2019-12-27 20:10:17,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:17,494 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:17,501 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:10:17,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:17,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:10:17,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:10:17,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:17,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:10:17,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:10:17,503 INFO L87 Difference]: Start difference. First operand 14614 states and 44605 transitions. Second operand 3 states. [2019-12-27 20:10:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:17,616 INFO L93 Difference]: Finished difference Result 22649 states and 68681 transitions. [2019-12-27 20:10:17,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:10:17,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 20:10:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:17,649 INFO L225 Difference]: With dead ends: 22649 [2019-12-27 20:10:17,650 INFO L226 Difference]: Without dead ends: 22649 [2019-12-27 20:10:17,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:10:17,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22649 states. [2019-12-27 20:10:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22649 to 17220. [2019-12-27 20:10:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17220 states. [2019-12-27 20:10:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17220 states to 17220 states and 53027 transitions. [2019-12-27 20:10:18,304 INFO L78 Accepts]: Start accepts. Automaton has 17220 states and 53027 transitions. Word has length 27 [2019-12-27 20:10:18,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:18,305 INFO L462 AbstractCegarLoop]: Abstraction has 17220 states and 53027 transitions. [2019-12-27 20:10:18,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:10:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 17220 states and 53027 transitions. [2019-12-27 20:10:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:10:18,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:18,317 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 20:10:18,317 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 20:10:18,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:18,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1187835806, now seen corresponding path program 1 times [2019-12-27 20:10:18,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:18,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980678210] [2019-12-27 20:10:18,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:18,422 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 20:10:18,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980678210] [2019-12-27 20:10:18,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:18,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:10:18,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [388681292] [2019-12-27 20:10:18,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:18,428 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:18,433 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:10:18,434 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:18,434 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:10:18,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:10:18,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:18,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:10:18,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:10:18,435 INFO L87 Difference]: Start difference. First operand 17220 states and 53027 transitions. Second operand 6 states. [2019-12-27 20:10:19,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:19,229 INFO L93 Difference]: Finished difference Result 35594 states and 106791 transitions. [2019-12-27 20:10:19,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:10:19,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 20:10:19,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:19,292 INFO L225 Difference]: With dead ends: 35594 [2019-12-27 20:10:19,292 INFO L226 Difference]: Without dead ends: 35594 [2019-12-27 20:10:19,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:10:19,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35594 states. [2019-12-27 20:10:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35594 to 20471. [2019-12-27 20:10:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20471 states. [2019-12-27 20:10:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20471 states to 20471 states and 62707 transitions. [2019-12-27 20:10:19,697 INFO L78 Accepts]: Start accepts. Automaton has 20471 states and 62707 transitions. Word has length 27 [2019-12-27 20:10:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:19,697 INFO L462 AbstractCegarLoop]: Abstraction has 20471 states and 62707 transitions. [2019-12-27 20:10:19,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:10:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 20471 states and 62707 transitions. [2019-12-27 20:10:19,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:10:19,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:19,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:10:19,713 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 20:10:19,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:19,713 INFO L82 PathProgramCache]: Analyzing trace with hash 708131532, now seen corresponding path program 1 times [2019-12-27 20:10:19,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:19,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231314647] [2019-12-27 20:10:19,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:19,830 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 20:10:19,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231314647] [2019-12-27 20:10:19,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:19,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:10:19,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1646471648] [2019-12-27 20:10:19,831 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:19,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:19,848 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 20:10:19,848 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:19,849 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:10:19,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:10:19,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:19,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:10:19,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:10:19,850 INFO L87 Difference]: Start difference. First operand 20471 states and 62707 transitions. Second operand 6 states. [2019-12-27 20:10:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:20,663 INFO L93 Difference]: Finished difference Result 40297 states and 119974 transitions. [2019-12-27 20:10:20,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:10:20,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 20:10:20,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:20,718 INFO L225 Difference]: With dead ends: 40297 [2019-12-27 20:10:20,718 INFO L226 Difference]: Without dead ends: 40297 [2019-12-27 20:10:20,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:10:20,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40297 states. [2019-12-27 20:10:21,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40297 to 21088. [2019-12-27 20:10:21,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21088 states. [2019-12-27 20:10:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21088 states to 21088 states and 65044 transitions. [2019-12-27 20:10:21,514 INFO L78 Accepts]: Start accepts. Automaton has 21088 states and 65044 transitions. Word has length 28 [2019-12-27 20:10:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:21,515 INFO L462 AbstractCegarLoop]: Abstraction has 21088 states and 65044 transitions. [2019-12-27 20:10:21,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:10:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 21088 states and 65044 transitions. [2019-12-27 20:10:21,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:10:21,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:21,538 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 20:10:21,538 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 20:10:21,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:21,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2083615183, now seen corresponding path program 1 times [2019-12-27 20:10:21,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:21,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313817970] [2019-12-27 20:10:21,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:21,623 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 20:10:21,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313817970] [2019-12-27 20:10:21,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:21,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:10:21,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1753336562] [2019-12-27 20:10:21,625 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:21,631 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:21,648 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 76 transitions. [2019-12-27 20:10:21,648 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:21,653 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:10:21,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:10:21,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:21,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:10:21,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:10:21,654 INFO L87 Difference]: Start difference. First operand 21088 states and 65044 transitions. Second operand 5 states. [2019-12-27 20:10:22,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:22,118 INFO L93 Difference]: Finished difference Result 27064 states and 82174 transitions. [2019-12-27 20:10:22,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:10:22,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 20:10:22,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:22,162 INFO L225 Difference]: With dead ends: 27064 [2019-12-27 20:10:22,162 INFO L226 Difference]: Without dead ends: 27064 [2019-12-27 20:10:22,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:10:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27064 states. [2019-12-27 20:10:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27064 to 21997. [2019-12-27 20:10:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21997 states. [2019-12-27 20:10:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21997 states to 21997 states and 67856 transitions. [2019-12-27 20:10:22,555 INFO L78 Accepts]: Start accepts. Automaton has 21997 states and 67856 transitions. Word has length 33 [2019-12-27 20:10:22,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:22,555 INFO L462 AbstractCegarLoop]: Abstraction has 21997 states and 67856 transitions. [2019-12-27 20:10:22,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:10:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 21997 states and 67856 transitions. [2019-12-27 20:10:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:10:22,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:22,581 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 20:10:22,581 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 20:10:22,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:22,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2131169195, now seen corresponding path program 2 times [2019-12-27 20:10:22,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:22,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869464078] [2019-12-27 20:10:22,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:10:22,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869464078] [2019-12-27 20:10:22,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:22,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:10:22,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [402629459] [2019-12-27 20:10:22,709 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:22,715 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:22,735 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 70 transitions. [2019-12-27 20:10:22,735 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:22,736 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:10:22,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:10:22,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:22,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:10:22,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:10:22,738 INFO L87 Difference]: Start difference. First operand 21997 states and 67856 transitions. Second operand 7 states. [2019-12-27 20:10:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:24,718 INFO L93 Difference]: Finished difference Result 46984 states and 140763 transitions. [2019-12-27 20:10:24,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 20:10:24,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 20:10:24,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:24,786 INFO L225 Difference]: With dead ends: 46984 [2019-12-27 20:10:24,786 INFO L226 Difference]: Without dead ends: 46984 [2019-12-27 20:10:24,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:10:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46984 states. [2019-12-27 20:10:25,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46984 to 23476. [2019-12-27 20:10:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23476 states. [2019-12-27 20:10:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23476 states to 23476 states and 72275 transitions. [2019-12-27 20:10:25,320 INFO L78 Accepts]: Start accepts. Automaton has 23476 states and 72275 transitions. Word has length 33 [2019-12-27 20:10:25,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:25,320 INFO L462 AbstractCegarLoop]: Abstraction has 23476 states and 72275 transitions. [2019-12-27 20:10:25,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:10:25,320 INFO L276 IsEmpty]: Start isEmpty. Operand 23476 states and 72275 transitions. [2019-12-27 20:10:25,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:10:25,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:25,339 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 20:10:25,339 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 20:10:25,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:25,340 INFO L82 PathProgramCache]: Analyzing trace with hash 572830043, now seen corresponding path program 3 times [2019-12-27 20:10:25,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:25,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254110969] [2019-12-27 20:10:25,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:25,479 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 20:10:25,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254110969] [2019-12-27 20:10:25,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:25,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:10:25,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1742686120] [2019-12-27 20:10:25,480 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:25,486 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:25,508 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 94 transitions. [2019-12-27 20:10:25,509 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:25,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:25,537 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:10:25,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:10:25,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:25,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:10:25,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:10:25,538 INFO L87 Difference]: Start difference. First operand 23476 states and 72275 transitions. Second operand 9 states. [2019-12-27 20:10:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:29,327 INFO L93 Difference]: Finished difference Result 71534 states and 210870 transitions. [2019-12-27 20:10:29,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 20:10:29,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 20:10:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:29,429 INFO L225 Difference]: With dead ends: 71534 [2019-12-27 20:10:29,430 INFO L226 Difference]: Without dead ends: 71534 [2019-12-27 20:10:29,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=389, Invalid=1333, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 20:10:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71534 states. [2019-12-27 20:10:30,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71534 to 26145. [2019-12-27 20:10:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26145 states. [2019-12-27 20:10:30,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26145 states to 26145 states and 80006 transitions. [2019-12-27 20:10:30,108 INFO L78 Accepts]: Start accepts. Automaton has 26145 states and 80006 transitions. Word has length 33 [2019-12-27 20:10:30,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:30,108 INFO L462 AbstractCegarLoop]: Abstraction has 26145 states and 80006 transitions. [2019-12-27 20:10:30,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:10:30,108 INFO L276 IsEmpty]: Start isEmpty. Operand 26145 states and 80006 transitions. [2019-12-27 20:10:30,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 20:10:30,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:30,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:10:30,132 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 20:10:30,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:30,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1529567545, now seen corresponding path program 1 times [2019-12-27 20:10:30,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:30,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937821921] [2019-12-27 20:10:30,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:30,240 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 20:10:30,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937821921] [2019-12-27 20:10:30,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:30,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:10:30,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [750773052] [2019-12-27 20:10:30,241 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:30,249 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:30,263 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 71 transitions. [2019-12-27 20:10:30,263 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:30,264 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:10:30,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:10:30,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:30,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:10:30,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:10:30,265 INFO L87 Difference]: Start difference. First operand 26145 states and 80006 transitions. Second operand 7 states. [2019-12-27 20:10:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:31,925 INFO L93 Difference]: Finished difference Result 50885 states and 151443 transitions. [2019-12-27 20:10:31,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 20:10:31,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 20:10:31,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:31,999 INFO L225 Difference]: With dead ends: 50885 [2019-12-27 20:10:31,999 INFO L226 Difference]: Without dead ends: 50885 [2019-12-27 20:10:32,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:10:32,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50885 states. [2019-12-27 20:10:32,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50885 to 23731. [2019-12-27 20:10:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23731 states. [2019-12-27 20:10:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23731 states to 23731 states and 72862 transitions. [2019-12-27 20:10:32,950 INFO L78 Accepts]: Start accepts. Automaton has 23731 states and 72862 transitions. Word has length 34 [2019-12-27 20:10:32,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:32,950 INFO L462 AbstractCegarLoop]: Abstraction has 23731 states and 72862 transitions. [2019-12-27 20:10:32,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:10:32,950 INFO L276 IsEmpty]: Start isEmpty. Operand 23731 states and 72862 transitions. [2019-12-27 20:10:32,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 20:10:32,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:32,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:10:32,977 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 20:10:32,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:32,978 INFO L82 PathProgramCache]: Analyzing trace with hash 276051641, now seen corresponding path program 2 times [2019-12-27 20:10:32,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:32,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235554419] [2019-12-27 20:10:32,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:33,128 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 20:10:33,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235554419] [2019-12-27 20:10:33,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:33,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:10:33,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1259190541] [2019-12-27 20:10:33,129 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:33,136 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:33,161 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 98 transitions. [2019-12-27 20:10:33,161 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:33,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:33,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:33,204 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:10:33,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:10:33,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:33,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:10:33,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:10:33,206 INFO L87 Difference]: Start difference. First operand 23731 states and 72862 transitions. Second operand 10 states. [2019-12-27 20:10:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:36,548 INFO L93 Difference]: Finished difference Result 59398 states and 176133 transitions. [2019-12-27 20:10:36,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 20:10:36,549 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-27 20:10:36,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:36,634 INFO L225 Difference]: With dead ends: 59398 [2019-12-27 20:10:36,634 INFO L226 Difference]: Without dead ends: 59398 [2019-12-27 20:10:36,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 20:10:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59398 states. [2019-12-27 20:10:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59398 to 23474. [2019-12-27 20:10:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23474 states. [2019-12-27 20:10:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23474 states to 23474 states and 72038 transitions. [2019-12-27 20:10:37,635 INFO L78 Accepts]: Start accepts. Automaton has 23474 states and 72038 transitions. Word has length 34 [2019-12-27 20:10:37,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:37,635 INFO L462 AbstractCegarLoop]: Abstraction has 23474 states and 72038 transitions. [2019-12-27 20:10:37,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:10:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 23474 states and 72038 transitions. [2019-12-27 20:10:37,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:10:37,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:37,663 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 20:10:37,663 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 20:10:37,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:37,664 INFO L82 PathProgramCache]: Analyzing trace with hash -333124666, now seen corresponding path program 1 times [2019-12-27 20:10:37,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:37,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613286399] [2019-12-27 20:10:37,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:37,716 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 20:10:37,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613286399] [2019-12-27 20:10:37,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:37,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:10:37,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [613497007] [2019-12-27 20:10:37,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:37,725 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:37,769 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 240 transitions. [2019-12-27 20:10:37,769 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:37,831 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:10:37,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:10:37,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:37,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:10:37,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:10:37,833 INFO L87 Difference]: Start difference. First operand 23474 states and 72038 transitions. Second operand 7 states. [2019-12-27 20:10:38,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:38,286 INFO L93 Difference]: Finished difference Result 44665 states and 137703 transitions. [2019-12-27 20:10:38,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:10:38,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 20:10:38,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:38,322 INFO L225 Difference]: With dead ends: 44665 [2019-12-27 20:10:38,323 INFO L226 Difference]: Without dead ends: 24514 [2019-12-27 20:10:38,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:10:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24514 states. [2019-12-27 20:10:38,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24514 to 20759. [2019-12-27 20:10:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20759 states. [2019-12-27 20:10:38,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20759 states to 20759 states and 62731 transitions. [2019-12-27 20:10:38,676 INFO L78 Accepts]: Start accepts. Automaton has 20759 states and 62731 transitions. Word has length 39 [2019-12-27 20:10:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:38,676 INFO L462 AbstractCegarLoop]: Abstraction has 20759 states and 62731 transitions. [2019-12-27 20:10:38,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:10:38,676 INFO L276 IsEmpty]: Start isEmpty. Operand 20759 states and 62731 transitions. [2019-12-27 20:10:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:10:38,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:38,698 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 20:10:38,698 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 20:10:38,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:38,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1572679302, now seen corresponding path program 2 times [2019-12-27 20:10:38,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:38,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026523109] [2019-12-27 20:10:38,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:38,754 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 20:10:38,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026523109] [2019-12-27 20:10:38,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:38,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:10:38,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1802207597] [2019-12-27 20:10:38,755 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:38,763 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:38,820 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 355 transitions. [2019-12-27 20:10:38,821 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:38,822 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:10:38,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:10:38,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:38,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:10:38,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:10:38,823 INFO L87 Difference]: Start difference. First operand 20759 states and 62731 transitions. Second operand 3 states. [2019-12-27 20:10:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:38,898 INFO L93 Difference]: Finished difference Result 20758 states and 62729 transitions. [2019-12-27 20:10:38,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:10:38,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 20:10:38,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:38,926 INFO L225 Difference]: With dead ends: 20758 [2019-12-27 20:10:38,926 INFO L226 Difference]: Without dead ends: 20758 [2019-12-27 20:10:38,926 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 20:10:39,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20758 states. [2019-12-27 20:10:39,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20758 to 20758. [2019-12-27 20:10:39,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20758 states. [2019-12-27 20:10:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20758 states to 20758 states and 62729 transitions. [2019-12-27 20:10:39,235 INFO L78 Accepts]: Start accepts. Automaton has 20758 states and 62729 transitions. Word has length 39 [2019-12-27 20:10:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:39,235 INFO L462 AbstractCegarLoop]: Abstraction has 20758 states and 62729 transitions. [2019-12-27 20:10:39,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:10:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 20758 states and 62729 transitions. [2019-12-27 20:10:39,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:10:39,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:39,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:10:39,257 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 20:10:39,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:39,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1861174117, now seen corresponding path program 1 times [2019-12-27 20:10:39,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:39,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232926502] [2019-12-27 20:10:39,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:39,299 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 20:10:39,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232926502] [2019-12-27 20:10:39,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:39,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:10:39,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1950725221] [2019-12-27 20:10:39,300 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:39,309 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:39,339 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 122 transitions. [2019-12-27 20:10:39,339 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:39,349 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:10:39,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:10:39,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:39,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:10:39,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:10:39,350 INFO L87 Difference]: Start difference. First operand 20758 states and 62729 transitions. Second operand 5 states. [2019-12-27 20:10:39,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:39,995 INFO L93 Difference]: Finished difference Result 47694 states and 143312 transitions. [2019-12-27 20:10:39,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:10:39,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 20:10:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:40,036 INFO L225 Difference]: With dead ends: 47694 [2019-12-27 20:10:40,037 INFO L226 Difference]: Without dead ends: 29336 [2019-12-27 20:10:40,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:10:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29336 states. [2019-12-27 20:10:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29336 to 19200. [2019-12-27 20:10:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19200 states. [2019-12-27 20:10:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19200 states to 19200 states and 56322 transitions. [2019-12-27 20:10:40,380 INFO L78 Accepts]: Start accepts. Automaton has 19200 states and 56322 transitions. Word has length 40 [2019-12-27 20:10:40,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:40,380 INFO L462 AbstractCegarLoop]: Abstraction has 19200 states and 56322 transitions. [2019-12-27 20:10:40,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:10:40,381 INFO L276 IsEmpty]: Start isEmpty. Operand 19200 states and 56322 transitions. [2019-12-27 20:10:40,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:10:40,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:40,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:10:40,399 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 20:10:40,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:40,399 INFO L82 PathProgramCache]: Analyzing trace with hash 437381093, now seen corresponding path program 2 times [2019-12-27 20:10:40,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:40,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9239141] [2019-12-27 20:10:40,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:40,468 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 20:10:40,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9239141] [2019-12-27 20:10:40,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:40,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:10:40,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [542525393] [2019-12-27 20:10:40,470 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:40,478 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:40,560 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 424 transitions. [2019-12-27 20:10:40,561 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:40,611 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:10:40,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:10:40,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:40,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:10:40,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:10:40,612 INFO L87 Difference]: Start difference. First operand 19200 states and 56322 transitions. Second operand 6 states. [2019-12-27 20:10:41,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:41,014 INFO L93 Difference]: Finished difference Result 20213 states and 57944 transitions. [2019-12-27 20:10:41,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:10:41,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 20:10:41,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:41,040 INFO L225 Difference]: With dead ends: 20213 [2019-12-27 20:10:41,040 INFO L226 Difference]: Without dead ends: 20213 [2019-12-27 20:10:41,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:10:41,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20213 states. [2019-12-27 20:10:41,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20213 to 13773. [2019-12-27 20:10:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13773 states. [2019-12-27 20:10:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13773 states to 13773 states and 39393 transitions. [2019-12-27 20:10:41,299 INFO L78 Accepts]: Start accepts. Automaton has 13773 states and 39393 transitions. Word has length 40 [2019-12-27 20:10:41,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:41,299 INFO L462 AbstractCegarLoop]: Abstraction has 13773 states and 39393 transitions. [2019-12-27 20:10:41,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:10:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 13773 states and 39393 transitions. [2019-12-27 20:10:41,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:10:41,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:41,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:10:41,312 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 20:10:41,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:41,312 INFO L82 PathProgramCache]: Analyzing trace with hash 989699623, now seen corresponding path program 1 times [2019-12-27 20:10:41,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:41,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157626361] [2019-12-27 20:10:41,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:41,436 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 20:10:41,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157626361] [2019-12-27 20:10:41,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:41,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:10:41,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1424480489] [2019-12-27 20:10:41,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:41,447 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:41,505 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 255 transitions. [2019-12-27 20:10:41,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:41,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:41,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:42,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 20:10:42,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 20:10:42,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:42,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 20:10:42,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:10:42,051 INFO L87 Difference]: Start difference. First operand 13773 states and 39393 transitions. Second operand 18 states. [2019-12-27 20:10:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:45,809 INFO L93 Difference]: Finished difference Result 33416 states and 96238 transitions. [2019-12-27 20:10:45,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:10:45,809 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-12-27 20:10:45,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:45,853 INFO L225 Difference]: With dead ends: 33416 [2019-12-27 20:10:45,853 INFO L226 Difference]: Without dead ends: 33416 [2019-12-27 20:10:45,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-12-27 20:10:45,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33416 states. [2019-12-27 20:10:46,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33416 to 18697. [2019-12-27 20:10:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18697 states. [2019-12-27 20:10:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18697 states to 18697 states and 54139 transitions. [2019-12-27 20:10:46,211 INFO L78 Accepts]: Start accepts. Automaton has 18697 states and 54139 transitions. Word has length 41 [2019-12-27 20:10:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:46,211 INFO L462 AbstractCegarLoop]: Abstraction has 18697 states and 54139 transitions. [2019-12-27 20:10:46,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 20:10:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 18697 states and 54139 transitions. [2019-12-27 20:10:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:10:46,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:46,229 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] [2019-12-27 20:10:46,230 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 20:10:46,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:46,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1903545287, now seen corresponding path program 2 times [2019-12-27 20:10:46,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:46,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405949000] [2019-12-27 20:10:46,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:46,294 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 20:10:46,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405949000] [2019-12-27 20:10:46,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:46,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:10:46,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2054539927] [2019-12-27 20:10:46,295 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:46,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:46,345 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 103 states and 178 transitions. [2019-12-27 20:10:46,345 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:46,346 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:10:46,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:10:46,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:46,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:10:46,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:10:46,347 INFO L87 Difference]: Start difference. First operand 18697 states and 54139 transitions. Second operand 3 states. [2019-12-27 20:10:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:46,439 INFO L93 Difference]: Finished difference Result 18616 states and 53882 transitions. [2019-12-27 20:10:46,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:10:46,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 20:10:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:46,478 INFO L225 Difference]: With dead ends: 18616 [2019-12-27 20:10:46,478 INFO L226 Difference]: Without dead ends: 18616 [2019-12-27 20:10:46,479 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 20:10:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18616 states. [2019-12-27 20:10:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18616 to 15106. [2019-12-27 20:10:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15106 states. [2019-12-27 20:10:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15106 states to 15106 states and 44205 transitions. [2019-12-27 20:10:46,827 INFO L78 Accepts]: Start accepts. Automaton has 15106 states and 44205 transitions. Word has length 41 [2019-12-27 20:10:46,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:46,828 INFO L462 AbstractCegarLoop]: Abstraction has 15106 states and 44205 transitions. [2019-12-27 20:10:46,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:10:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 15106 states and 44205 transitions. [2019-12-27 20:10:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:10:46,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:46,843 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] [2019-12-27 20:10:46,843 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 20:10:46,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:46,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1295739171, now seen corresponding path program 1 times [2019-12-27 20:10:46,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:46,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295033948] [2019-12-27 20:10:46,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:46,886 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 20:10:46,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295033948] [2019-12-27 20:10:46,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:46,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:10:46,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [508176498] [2019-12-27 20:10:46,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:46,897 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:46,958 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 256 transitions. [2019-12-27 20:10:46,959 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:46,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:10:46,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:10:46,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:46,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:10:46,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:10:46,975 INFO L87 Difference]: Start difference. First operand 15106 states and 44205 transitions. Second operand 6 states. [2019-12-27 20:10:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:47,080 INFO L93 Difference]: Finished difference Result 13964 states and 41659 transitions. [2019-12-27 20:10:47,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:10:47,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 20:10:47,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:47,107 INFO L225 Difference]: With dead ends: 13964 [2019-12-27 20:10:47,107 INFO L226 Difference]: Without dead ends: 11277 [2019-12-27 20:10:47,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:10:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11277 states. [2019-12-27 20:10:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11277 to 11277. [2019-12-27 20:10:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11277 states. [2019-12-27 20:10:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11277 states to 11277 states and 35359 transitions. [2019-12-27 20:10:47,484 INFO L78 Accepts]: Start accepts. Automaton has 11277 states and 35359 transitions. Word has length 42 [2019-12-27 20:10:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:47,484 INFO L462 AbstractCegarLoop]: Abstraction has 11277 states and 35359 transitions. [2019-12-27 20:10:47,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:10:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 11277 states and 35359 transitions. [2019-12-27 20:10:47,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:10:47,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:47,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:10:47,505 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 20:10:47,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:47,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1765746588, now seen corresponding path program 1 times [2019-12-27 20:10:47,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:47,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948679433] [2019-12-27 20:10:47,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:47,612 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 20:10:47,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948679433] [2019-12-27 20:10:47,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:47,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:10:47,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [936673998] [2019-12-27 20:10:47,614 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:47,658 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:48,242 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 250 states and 467 transitions. [2019-12-27 20:10:48,242 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:48,427 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 20:10:48,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:10:48,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:48,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:10:48,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:10:48,428 INFO L87 Difference]: Start difference. First operand 11277 states and 35359 transitions. Second operand 13 states. [2019-12-27 20:10:48,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:48,934 INFO L93 Difference]: Finished difference Result 22376 states and 68930 transitions. [2019-12-27 20:10:48,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:10:48,935 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 20:10:48,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:48,958 INFO L225 Difference]: With dead ends: 22376 [2019-12-27 20:10:48,958 INFO L226 Difference]: Without dead ends: 15577 [2019-12-27 20:10:48,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:10:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15577 states. [2019-12-27 20:10:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15577 to 13276. [2019-12-27 20:10:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13276 states. [2019-12-27 20:10:49,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13276 states to 13276 states and 41212 transitions. [2019-12-27 20:10:49,185 INFO L78 Accepts]: Start accepts. Automaton has 13276 states and 41212 transitions. Word has length 66 [2019-12-27 20:10:49,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:49,185 INFO L462 AbstractCegarLoop]: Abstraction has 13276 states and 41212 transitions. [2019-12-27 20:10:49,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:10:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 13276 states and 41212 transitions. [2019-12-27 20:10:49,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:10:49,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:49,199 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 20:10:49,199 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 20:10:49,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:49,200 INFO L82 PathProgramCache]: Analyzing trace with hash -309400938, now seen corresponding path program 2 times [2019-12-27 20:10:49,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:49,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340626869] [2019-12-27 20:10:49,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:49,292 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 20:10:49,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340626869] [2019-12-27 20:10:49,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:49,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:10:49,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1874747010] [2019-12-27 20:10:49,295 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:49,316 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:49,663 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 250 states and 481 transitions. [2019-12-27 20:10:49,663 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:49,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:49,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:50,013 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 20:10:50,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:10:50,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:50,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:10:50,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:10:50,015 INFO L87 Difference]: Start difference. First operand 13276 states and 41212 transitions. Second operand 14 states. [2019-12-27 20:10:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:53,073 INFO L93 Difference]: Finished difference Result 31373 states and 94805 transitions. [2019-12-27 20:10:53,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 20:10:53,074 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 20:10:53,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:53,119 INFO L225 Difference]: With dead ends: 31373 [2019-12-27 20:10:53,119 INFO L226 Difference]: Without dead ends: 31205 [2019-12-27 20:10:53,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:10:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31205 states. [2019-12-27 20:10:53,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31205 to 16185. [2019-12-27 20:10:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16185 states. [2019-12-27 20:10:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16185 states to 16185 states and 50018 transitions. [2019-12-27 20:10:53,533 INFO L78 Accepts]: Start accepts. Automaton has 16185 states and 50018 transitions. Word has length 66 [2019-12-27 20:10:53,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:53,533 INFO L462 AbstractCegarLoop]: Abstraction has 16185 states and 50018 transitions. [2019-12-27 20:10:53,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:10:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 16185 states and 50018 transitions. [2019-12-27 20:10:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:10:53,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:53,553 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 20:10:53,553 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 20:10:53,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:53,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2018116578, now seen corresponding path program 3 times [2019-12-27 20:10:53,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:53,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424354752] [2019-12-27 20:10:53,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:53,721 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 20:10:53,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424354752] [2019-12-27 20:10:53,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:53,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:10:53,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [85300908] [2019-12-27 20:10:53,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:53,743 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:54,087 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 259 states and 502 transitions. [2019-12-27 20:10:54,088 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:54,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:54,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:54,859 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 20:10:54,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 20:10:54,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:54,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 20:10:54,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-12-27 20:10:54,860 INFO L87 Difference]: Start difference. First operand 16185 states and 50018 transitions. Second operand 20 states. [2019-12-27 20:11:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:02,631 INFO L93 Difference]: Finished difference Result 45115 states and 136786 transitions. [2019-12-27 20:11:02,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 20:11:02,632 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-27 20:11:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:02,694 INFO L225 Difference]: With dead ends: 45115 [2019-12-27 20:11:02,695 INFO L226 Difference]: Without dead ends: 45115 [2019-12-27 20:11:02,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 32 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=415, Invalid=1841, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 20:11:02,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45115 states. [2019-12-27 20:11:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45115 to 15711. [2019-12-27 20:11:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15711 states. [2019-12-27 20:11:03,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15711 states to 15711 states and 48807 transitions. [2019-12-27 20:11:03,172 INFO L78 Accepts]: Start accepts. Automaton has 15711 states and 48807 transitions. Word has length 66 [2019-12-27 20:11:03,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:03,172 INFO L462 AbstractCegarLoop]: Abstraction has 15711 states and 48807 transitions. [2019-12-27 20:11:03,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 20:11:03,172 INFO L276 IsEmpty]: Start isEmpty. Operand 15711 states and 48807 transitions. [2019-12-27 20:11:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:11:03,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:03,190 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 20:11:03,190 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 20:11:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:03,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1801001732, now seen corresponding path program 4 times [2019-12-27 20:11:03,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:03,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65160465] [2019-12-27 20:11:03,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:03,390 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 20:11:03,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65160465] [2019-12-27 20:11:03,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:03,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 20:11:03,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [938594155] [2019-12-27 20:11:03,392 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:03,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:04,285 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 327 states and 675 transitions. [2019-12-27 20:11:04,285 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:04,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:04,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:05,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:05,093 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 46 times. [2019-12-27 20:11:05,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 20:11:05,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:05,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 20:11:05,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:11:05,094 INFO L87 Difference]: Start difference. First operand 15711 states and 48807 transitions. Second operand 24 states. [2019-12-27 20:11:15,899 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-12-27 20:11:19,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:19,205 INFO L93 Difference]: Finished difference Result 61557 states and 182866 transitions. [2019-12-27 20:11:19,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-12-27 20:11:19,206 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2019-12-27 20:11:19,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:19,291 INFO L225 Difference]: With dead ends: 61557 [2019-12-27 20:11:19,291 INFO L226 Difference]: Without dead ends: 61557 [2019-12-27 20:11:19,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 51 SyntacticMatches, 9 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3249 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1578, Invalid=8928, Unknown=0, NotChecked=0, Total=10506 [2019-12-27 20:11:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61557 states. [2019-12-27 20:11:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61557 to 15849. [2019-12-27 20:11:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15849 states. [2019-12-27 20:11:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15849 states to 15849 states and 49312 transitions. [2019-12-27 20:11:19,875 INFO L78 Accepts]: Start accepts. Automaton has 15849 states and 49312 transitions. Word has length 66 [2019-12-27 20:11:19,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:19,875 INFO L462 AbstractCegarLoop]: Abstraction has 15849 states and 49312 transitions. [2019-12-27 20:11:19,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 20:11:19,875 INFO L276 IsEmpty]: Start isEmpty. Operand 15849 states and 49312 transitions. [2019-12-27 20:11:19,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:11:19,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:19,891 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 20:11:19,891 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 20:11:19,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:19,892 INFO L82 PathProgramCache]: Analyzing trace with hash -178669704, now seen corresponding path program 5 times [2019-12-27 20:11:19,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:19,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836605987] [2019-12-27 20:11:19,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:20,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836605987] [2019-12-27 20:11:20,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:20,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:11:20,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [145606454] [2019-12-27 20:11:20,060 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:20,074 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:20,346 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 273 states and 526 transitions. [2019-12-27 20:11:20,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:20,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:20,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:20,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:20,894 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 20:11:20,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 20:11:20,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:20,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 20:11:20,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:11:20,895 INFO L87 Difference]: Start difference. First operand 15849 states and 49312 transitions. Second operand 17 states. [2019-12-27 20:11:24,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:24,547 INFO L93 Difference]: Finished difference Result 38726 states and 117935 transitions. [2019-12-27 20:11:24,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 20:11:24,547 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 20:11:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:24,586 INFO L225 Difference]: With dead ends: 38726 [2019-12-27 20:11:24,586 INFO L226 Difference]: Without dead ends: 27446 [2019-12-27 20:11:24,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 20:11:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27446 states. [2019-12-27 20:11:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27446 to 16717. [2019-12-27 20:11:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16717 states. [2019-12-27 20:11:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16717 states to 16717 states and 51485 transitions. [2019-12-27 20:11:24,939 INFO L78 Accepts]: Start accepts. Automaton has 16717 states and 51485 transitions. Word has length 66 [2019-12-27 20:11:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:24,939 INFO L462 AbstractCegarLoop]: Abstraction has 16717 states and 51485 transitions. [2019-12-27 20:11:24,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 20:11:24,939 INFO L276 IsEmpty]: Start isEmpty. Operand 16717 states and 51485 transitions. [2019-12-27 20:11:24,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:11:24,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:24,958 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 20:11:24,958 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 20:11:24,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:24,959 INFO L82 PathProgramCache]: Analyzing trace with hash 441477594, now seen corresponding path program 6 times [2019-12-27 20:11:24,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:24,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549964456] [2019-12-27 20:11:24,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:25,156 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 20:11:25,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549964456] [2019-12-27 20:11:25,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:25,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:11:25,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1297163498] [2019-12-27 20:11:25,157 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:25,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:25,443 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 256 states and 498 transitions. [2019-12-27 20:11:25,443 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:25,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:25,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:25,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:26,048 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 20:11:26,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 20:11:26,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:26,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 20:11:26,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:11:26,051 INFO L87 Difference]: Start difference. First operand 16717 states and 51485 transitions. Second operand 17 states. [2019-12-27 20:11:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:28,432 INFO L93 Difference]: Finished difference Result 26527 states and 81029 transitions. [2019-12-27 20:11:28,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 20:11:28,432 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 20:11:28,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:28,459 INFO L225 Difference]: With dead ends: 26527 [2019-12-27 20:11:28,459 INFO L226 Difference]: Without dead ends: 19939 [2019-12-27 20:11:28,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:11:28,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19939 states. [2019-12-27 20:11:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19939 to 16533. [2019-12-27 20:11:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16533 states. [2019-12-27 20:11:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16533 states to 16533 states and 50841 transitions. [2019-12-27 20:11:28,740 INFO L78 Accepts]: Start accepts. Automaton has 16533 states and 50841 transitions. Word has length 66 [2019-12-27 20:11:28,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:28,740 INFO L462 AbstractCegarLoop]: Abstraction has 16533 states and 50841 transitions. [2019-12-27 20:11:28,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 20:11:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 16533 states and 50841 transitions. [2019-12-27 20:11:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:11:28,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:28,757 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 20:11:28,757 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 20:11:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:28,758 INFO L82 PathProgramCache]: Analyzing trace with hash 276083058, now seen corresponding path program 7 times [2019-12-27 20:11:28,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:28,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181882093] [2019-12-27 20:11:28,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:29,039 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 20:11:29,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181882093] [2019-12-27 20:11:29,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:29,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:11:29,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [392458861] [2019-12-27 20:11:29,040 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:29,049 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:29,181 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 171 states and 289 transitions. [2019-12-27 20:11:29,181 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:29,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:11:29,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:11:29,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:11:29,844 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:11:29,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 20:11:29,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:29,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 20:11:29,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-12-27 20:11:29,845 INFO L87 Difference]: Start difference. First operand 16533 states and 50841 transitions. Second operand 20 states. [2019-12-27 20:11:33,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:33,973 INFO L93 Difference]: Finished difference Result 31209 states and 96355 transitions. [2019-12-27 20:11:33,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 20:11:33,974 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-27 20:11:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:34,013 INFO L225 Difference]: With dead ends: 31209 [2019-12-27 20:11:34,013 INFO L226 Difference]: Without dead ends: 27629 [2019-12-27 20:11:34,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=257, Invalid=1465, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 20:11:34,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27629 states. [2019-12-27 20:11:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27629 to 17899. [2019-12-27 20:11:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17899 states. [2019-12-27 20:11:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17899 states to 17899 states and 54965 transitions. [2019-12-27 20:11:34,516 INFO L78 Accepts]: Start accepts. Automaton has 17899 states and 54965 transitions. Word has length 66 [2019-12-27 20:11:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:34,516 INFO L462 AbstractCegarLoop]: Abstraction has 17899 states and 54965 transitions. [2019-12-27 20:11:34,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 20:11:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 17899 states and 54965 transitions. [2019-12-27 20:11:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:11:34,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:34,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:11:34,535 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 20:11:34,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:34,536 INFO L82 PathProgramCache]: Analyzing trace with hash -97354884, now seen corresponding path program 8 times [2019-12-27 20:11:34,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:34,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541422427] [2019-12-27 20:11:34,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:34,749 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 20:11:34,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541422427] [2019-12-27 20:11:34,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:34,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:11:34,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [931196178] [2019-12-27 20:11:34,750 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:34,767 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:35,009 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 280 states and 546 transitions. [2019-12-27 20:11:35,009 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:35,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:11:35,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:11:35,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:11:35,542 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 20:11:35,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 20:11:35,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:35,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 20:11:35,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2019-12-27 20:11:35,543 INFO L87 Difference]: Start difference. First operand 17899 states and 54965 transitions. Second operand 20 states. [2019-12-27 20:11:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:40,574 INFO L93 Difference]: Finished difference Result 52041 states and 158923 transitions. [2019-12-27 20:11:40,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 20:11:40,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-27 20:11:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:40,624 INFO L225 Difference]: With dead ends: 52041 [2019-12-27 20:11:40,625 INFO L226 Difference]: Without dead ends: 34616 [2019-12-27 20:11:40,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=483, Invalid=2709, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 20:11:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34616 states. [2019-12-27 20:11:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34616 to 18997. [2019-12-27 20:11:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18997 states. [2019-12-27 20:11:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18997 states to 18997 states and 57862 transitions. [2019-12-27 20:11:41,204 INFO L78 Accepts]: Start accepts. Automaton has 18997 states and 57862 transitions. Word has length 66 [2019-12-27 20:11:41,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:41,204 INFO L462 AbstractCegarLoop]: Abstraction has 18997 states and 57862 transitions. [2019-12-27 20:11:41,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 20:11:41,204 INFO L276 IsEmpty]: Start isEmpty. Operand 18997 states and 57862 transitions. [2019-12-27 20:11:41,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:11:41,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:41,225 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 20:11:41,225 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 20:11:41,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:41,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1515306624, now seen corresponding path program 9 times [2019-12-27 20:11:41,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:41,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821528533] [2019-12-27 20:11:41,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:41,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821528533] [2019-12-27 20:11:41,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:41,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 20:11:41,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [327675575] [2019-12-27 20:11:41,494 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:41,504 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:41,644 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 353 transitions. [2019-12-27 20:11:41,645 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:41,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:42,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:42,138 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 20:11:42,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 20:11:42,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:42,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 20:11:42,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2019-12-27 20:11:42,139 INFO L87 Difference]: Start difference. First operand 18997 states and 57862 transitions. Second operand 20 states. [2019-12-27 20:11:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:46,569 INFO L93 Difference]: Finished difference Result 25080 states and 74834 transitions. [2019-12-27 20:11:46,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 20:11:46,570 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-27 20:11:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:46,607 INFO L225 Difference]: With dead ends: 25080 [2019-12-27 20:11:46,607 INFO L226 Difference]: Without dead ends: 24709 [2019-12-27 20:11:46,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 10 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=292, Invalid=1348, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 20:11:46,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24709 states. [2019-12-27 20:11:47,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24709 to 19288. [2019-12-27 20:11:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19288 states. [2019-12-27 20:11:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19288 states to 19288 states and 58803 transitions. [2019-12-27 20:11:47,146 INFO L78 Accepts]: Start accepts. Automaton has 19288 states and 58803 transitions. Word has length 66 [2019-12-27 20:11:47,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:47,147 INFO L462 AbstractCegarLoop]: Abstraction has 19288 states and 58803 transitions. [2019-12-27 20:11:47,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 20:11:47,147 INFO L276 IsEmpty]: Start isEmpty. Operand 19288 states and 58803 transitions. [2019-12-27 20:11:47,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:11:47,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:47,168 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 20:11:47,169 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 20:11:47,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:47,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1988559874, now seen corresponding path program 10 times [2019-12-27 20:11:47,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:47,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464838392] [2019-12-27 20:11:47,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:47,712 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 20:11:47,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464838392] [2019-12-27 20:11:47,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:47,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 20:11:47,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1670070888] [2019-12-27 20:11:47,713 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:47,724 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:47,970 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 277 states and 549 transitions. [2019-12-27 20:11:47,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:48,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:48,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:11:48,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 20:11:48,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 20:11:48,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 20:11:48,999 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 20:11:49,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 20:11:49,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:49,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 20:11:49,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2019-12-27 20:11:49,001 INFO L87 Difference]: Start difference. First operand 19288 states and 58803 transitions. Second operand 28 states. [2019-12-27 20:11:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:59,170 INFO L93 Difference]: Finished difference Result 25466 states and 76243 transitions. [2019-12-27 20:11:59,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 20:11:59,171 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 66 [2019-12-27 20:11:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:59,208 INFO L225 Difference]: With dead ends: 25466 [2019-12-27 20:11:59,208 INFO L226 Difference]: Without dead ends: 24387 [2019-12-27 20:11:59,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=562, Invalid=3470, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 20:11:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24387 states. [2019-12-27 20:11:59,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24387 to 18447. [2019-12-27 20:11:59,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18447 states. [2019-12-27 20:11:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18447 states to 18447 states and 56208 transitions. [2019-12-27 20:11:59,564 INFO L78 Accepts]: Start accepts. Automaton has 18447 states and 56208 transitions. Word has length 66 [2019-12-27 20:11:59,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:59,564 INFO L462 AbstractCegarLoop]: Abstraction has 18447 states and 56208 transitions. [2019-12-27 20:11:59,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 20:11:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 18447 states and 56208 transitions. [2019-12-27 20:11:59,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:11:59,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:59,588 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 20:11:59,588 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:59,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:59,588 INFO L82 PathProgramCache]: Analyzing trace with hash 278065582, now seen corresponding path program 11 times [2019-12-27 20:11:59,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:59,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053464380] [2019-12-27 20:11:59,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:59,776 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 20:11:59,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053464380] [2019-12-27 20:11:59,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:59,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:11:59,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [938105919] [2019-12-27 20:11:59,777 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:59,786 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:59,949 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 387 transitions. [2019-12-27 20:11:59,950 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:00,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:12:00,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:12:00,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:12:00,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 20:12:00,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 20:12:00,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:00,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 20:12:00,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:12:00,541 INFO L87 Difference]: Start difference. First operand 18447 states and 56208 transitions. Second operand 21 states. [2019-12-27 20:12:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:06,038 INFO L93 Difference]: Finished difference Result 40475 states and 120399 transitions. [2019-12-27 20:12:06,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 20:12:06,038 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-12-27 20:12:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:06,097 INFO L225 Difference]: With dead ends: 40475 [2019-12-27 20:12:06,098 INFO L226 Difference]: Without dead ends: 37961 [2019-12-27 20:12:06,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 20:12:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37961 states. [2019-12-27 20:12:06,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37961 to 18410. [2019-12-27 20:12:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18410 states. [2019-12-27 20:12:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18410 states to 18410 states and 56053 transitions. [2019-12-27 20:12:06,577 INFO L78 Accepts]: Start accepts. Automaton has 18410 states and 56053 transitions. Word has length 66 [2019-12-27 20:12:06,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:06,577 INFO L462 AbstractCegarLoop]: Abstraction has 18410 states and 56053 transitions. [2019-12-27 20:12:06,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 20:12:06,578 INFO L276 IsEmpty]: Start isEmpty. Operand 18410 states and 56053 transitions. [2019-12-27 20:12:06,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:12:06,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:06,602 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 20:12:06,602 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:06,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:06,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1386257186, now seen corresponding path program 12 times [2019-12-27 20:12:06,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:06,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231608792] [2019-12-27 20:12:06,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:07,164 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 20:12:07,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231608792] [2019-12-27 20:12:07,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:07,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 20:12:07,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [574925051] [2019-12-27 20:12:07,164 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:07,173 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:07,415 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 289 states and 587 transitions. [2019-12-27 20:12:07,416 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:08,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:12:08,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 20:12:08,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 20:12:08,634 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 20:12:08,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 20:12:08,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:08,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 20:12:08,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2019-12-27 20:12:08,635 INFO L87 Difference]: Start difference. First operand 18410 states and 56053 transitions. Second operand 28 states. [2019-12-27 20:12:10,171 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-12-27 20:12:10,508 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 20:12:11,484 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 20:12:13,576 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-27 20:12:13,746 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-12-27 20:12:14,050 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-12-27 20:12:16,831 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-12-27 20:12:21,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:21,958 INFO L93 Difference]: Finished difference Result 39870 states and 118203 transitions. [2019-12-27 20:12:21,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-12-27 20:12:21,958 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 66 [2019-12-27 20:12:21,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:22,012 INFO L225 Difference]: With dead ends: 39870 [2019-12-27 20:12:22,013 INFO L226 Difference]: Without dead ends: 38539 [2019-12-27 20:12:22,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 17 SyntacticMatches, 20 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2977 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1475, Invalid=8827, Unknown=0, NotChecked=0, Total=10302 [2019-12-27 20:12:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38539 states. [2019-12-27 20:12:22,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38539 to 18426. [2019-12-27 20:12:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18426 states. [2019-12-27 20:12:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18426 states to 18426 states and 56109 transitions. [2019-12-27 20:12:22,441 INFO L78 Accepts]: Start accepts. Automaton has 18426 states and 56109 transitions. Word has length 66 [2019-12-27 20:12:22,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:22,442 INFO L462 AbstractCegarLoop]: Abstraction has 18426 states and 56109 transitions. [2019-12-27 20:12:22,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 20:12:22,442 INFO L276 IsEmpty]: Start isEmpty. Operand 18426 states and 56109 transitions. [2019-12-27 20:12:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:12:22,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:22,463 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 20:12:22,463 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:22,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:22,464 INFO L82 PathProgramCache]: Analyzing trace with hash 967699540, now seen corresponding path program 13 times [2019-12-27 20:12:22,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:22,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632795367] [2019-12-27 20:12:22,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:22,979 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 20:12:22,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632795367] [2019-12-27 20:12:22,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:22,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 20:12:22,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [140966243] [2019-12-27 20:12:22,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:22,993 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:23,219 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 330 transitions. [2019-12-27 20:12:23,219 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:23,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:12:23,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:12:23,684 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 20:12:23,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 20:12:23,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:23,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 20:12:23,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2019-12-27 20:12:23,686 INFO L87 Difference]: Start difference. First operand 18426 states and 56109 transitions. Second operand 23 states. [2019-12-27 20:12:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:35,070 INFO L93 Difference]: Finished difference Result 31405 states and 93957 transitions. [2019-12-27 20:12:35,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-27 20:12:35,071 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2019-12-27 20:12:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:35,113 INFO L225 Difference]: With dead ends: 31405 [2019-12-27 20:12:35,114 INFO L226 Difference]: Without dead ends: 30558 [2019-12-27 20:12:35,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=532, Invalid=3758, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 20:12:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30558 states. [2019-12-27 20:12:35,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30558 to 18471. [2019-12-27 20:12:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18471 states. [2019-12-27 20:12:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18471 states to 18471 states and 56237 transitions. [2019-12-27 20:12:35,500 INFO L78 Accepts]: Start accepts. Automaton has 18471 states and 56237 transitions. Word has length 66 [2019-12-27 20:12:35,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:35,500 INFO L462 AbstractCegarLoop]: Abstraction has 18471 states and 56237 transitions. [2019-12-27 20:12:35,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 20:12:35,500 INFO L276 IsEmpty]: Start isEmpty. Operand 18471 states and 56237 transitions. [2019-12-27 20:12:35,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:12:35,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:35,521 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 20:12:35,522 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:35,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:35,522 INFO L82 PathProgramCache]: Analyzing trace with hash 498043514, now seen corresponding path program 14 times [2019-12-27 20:12:35,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:35,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965297631] [2019-12-27 20:12:35,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:36,318 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 20:12:36,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965297631] [2019-12-27 20:12:36,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:36,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 20:12:36,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [644370218] [2019-12-27 20:12:36,319 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:36,329 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:36,553 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 267 states and 532 transitions. [2019-12-27 20:12:36,554 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:37,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:12:37,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 20:12:37,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 20:12:37,687 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 40 times. [2019-12-27 20:12:37,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 20:12:37,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:37,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 20:12:37,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 20:12:37,689 INFO L87 Difference]: Start difference. First operand 18471 states and 56237 transitions. Second operand 33 states. [2019-12-27 20:12:39,356 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-12-27 20:12:39,718 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-12-27 20:12:40,299 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-12-27 20:12:43,655 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-27 20:12:43,843 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-12-27 20:12:44,097 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 Received shutdown request... [2019-12-27 20:12:46,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 20:12:46,051 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 20:12:46,054 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 20:12:46,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:12:46 BasicIcfg [2019-12-27 20:12:46,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:12:46,055 INFO L168 Benchmark]: Toolchain (without parser) took 221748.32 ms. Allocated memory was 146.3 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 102.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-27 20:12:46,056 INFO L168 Benchmark]: CDTParser took 1.62 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 20:12:46,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.50 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 157.0 MB in the end (delta: -55.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:12:46,056 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.10 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:12:46,057 INFO L168 Benchmark]: Boogie Preprocessor took 46.77 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:12:46,057 INFO L168 Benchmark]: RCFGBuilder took 919.07 ms. Allocated memory is still 203.9 MB. Free memory was 151.8 MB in the beginning and 101.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:12:46,057 INFO L168 Benchmark]: TraceAbstraction took 219967.60 ms. Allocated memory was 203.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 100.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 20:12:46,059 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.62 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 749.50 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 157.0 MB in the end (delta: -55.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.10 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.77 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 919.07 ms. Allocated memory is still 203.9 MB. Free memory was 151.8 MB in the beginning and 101.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 219967.60 ms. Allocated memory was 203.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 100.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 179 ProgramPointsBefore, 95 ProgramPointsAfterwards, 216 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7008 VarBasedMoverChecksPositive, 202 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 83227 CheckedPairsTotal, 114 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (18471states) and FLOYD_HOARE automaton (currently 56 states, 33 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (18471states) and FLOYD_HOARE automaton (currently 56 states, 33 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: TIMEOUT, OverallTime: 219.7s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 122.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9307 SDtfs, 19521 SDslu, 48249 SDs, 0 SdLazy, 60146 SolverSat, 1873 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 68.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1376 GetRequests, 315 SyntacticMatches, 147 SemanticMatches, 913 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13005 ImplicationChecksByTransitivity, 40.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160651occurred 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: 52.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 440808 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1545 NumberOfCodeBlocks, 1545 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1510 ConstructedInterpolants, 0 QuantifiedInterpolants, 492674 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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