/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:11:29,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:11:29,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:11:30,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:11:30,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:11:30,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:11:30,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:11:30,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:11:30,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:11:30,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:11:30,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:11:30,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:11:30,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:11:30,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:11:30,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:11:30,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:11:30,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:11:30,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:11:30,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:11:30,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:11:30,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:11:30,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:11:30,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:11:30,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:11:30,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:11:30,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:11:30,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:11:30,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:11:30,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:11:30,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:11:30,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:11:30,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:11:30,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:11:30,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:11:30,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:11:30,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:11:30,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:11:30,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:11:30,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:11:30,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:11:30,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:11:30,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:11:30,114 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:11:30,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:11:30,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:11:30,117 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:11:30,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:11:30,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:11:30,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:11:30,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:11:30,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:11:30,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:11:30,118 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:11:30,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:11:30,119 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:11:30,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:11:30,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:11:30,120 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:11:30,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:11:30,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:11:30,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:11:30,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:11:30,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:11:30,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:11:30,122 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 05:11:30,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:11:30,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:11:30,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:11:30,624 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:11:30,627 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:11:30,628 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2020-11-07 05:11:30,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc179344/c1e644f9121c4ce5bfaa39458c8d8df8/FLAG2981b4a54 [2020-11-07 05:11:31,424 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:11:31,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2020-11-07 05:11:31,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc179344/c1e644f9121c4ce5bfaa39458c8d8df8/FLAG2981b4a54 [2020-11-07 05:11:31,775 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc179344/c1e644f9121c4ce5bfaa39458c8d8df8 [2020-11-07 05:11:31,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:11:31,789 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:11:31,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:11:31,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:11:31,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:11:31,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:11:31" (1/1) ... [2020-11-07 05:11:31,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5ba39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:31, skipping insertion in model container [2020-11-07 05:11:31,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:11:31" (1/1) ... [2020-11-07 05:11:31,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:11:31,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:11:32,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:11:32,116 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:11:32,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:11:32,158 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:11:32,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:32 WrapperNode [2020-11-07 05:11:32,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:11:32,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:11:32,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:11:32,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:11:32,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:32" (1/1) ... [2020-11-07 05:11:32,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:32" (1/1) ... [2020-11-07 05:11:32,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:32" (1/1) ... [2020-11-07 05:11:32,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:32" (1/1) ... [2020-11-07 05:11:32,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:32" (1/1) ... [2020-11-07 05:11:32,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:32" (1/1) ... [2020-11-07 05:11:32,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:32" (1/1) ... [2020-11-07 05:11:32,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:11:32,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:11:32,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:11:32,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:11:32,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:32" (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 [2020-11-07 05:11:32,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:11:32,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:11:32,293 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:11:32,294 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:11:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:11:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:11:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:11:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:11:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:11:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:11:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:11:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:11:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:11:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:11:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:11:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:11:32,973 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:11:32,975 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 05:11:32,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:11:32 BoogieIcfgContainer [2020-11-07 05:11:32,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:11:32,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:11:32,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:11:32,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:11:32,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:11:31" (1/3) ... [2020-11-07 05:11:32,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f1e348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:11:32, skipping insertion in model container [2020-11-07 05:11:32,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:32" (2/3) ... [2020-11-07 05:11:32,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f1e348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:11:32, skipping insertion in model container [2020-11-07 05:11:32,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:11:32" (3/3) ... [2020-11-07 05:11:32,992 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2020-11-07 05:11:33,008 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:11:33,012 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:11:33,023 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:11:33,045 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:11:33,045 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:11:33,045 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:11:33,045 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:11:33,045 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:11:33,046 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:11:33,046 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:11:33,046 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:11:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2020-11-07 05:11:33,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 05:11:33,073 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:33,074 INFO L422 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] [2020-11-07 05:11:33,075 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:33,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:33,081 INFO L82 PathProgramCache]: Analyzing trace with hash -598530795, now seen corresponding path program 1 times [2020-11-07 05:11:33,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:33,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [939948398] [2020-11-07 05:11:33,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:33,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:33,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [939948398] [2020-11-07 05:11:33,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:33,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:33,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309339723] [2020-11-07 05:11:33,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:33,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:33,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:33,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:33,416 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2020-11-07 05:11:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:34,004 INFO L93 Difference]: Finished difference Result 159 states and 212 transitions. [2020-11-07 05:11:34,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:34,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-11-07 05:11:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:34,027 INFO L225 Difference]: With dead ends: 159 [2020-11-07 05:11:34,027 INFO L226 Difference]: Without dead ends: 104 [2020-11-07 05:11:34,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-07 05:11:34,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2020-11-07 05:11:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-11-07 05:11:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2020-11-07 05:11:34,179 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 52 [2020-11-07 05:11:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:34,181 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2020-11-07 05:11:34,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2020-11-07 05:11:34,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-07 05:11:34,184 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:34,185 INFO L422 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] [2020-11-07 05:11:34,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:11:34,187 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:34,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:34,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1160567619, now seen corresponding path program 1 times [2020-11-07 05:11:34,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:34,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [321775271] [2020-11-07 05:11:34,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:34,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:34,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [321775271] [2020-11-07 05:11:34,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:34,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:34,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545281330] [2020-11-07 05:11:34,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:34,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:34,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:34,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:34,352 INFO L87 Difference]: Start difference. First operand 103 states and 129 transitions. Second operand 4 states. [2020-11-07 05:11:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:34,624 INFO L93 Difference]: Finished difference Result 125 states and 158 transitions. [2020-11-07 05:11:34,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:34,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-11-07 05:11:34,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:34,627 INFO L225 Difference]: With dead ends: 125 [2020-11-07 05:11:34,627 INFO L226 Difference]: Without dead ends: 122 [2020-11-07 05:11:34,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:34,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-07 05:11:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2020-11-07 05:11:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-11-07 05:11:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2020-11-07 05:11:34,656 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 53 [2020-11-07 05:11:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:34,656 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2020-11-07 05:11:34,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2020-11-07 05:11:34,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-07 05:11:34,659 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:34,659 INFO L422 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] [2020-11-07 05:11:34,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:11:34,660 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:34,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:34,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1366976914, now seen corresponding path program 1 times [2020-11-07 05:11:34,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:34,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1239349502] [2020-11-07 05:11:34,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:34,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:34,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1239349502] [2020-11-07 05:11:34,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:34,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:34,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870677558] [2020-11-07 05:11:34,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:34,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:34,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:34,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:34,805 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand 4 states. [2020-11-07 05:11:35,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:35,037 INFO L93 Difference]: Finished difference Result 235 states and 309 transitions. [2020-11-07 05:11:35,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:35,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-11-07 05:11:35,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:35,040 INFO L225 Difference]: With dead ends: 235 [2020-11-07 05:11:35,040 INFO L226 Difference]: Without dead ends: 165 [2020-11-07 05:11:35,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-11-07 05:11:35,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2020-11-07 05:11:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-11-07 05:11:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 209 transitions. [2020-11-07 05:11:35,079 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 209 transitions. Word has length 53 [2020-11-07 05:11:35,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:35,079 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 209 transitions. [2020-11-07 05:11:35,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2020-11-07 05:11:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-07 05:11:35,081 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:35,082 INFO L422 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] [2020-11-07 05:11:35,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:11:35,082 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:35,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:35,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1329559813, now seen corresponding path program 1 times [2020-11-07 05:11:35,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:35,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2049511669] [2020-11-07 05:11:35,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:35,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:35,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2049511669] [2020-11-07 05:11:35,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:35,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:35,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919677573] [2020-11-07 05:11:35,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:35,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:35,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:35,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:35,200 INFO L87 Difference]: Start difference. First operand 164 states and 209 transitions. Second operand 4 states. [2020-11-07 05:11:35,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:35,403 INFO L93 Difference]: Finished difference Result 200 states and 256 transitions. [2020-11-07 05:11:35,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:35,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-11-07 05:11:35,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:35,406 INFO L225 Difference]: With dead ends: 200 [2020-11-07 05:11:35,406 INFO L226 Difference]: Without dead ends: 197 [2020-11-07 05:11:35,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:35,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-11-07 05:11:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 164. [2020-11-07 05:11:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-11-07 05:11:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 207 transitions. [2020-11-07 05:11:35,457 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 207 transitions. Word has length 54 [2020-11-07 05:11:35,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:35,458 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 207 transitions. [2020-11-07 05:11:35,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:35,458 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 207 transitions. [2020-11-07 05:11:35,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-07 05:11:35,460 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:35,460 INFO L422 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] [2020-11-07 05:11:35,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:11:35,460 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:35,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:35,461 INFO L82 PathProgramCache]: Analyzing trace with hash 581008705, now seen corresponding path program 1 times [2020-11-07 05:11:35,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:35,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [120036380] [2020-11-07 05:11:35,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:35,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:35,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [120036380] [2020-11-07 05:11:35,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:35,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:35,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192592269] [2020-11-07 05:11:35,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:35,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:35,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:35,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:35,547 INFO L87 Difference]: Start difference. First operand 164 states and 207 transitions. Second operand 4 states. [2020-11-07 05:11:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:35,787 INFO L93 Difference]: Finished difference Result 412 states and 538 transitions. [2020-11-07 05:11:35,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:35,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-11-07 05:11:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:35,791 INFO L225 Difference]: With dead ends: 412 [2020-11-07 05:11:35,791 INFO L226 Difference]: Without dead ends: 281 [2020-11-07 05:11:35,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:35,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-11-07 05:11:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2020-11-07 05:11:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-11-07 05:11:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 355 transitions. [2020-11-07 05:11:35,848 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 355 transitions. Word has length 54 [2020-11-07 05:11:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:35,849 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 355 transitions. [2020-11-07 05:11:35,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 355 transitions. [2020-11-07 05:11:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-07 05:11:35,850 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:35,851 INFO L422 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] [2020-11-07 05:11:35,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:11:35,851 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:35,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:35,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1214087345, now seen corresponding path program 1 times [2020-11-07 05:11:35,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:35,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1010185971] [2020-11-07 05:11:35,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:35,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:35,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1010185971] [2020-11-07 05:11:35,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:35,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:35,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862150115] [2020-11-07 05:11:35,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:35,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:35,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:35,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:35,937 INFO L87 Difference]: Start difference. First operand 280 states and 355 transitions. Second operand 4 states. [2020-11-07 05:11:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:36,215 INFO L93 Difference]: Finished difference Result 340 states and 430 transitions. [2020-11-07 05:11:36,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:36,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-11-07 05:11:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:36,221 INFO L225 Difference]: With dead ends: 340 [2020-11-07 05:11:36,221 INFO L226 Difference]: Without dead ends: 337 [2020-11-07 05:11:36,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-11-07 05:11:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 280. [2020-11-07 05:11:36,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-11-07 05:11:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 351 transitions. [2020-11-07 05:11:36,295 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 351 transitions. Word has length 55 [2020-11-07 05:11:36,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:36,297 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 351 transitions. [2020-11-07 05:11:36,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 351 transitions. [2020-11-07 05:11:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-07 05:11:36,306 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:36,306 INFO L422 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] [2020-11-07 05:11:36,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:11:36,307 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:36,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:36,307 INFO L82 PathProgramCache]: Analyzing trace with hash 839032282, now seen corresponding path program 1 times [2020-11-07 05:11:36,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:36,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [173292893] [2020-11-07 05:11:36,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:36,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:36,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [173292893] [2020-11-07 05:11:36,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:36,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:36,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391742602] [2020-11-07 05:11:36,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:36,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:36,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:36,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:36,418 INFO L87 Difference]: Start difference. First operand 280 states and 351 transitions. Second operand 4 states. [2020-11-07 05:11:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:36,736 INFO L93 Difference]: Finished difference Result 748 states and 954 transitions. [2020-11-07 05:11:36,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:36,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-11-07 05:11:36,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:36,742 INFO L225 Difference]: With dead ends: 748 [2020-11-07 05:11:36,742 INFO L226 Difference]: Without dead ends: 501 [2020-11-07 05:11:36,746 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2020-11-07 05:11:36,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 500. [2020-11-07 05:11:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-11-07 05:11:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 619 transitions. [2020-11-07 05:11:36,875 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 619 transitions. Word has length 55 [2020-11-07 05:11:36,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:36,876 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 619 transitions. [2020-11-07 05:11:36,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:36,876 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 619 transitions. [2020-11-07 05:11:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-07 05:11:36,878 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:36,879 INFO L422 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] [2020-11-07 05:11:36,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:11:36,879 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:36,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:36,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1929396601, now seen corresponding path program 1 times [2020-11-07 05:11:36,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:36,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [610775222] [2020-11-07 05:11:36,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:36,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:36,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [610775222] [2020-11-07 05:11:36,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:36,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:36,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430982222] [2020-11-07 05:11:36,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:36,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:36,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:36,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:36,956 INFO L87 Difference]: Start difference. First operand 500 states and 619 transitions. Second operand 4 states. [2020-11-07 05:11:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:37,246 INFO L93 Difference]: Finished difference Result 600 states and 734 transitions. [2020-11-07 05:11:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:37,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-11-07 05:11:37,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:37,250 INFO L225 Difference]: With dead ends: 600 [2020-11-07 05:11:37,250 INFO L226 Difference]: Without dead ends: 597 [2020-11-07 05:11:37,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-11-07 05:11:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 500. [2020-11-07 05:11:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-11-07 05:11:37,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 611 transitions. [2020-11-07 05:11:37,359 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 611 transitions. Word has length 56 [2020-11-07 05:11:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:37,359 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 611 transitions. [2020-11-07 05:11:37,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 611 transitions. [2020-11-07 05:11:37,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-07 05:11:37,360 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:37,361 INFO L422 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] [2020-11-07 05:11:37,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:11:37,361 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:37,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:37,362 INFO L82 PathProgramCache]: Analyzing trace with hash 247840109, now seen corresponding path program 1 times [2020-11-07 05:11:37,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:37,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [846111077] [2020-11-07 05:11:37,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:37,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:37,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [846111077] [2020-11-07 05:11:37,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:37,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:37,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085920725] [2020-11-07 05:11:37,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:37,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:37,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:37,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:37,436 INFO L87 Difference]: Start difference. First operand 500 states and 611 transitions. Second operand 4 states. [2020-11-07 05:11:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:37,910 INFO L93 Difference]: Finished difference Result 1383 states and 1701 transitions. [2020-11-07 05:11:37,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:37,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-11-07 05:11:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:37,914 INFO L225 Difference]: With dead ends: 1383 [2020-11-07 05:11:37,915 INFO L226 Difference]: Without dead ends: 500 [2020-11-07 05:11:37,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:37,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2020-11-07 05:11:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2020-11-07 05:11:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-11-07 05:11:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 579 transitions. [2020-11-07 05:11:38,016 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 579 transitions. Word has length 56 [2020-11-07 05:11:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:38,017 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 579 transitions. [2020-11-07 05:11:38,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 579 transitions. [2020-11-07 05:11:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 05:11:38,018 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:38,018 INFO L422 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] [2020-11-07 05:11:38,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:11:38,019 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:38,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:38,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1665831771, now seen corresponding path program 1 times [2020-11-07 05:11:38,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:38,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [497522319] [2020-11-07 05:11:38,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:38,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:38,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:38,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [497522319] [2020-11-07 05:11:38,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:38,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:38,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412475377] [2020-11-07 05:11:38,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:38,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:38,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:38,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:38,093 INFO L87 Difference]: Start difference. First operand 500 states and 579 transitions. Second operand 4 states. [2020-11-07 05:11:38,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:38,329 INFO L93 Difference]: Finished difference Result 500 states and 579 transitions. [2020-11-07 05:11:38,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:38,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2020-11-07 05:11:38,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:38,330 INFO L225 Difference]: With dead ends: 500 [2020-11-07 05:11:38,330 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 05:11:38,332 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 05:11:38,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 05:11:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 05:11:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 05:11:38,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2020-11-07 05:11:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:38,333 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 05:11:38,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 05:11:38,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 05:11:38,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:11:38,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 05:11:38,713 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 39 [2020-11-07 05:11:39,946 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 31 [2020-11-07 05:11:40,462 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-11-07 05:11:40,628 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-11-07 05:11:40,974 WARN L194 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 05:11:41,605 WARN L194 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 05:11:42,325 WARN L194 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-11-07 05:11:42,460 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-11-07 05:11:43,807 WARN L194 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 05:11:44,096 WARN L194 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 05:11:44,346 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-11-07 05:11:44,607 WARN L194 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 05:11:45,368 WARN L194 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-11-07 05:11:45,999 WARN L194 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 05:11:46,331 WARN L194 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-11-07 05:11:46,557 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-11-07 05:11:46,940 WARN L194 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-11-07 05:11:47,616 WARN L194 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 05:11:47,622 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 05:11:47,622 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 05:11:47,622 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 05:11:47,622 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 05:11:47,622 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 05:11:47,622 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 05:11:47,622 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:11:47,623 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 05:11:47,623 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 05:11:47,623 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 05:11:47,623 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 05:11:47,623 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 05:11:47,623 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 05:11:47,623 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:11:47,623 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:11:47,624 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:11:47,624 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 05:11:47,624 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 05:11:47,624 INFO L262 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: false [2020-11-07 05:11:47,624 INFO L262 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-11-07 05:11:47,624 INFO L269 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-11-07 05:11:47,624 INFO L269 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-11-07 05:11:47,625 INFO L269 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: true [2020-11-07 05:11:47,625 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 6 95) the Hoare annotation is: true [2020-11-07 05:11:47,625 INFO L262 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-11-07 05:11:47,625 INFO L269 CegarLoopResult]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2020-11-07 05:11:47,625 INFO L262 CegarLoopResult]: At program point L77(line 77) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse1 .cse4 .cse3) (and .cse0 .cse1 .cse4))) [2020-11-07 05:11:47,625 INFO L269 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-11-07 05:11:47,625 INFO L269 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-11-07 05:11:47,626 INFO L269 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-11-07 05:11:47,626 INFO L269 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: true [2020-11-07 05:11:47,626 INFO L262 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: false [2020-11-07 05:11:47,626 INFO L269 CegarLoopResult]: At program point L28(lines 28 30) the Hoare annotation is: true [2020-11-07 05:11:47,626 INFO L262 CegarLoopResult]: At program point L86(line 86) the Hoare annotation is: (= main_~lk5~0 1) [2020-11-07 05:11:47,626 INFO L262 CegarLoopResult]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2020-11-07 05:11:47,626 INFO L269 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-11-07 05:11:47,626 INFO L269 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-11-07 05:11:47,627 INFO L269 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-11-07 05:11:47,627 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 05:11:47,627 INFO L269 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-11-07 05:11:47,627 INFO L262 CegarLoopResult]: At program point L70-1(lines 26 90) the Hoare annotation is: (let ((.cse1 (= main_~p3~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse1 .cse5 .cse4) (and .cse1 .cse2 .cse5) (and .cse0 .cse1 .cse4) (and .cse3 .cse5 .cse4) (and .cse3 .cse2 .cse5) (and .cse0 .cse3 .cse2))) [2020-11-07 05:11:47,627 INFO L262 CegarLoopResult]: At program point L87(line 87) the Hoare annotation is: (= main_~lk5~0 1) [2020-11-07 05:11:47,627 INFO L269 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-11-07 05:11:47,627 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 6 95) the Hoare annotation is: true [2020-11-07 05:11:47,627 INFO L262 CegarLoopResult]: At program point L71(line 71) the Hoare annotation is: (let ((.cse6 (= main_~p5~0 0)) (.cse5 (= main_~lk3~0 1)) (.cse2 (= main_~p4~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse0 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse4 .cse0 .cse6 .cse1) (and .cse4 .cse5 .cse6 .cse1) (and .cse5 .cse6 .cse1 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse3))) [2020-11-07 05:11:47,627 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 6 95) the Hoare annotation is: true [2020-11-07 05:11:47,628 INFO L262 CegarLoopResult]: At program point L55-1(lines 26 90) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-11-07 05:11:47,628 INFO L262 CegarLoopResult]: At program point L80-1(lines 26 90) the Hoare annotation is: (or (= main_~p5~0 0) (= main_~lk5~0 1)) [2020-11-07 05:11:47,628 INFO L269 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-11-07 05:11:47,628 INFO L262 CegarLoopResult]: At program point L47-1(lines 26 90) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-11-07 05:11:47,628 INFO L269 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-11-07 05:11:47,628 INFO L269 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-11-07 05:11:47,629 INFO L262 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse6 (= main_~p5~0 0)) (.cse5 (= main_~lk3~0 1)) (.cse2 (= main_~p4~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse0 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse4 .cse0 .cse6 .cse1) (and .cse4 .cse5 .cse6 .cse1) (and .cse5 .cse6 .cse1 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse3))) [2020-11-07 05:11:47,629 INFO L269 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-11-07 05:11:47,629 INFO L269 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-11-07 05:11:47,629 INFO L262 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-11-07 05:11:47,629 INFO L262 CegarLoopResult]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1))) (or (and .cse0 (= main_~lk5~0 1)) (and .cse0 (= main_~p5~0 0)))) [2020-11-07 05:11:47,629 INFO L262 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-11-07 05:11:47,629 INFO L269 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-11-07 05:11:47,630 INFO L262 CegarLoopResult]: At program point L65-1(lines 26 90) the Hoare annotation is: (let ((.cse6 (= main_~lk3~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk2~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse1 (= main_~p3~0 0)) (.cse7 (= main_~p5~0 0)) (.cse5 (= main_~p4~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse2) (and .cse0 .cse6 .cse7 .cse4) (and .cse6 .cse4 .cse5 .cse2) (and .cse0 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse7 .cse3) (and .cse6 .cse7 .cse5 .cse3) (and .cse0 .cse6 .cse4 .cse2) (and .cse1 .cse7 .cse4 .cse5) (and .cse6 .cse5 .cse2 .cse3) (and .cse0 .cse6 .cse7 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse0 .cse1 .cse7 .cse4) (and .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse4 .cse2) (and .cse1 .cse7 .cse5 .cse3))) [2020-11-07 05:11:47,630 INFO L269 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-11-07 05:11:47,630 INFO L262 CegarLoopResult]: At program point L82(line 82) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1))) (or (and .cse0 (= main_~lk5~0 1)) (and .cse0 (= main_~p5~0 0)))) [2020-11-07 05:11:47,630 INFO L269 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-11-07 05:11:47,630 INFO L269 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-11-07 05:11:47,630 INFO L262 CegarLoopResult]: At program point L66(line 66) the Hoare annotation is: (let ((.cse7 (= main_~p5~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse6 (= main_~p2~0 0)) (.cse5 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse7 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse7 .cse6 .cse4) (and .cse5 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse7 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse7 .cse1 .cse4) (and .cse8 .cse5 .cse7 .cse6 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse8 .cse5 .cse3 .cse6 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4))) [2020-11-07 05:11:47,630 INFO L269 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-11-07 05:11:47,630 INFO L269 CegarLoopResult]: At program point L91(lines 7 95) the Hoare annotation is: true [2020-11-07 05:11:47,631 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 05:11:47,631 INFO L269 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-11-07 05:11:47,631 INFO L269 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-11-07 05:11:47,631 INFO L262 CegarLoopResult]: At program point L75-1(lines 26 90) the Hoare annotation is: (let ((.cse1 (= main_~lk5~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~p5~0 0)) (.cse0 (= main_~p4~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse2 .cse3) (and .cse3 .cse0))) [2020-11-07 05:11:47,631 INFO L269 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-11-07 05:11:47,631 INFO L262 CegarLoopResult]: At program point L67(line 67) the Hoare annotation is: (let ((.cse7 (= main_~p5~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse6 (= main_~p2~0 0)) (.cse5 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse7 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse7 .cse6 .cse4) (and .cse5 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse7 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse7 .cse1 .cse4) (and .cse8 .cse5 .cse7 .cse6 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse8 .cse5 .cse3 .cse6 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4))) [2020-11-07 05:11:47,632 INFO L262 CegarLoopResult]: At program point L59-1(lines 26 90) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-11-07 05:11:47,632 INFO L269 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-11-07 05:11:47,632 INFO L262 CegarLoopResult]: At program point L51-1(lines 26 90) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-11-07 05:11:47,632 INFO L262 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse1 .cse4 .cse3) (and .cse0 .cse1 .cse4))) [2020-11-07 05:11:47,633 INFO L269 CegarLoopResult]: At program point L43(lines 43 45) the Hoare annotation is: true [2020-11-07 05:11:47,633 INFO L262 CegarLoopResult]: At program point L43-2(lines 26 90) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-11-07 05:11:47,633 INFO L269 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-11-07 05:11:47,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:11:47 BoogieIcfgContainer [2020-11-07 05:11:47,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:11:47,648 INFO L168 Benchmark]: Toolchain (without parser) took 15864.79 ms. Allocated memory was 152.0 MB in the beginning and 348.1 MB in the end (delta: 196.1 MB). Free memory was 127.6 MB in the beginning and 178.3 MB in the end (delta: -50.7 MB). Peak memory consumption was 207.9 MB. Max. memory is 8.0 GB. [2020-11-07 05:11:47,649 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 152.0 MB. Free memory is still 127.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:11:47,649 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.72 ms. Allocated memory is still 152.0 MB. Free memory was 127.0 MB in the beginning and 117.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:11:47,650 INFO L168 Benchmark]: Boogie Preprocessor took 40.98 ms. Allocated memory is still 152.0 MB. Free memory was 117.5 MB in the beginning and 115.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:11:47,650 INFO L168 Benchmark]: RCFGBuilder took 775.45 ms. Allocated memory is still 152.0 MB. Free memory was 115.9 MB in the beginning and 132.5 MB in the end (delta: -16.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:11:47,651 INFO L168 Benchmark]: TraceAbstraction took 14665.25 ms. Allocated memory was 152.0 MB in the beginning and 348.1 MB in the end (delta: 196.1 MB). Free memory was 132.0 MB in the beginning and 178.3 MB in the end (delta: -46.3 MB). Peak memory consumption was 212.7 MB. Max. memory is 8.0 GB. [2020-11-07 05:11:47,654 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 152.0 MB. Free memory is still 127.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 364.72 ms. Allocated memory is still 152.0 MB. Free memory was 127.0 MB in the beginning and 117.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 40.98 ms. Allocated memory is still 152.0 MB. Free memory was 117.5 MB in the beginning and 115.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 775.45 ms. Allocated memory is still 152.0 MB. Free memory was 115.9 MB in the beginning and 132.5 MB in the end (delta: -16.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 14665.25 ms. Allocated memory was 152.0 MB in the beginning and 348.1 MB in the end (delta: 196.1 MB). Free memory was 132.0 MB in the beginning and 178.3 MB in the end (delta: -46.3 MB). Peak memory consumption was 212.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.2s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1046 SDtfs, 1143 SDslu, 171 SDs, 0 SdLazy, 745 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=500occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 210 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 80 LocationsWithAnnotation, 116 PreInvPairs, 1004 NumberOfFragments, 2420 HoareAnnotationTreeSize, 116 FomulaSimplifications, 129125 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 80 FomulaSimplificationsInter, 6608 FormulaSimplificationTreeSizeReductionInter, 7.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 545 NumberOfCodeBlocks, 545 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 535 ConstructedInterpolants, 0 QuantifiedInterpolants, 50585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...