/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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:59:16,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:59:16,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:59:16,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:59:16,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:59:16,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:59:16,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:59:16,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:59:16,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:59:16,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:59:16,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:59:16,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:59:16,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:59:16,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:59:16,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:59:16,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:59:16,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:59:16,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:59:16,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:59:16,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:59:16,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:59:16,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:59:16,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:59:16,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:59:16,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:59:16,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:59:16,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:59:16,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:59:16,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:59:16,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:59:16,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:59:16,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:59:16,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:59:16,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:59:16,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:59:16,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:59:16,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:59:16,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:59:16,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:59:16,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:59:16,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:59:16,337 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:59:16,358 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:59:16,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:59:16,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:59:16,364 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:59:16,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:59:16,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:59:16,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:59:16,364 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:59:16,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:59:16,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:59:16,366 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:59:16,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:59:16,367 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:59:16,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:59:16,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:59:16,368 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:59:16,368 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:59:16,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:59:16,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:59:16,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:59:16,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:59:16,369 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:59:16,369 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-10-24 00:59:16,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:59:16,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:59:16,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:59:16,851 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:59:16,852 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:59:16,853 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2020-10-24 00:59:16,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17d748834/449ae43eb21a4cda88f78097c8120232/FLAG08ce86464 [2020-10-24 00:59:17,525 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:59:17,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2020-10-24 00:59:17,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17d748834/449ae43eb21a4cda88f78097c8120232/FLAG08ce86464 [2020-10-24 00:59:17,863 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17d748834/449ae43eb21a4cda88f78097c8120232 [2020-10-24 00:59:17,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:59:17,882 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:59:17,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:59:17,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:59:17,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:59:17,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:59:17" (1/1) ... [2020-10-24 00:59:17,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6698eaf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:17, skipping insertion in model container [2020-10-24 00:59:17,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:59:17" (1/1) ... [2020-10-24 00:59:17,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:59:17,938 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:59:18,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:59:18,111 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:59:18,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:59:18,149 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:59:18,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:18 WrapperNode [2020-10-24 00:59:18,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:59:18,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:59:18,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:59:18,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:59:18,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:18" (1/1) ... [2020-10-24 00:59:18,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:18" (1/1) ... [2020-10-24 00:59:18,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:18" (1/1) ... [2020-10-24 00:59:18,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:18" (1/1) ... [2020-10-24 00:59:18,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:18" (1/1) ... [2020-10-24 00:59:18,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:18" (1/1) ... [2020-10-24 00:59:18,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:18" (1/1) ... [2020-10-24 00:59:18,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:59:18,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:59:18,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:59:18,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:59:18,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:18" (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-10-24 00:59:18,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:59:18,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:59:18,276 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:59:18,277 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:59:18,277 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:59:18,277 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:59:18,277 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:59:18,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:59:18,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:59:18,278 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:59:18,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:59:18,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:59:18,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:59:18,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:59:18,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:59:18,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:59:18,710 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:59:18,710 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-24 00:59:18,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:59:18 BoogieIcfgContainer [2020-10-24 00:59:18,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:59:18,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:59:18,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:59:18,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:59:18,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:59:17" (1/3) ... [2020-10-24 00:59:18,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9f2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:59:18, skipping insertion in model container [2020-10-24 00:59:18,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:18" (2/3) ... [2020-10-24 00:59:18,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9f2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:59:18, skipping insertion in model container [2020-10-24 00:59:18,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:59:18" (3/3) ... [2020-10-24 00:59:18,725 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-10-24 00:59:18,739 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:59:18,745 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:59:18,761 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:59:18,793 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:59:18,793 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:59:18,794 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:59:18,794 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:59:18,794 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:59:18,794 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:59:18,794 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:59:18,794 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:59:18,824 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-10-24 00:59:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-24 00:59:18,837 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:18,838 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, 1] [2020-10-24 00:59:18,839 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:18,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:18,846 INFO L82 PathProgramCache]: Analyzing trace with hash 561928489, now seen corresponding path program 1 times [2020-10-24 00:59:18,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:18,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [419425448] [2020-10-24 00:59:18,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:19,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:19,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:19,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [419425448] [2020-10-24 00:59:19,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:19,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:19,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745273456] [2020-10-24 00:59:19,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:19,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:19,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:19,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:19,328 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2020-10-24 00:59:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:19,723 INFO L93 Difference]: Finished difference Result 181 states and 243 transitions. [2020-10-24 00:59:19,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:19,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-10-24 00:59:19,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:19,738 INFO L225 Difference]: With dead ends: 181 [2020-10-24 00:59:19,739 INFO L226 Difference]: Without dead ends: 120 [2020-10-24 00:59:19,743 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-10-24 00:59:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-10-24 00:59:19,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2020-10-24 00:59:19,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-24 00:59:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 151 transitions. [2020-10-24 00:59:19,813 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 151 transitions. Word has length 58 [2020-10-24 00:59:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:19,814 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 151 transitions. [2020-10-24 00:59:19,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:19,815 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 151 transitions. [2020-10-24 00:59:19,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-24 00:59:19,817 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:19,817 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, 1, 1] [2020-10-24 00:59:19,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:59:19,820 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:19,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:19,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1435115152, now seen corresponding path program 1 times [2020-10-24 00:59:19,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:19,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2026778581] [2020-10-24 00:59:19,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:19,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:19,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:19,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2026778581] [2020-10-24 00:59:19,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:19,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:19,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838099519] [2020-10-24 00:59:19,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:19,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:19,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:19,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:19,952 INFO L87 Difference]: Start difference. First operand 119 states and 151 transitions. Second operand 4 states. [2020-10-24 00:59:20,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:20,202 INFO L93 Difference]: Finished difference Result 144 states and 185 transitions. [2020-10-24 00:59:20,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:20,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-10-24 00:59:20,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:20,206 INFO L225 Difference]: With dead ends: 144 [2020-10-24 00:59:20,206 INFO L226 Difference]: Without dead ends: 141 [2020-10-24 00:59:20,208 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-10-24 00:59:20,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-10-24 00:59:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2020-10-24 00:59:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-24 00:59:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2020-10-24 00:59:20,236 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 59 [2020-10-24 00:59:20,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:20,237 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2020-10-24 00:59:20,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2020-10-24 00:59:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-24 00:59:20,239 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:20,239 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, 1, 1] [2020-10-24 00:59:20,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:59:20,240 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:20,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:20,241 INFO L82 PathProgramCache]: Analyzing trace with hash 247511734, now seen corresponding path program 1 times [2020-10-24 00:59:20,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:20,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1054058960] [2020-10-24 00:59:20,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:20,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:20,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1054058960] [2020-10-24 00:59:20,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:20,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:20,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074538549] [2020-10-24 00:59:20,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:20,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:20,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:20,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:20,370 INFO L87 Difference]: Start difference. First operand 119 states and 150 transitions. Second operand 4 states. [2020-10-24 00:59:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:20,664 INFO L93 Difference]: Finished difference Result 275 states and 367 transitions. [2020-10-24 00:59:20,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:20,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-10-24 00:59:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:20,668 INFO L225 Difference]: With dead ends: 275 [2020-10-24 00:59:20,668 INFO L226 Difference]: Without dead ends: 193 [2020-10-24 00:59:20,669 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-10-24 00:59:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-10-24 00:59:20,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2020-10-24 00:59:20,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-10-24 00:59:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 249 transitions. [2020-10-24 00:59:20,731 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 249 transitions. Word has length 59 [2020-10-24 00:59:20,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:20,733 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 249 transitions. [2020-10-24 00:59:20,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:20,734 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 249 transitions. [2020-10-24 00:59:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 00:59:20,738 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:20,739 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, 1, 1, 1] [2020-10-24 00:59:20,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:59:20,739 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:20,740 INFO L82 PathProgramCache]: Analyzing trace with hash 134996116, now seen corresponding path program 1 times [2020-10-24 00:59:20,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:20,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1940474099] [2020-10-24 00:59:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:20,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:20,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1940474099] [2020-10-24 00:59:20,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:20,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:20,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735960339] [2020-10-24 00:59:20,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:20,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:20,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:20,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:20,822 INFO L87 Difference]: Start difference. First operand 192 states and 249 transitions. Second operand 4 states. [2020-10-24 00:59:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:21,045 INFO L93 Difference]: Finished difference Result 234 states and 306 transitions. [2020-10-24 00:59:21,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:21,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-10-24 00:59:21,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:21,048 INFO L225 Difference]: With dead ends: 234 [2020-10-24 00:59:21,048 INFO L226 Difference]: Without dead ends: 231 [2020-10-24 00:59:21,049 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-10-24 00:59:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-10-24 00:59:21,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 192. [2020-10-24 00:59:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-10-24 00:59:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 247 transitions. [2020-10-24 00:59:21,105 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 247 transitions. Word has length 60 [2020-10-24 00:59:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:21,105 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 247 transitions. [2020-10-24 00:59:21,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:21,106 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 247 transitions. [2020-10-24 00:59:21,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 00:59:21,107 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:21,107 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, 1, 1, 1] [2020-10-24 00:59:21,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:59:21,108 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:21,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:21,109 INFO L82 PathProgramCache]: Analyzing trace with hash -909461547, now seen corresponding path program 1 times [2020-10-24 00:59:21,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:21,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2077407366] [2020-10-24 00:59:21,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:21,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:21,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2077407366] [2020-10-24 00:59:21,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:21,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:21,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531303543] [2020-10-24 00:59:21,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:21,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:21,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:21,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:21,195 INFO L87 Difference]: Start difference. First operand 192 states and 247 transitions. Second operand 4 states. [2020-10-24 00:59:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:21,441 INFO L93 Difference]: Finished difference Result 488 states and 650 transitions. [2020-10-24 00:59:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:21,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-10-24 00:59:21,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:21,444 INFO L225 Difference]: With dead ends: 488 [2020-10-24 00:59:21,444 INFO L226 Difference]: Without dead ends: 333 [2020-10-24 00:59:21,446 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-10-24 00:59:21,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-10-24 00:59:21,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2020-10-24 00:59:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-10-24 00:59:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 431 transitions. [2020-10-24 00:59:21,509 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 431 transitions. Word has length 60 [2020-10-24 00:59:21,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:21,510 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 431 transitions. [2020-10-24 00:59:21,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 431 transitions. [2020-10-24 00:59:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 00:59:21,512 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:21,512 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, 1, 1, 1, 1] [2020-10-24 00:59:21,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:59:21,512 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:21,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:21,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1879083938, now seen corresponding path program 1 times [2020-10-24 00:59:21,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:21,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [377160313] [2020-10-24 00:59:21,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:21,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:21,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [377160313] [2020-10-24 00:59:21,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:21,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:21,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338276661] [2020-10-24 00:59:21,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:21,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:21,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:21,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:21,584 INFO L87 Difference]: Start difference. First operand 332 states and 431 transitions. Second operand 4 states. [2020-10-24 00:59:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:21,926 INFO L93 Difference]: Finished difference Result 896 states and 1186 transitions. [2020-10-24 00:59:21,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:21,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-10-24 00:59:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:21,930 INFO L225 Difference]: With dead ends: 896 [2020-10-24 00:59:21,931 INFO L226 Difference]: Without dead ends: 601 [2020-10-24 00:59:21,935 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-10-24 00:59:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-10-24 00:59:22,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 600. [2020-10-24 00:59:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-10-24 00:59:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 775 transitions. [2020-10-24 00:59:22,067 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 775 transitions. Word has length 61 [2020-10-24 00:59:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:22,067 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 775 transitions. [2020-10-24 00:59:22,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 775 transitions. [2020-10-24 00:59:22,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 00:59:22,076 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:22,077 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, 1, 1, 1, 1] [2020-10-24 00:59:22,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:59:22,077 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:22,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:22,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1513976804, now seen corresponding path program 1 times [2020-10-24 00:59:22,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:22,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1880499848] [2020-10-24 00:59:22,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:22,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:22,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1880499848] [2020-10-24 00:59:22,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:22,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:22,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643868802] [2020-10-24 00:59:22,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:22,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:22,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:22,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:22,242 INFO L87 Difference]: Start difference. First operand 600 states and 775 transitions. Second operand 4 states. [2020-10-24 00:59:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:22,542 INFO L93 Difference]: Finished difference Result 732 states and 946 transitions. [2020-10-24 00:59:22,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:22,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-10-24 00:59:22,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:22,550 INFO L225 Difference]: With dead ends: 732 [2020-10-24 00:59:22,550 INFO L226 Difference]: Without dead ends: 729 [2020-10-24 00:59:22,552 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-10-24 00:59:22,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2020-10-24 00:59:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 600. [2020-10-24 00:59:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-10-24 00:59:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 767 transitions. [2020-10-24 00:59:22,706 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 767 transitions. Word has length 61 [2020-10-24 00:59:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:22,707 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 767 transitions. [2020-10-24 00:59:22,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 767 transitions. [2020-10-24 00:59:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-24 00:59:22,708 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:22,709 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, 1, 1, 1, 1, 1] [2020-10-24 00:59:22,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:59:22,709 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:22,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:22,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1092518240, now seen corresponding path program 1 times [2020-10-24 00:59:22,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:22,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [758230022] [2020-10-24 00:59:22,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:22,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:22,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [758230022] [2020-10-24 00:59:22,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:22,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:22,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818510164] [2020-10-24 00:59:22,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:22,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:22,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:22,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:22,845 INFO L87 Difference]: Start difference. First operand 600 states and 767 transitions. Second operand 4 states. [2020-10-24 00:59:23,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:23,190 INFO L93 Difference]: Finished difference Result 724 states and 922 transitions. [2020-10-24 00:59:23,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:23,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-10-24 00:59:23,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:23,196 INFO L225 Difference]: With dead ends: 724 [2020-10-24 00:59:23,196 INFO L226 Difference]: Without dead ends: 721 [2020-10-24 00:59:23,197 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-10-24 00:59:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2020-10-24 00:59:23,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 600. [2020-10-24 00:59:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-10-24 00:59:23,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 759 transitions. [2020-10-24 00:59:23,332 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 759 transitions. Word has length 62 [2020-10-24 00:59:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:23,332 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 759 transitions. [2020-10-24 00:59:23,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 759 transitions. [2020-10-24 00:59:23,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-24 00:59:23,341 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:23,344 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, 1, 1, 1, 1, 1] [2020-10-24 00:59:23,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:59:23,345 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:23,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:23,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1870307711, now seen corresponding path program 1 times [2020-10-24 00:59:23,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:23,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1941848865] [2020-10-24 00:59:23,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:23,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:23,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1941848865] [2020-10-24 00:59:23,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:23,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:23,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738799285] [2020-10-24 00:59:23,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:23,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:23,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:23,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:23,433 INFO L87 Difference]: Start difference. First operand 600 states and 759 transitions. Second operand 4 states. [2020-10-24 00:59:23,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:23,841 INFO L93 Difference]: Finished difference Result 1676 states and 2138 transitions. [2020-10-24 00:59:23,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:23,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-10-24 00:59:23,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:23,849 INFO L225 Difference]: With dead ends: 1676 [2020-10-24 00:59:23,849 INFO L226 Difference]: Without dead ends: 1113 [2020-10-24 00:59:23,851 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-10-24 00:59:23,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2020-10-24 00:59:24,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1112. [2020-10-24 00:59:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2020-10-24 00:59:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1383 transitions. [2020-10-24 00:59:24,030 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1383 transitions. Word has length 62 [2020-10-24 00:59:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:24,031 INFO L481 AbstractCegarLoop]: Abstraction has 1112 states and 1383 transitions. [2020-10-24 00:59:24,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:24,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1383 transitions. [2020-10-24 00:59:24,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-24 00:59:24,038 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:24,038 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, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:24,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:59:24,039 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:24,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2137320306, now seen corresponding path program 1 times [2020-10-24 00:59:24,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:24,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [477205727] [2020-10-24 00:59:24,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:24,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:24,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [477205727] [2020-10-24 00:59:24,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:24,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:24,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698476325] [2020-10-24 00:59:24,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:24,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:24,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:24,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:24,137 INFO L87 Difference]: Start difference. First operand 1112 states and 1383 transitions. Second operand 4 states. [2020-10-24 00:59:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:24,742 INFO L93 Difference]: Finished difference Result 3164 states and 3946 transitions. [2020-10-24 00:59:24,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:24,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-10-24 00:59:24,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:24,752 INFO L225 Difference]: With dead ends: 3164 [2020-10-24 00:59:24,752 INFO L226 Difference]: Without dead ends: 1625 [2020-10-24 00:59:24,758 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-10-24 00:59:24,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2020-10-24 00:59:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1624. [2020-10-24 00:59:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2020-10-24 00:59:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1943 transitions. [2020-10-24 00:59:25,027 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 1943 transitions. Word has length 63 [2020-10-24 00:59:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:25,027 INFO L481 AbstractCegarLoop]: Abstraction has 1624 states and 1943 transitions. [2020-10-24 00:59:25,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1943 transitions. [2020-10-24 00:59:25,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-24 00:59:25,039 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:25,040 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, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:25,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:59:25,040 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:25,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:25,041 INFO L82 PathProgramCache]: Analyzing trace with hash -912193112, now seen corresponding path program 1 times [2020-10-24 00:59:25,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:25,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [28535531] [2020-10-24 00:59:25,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:25,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:25,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [28535531] [2020-10-24 00:59:25,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:25,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:25,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464336829] [2020-10-24 00:59:25,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:25,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:25,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:25,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:25,124 INFO L87 Difference]: Start difference. First operand 1624 states and 1943 transitions. Second operand 4 states. [2020-10-24 00:59:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:25,579 INFO L93 Difference]: Finished difference Result 1836 states and 2170 transitions. [2020-10-24 00:59:25,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:25,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-10-24 00:59:25,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:25,587 INFO L225 Difference]: With dead ends: 1836 [2020-10-24 00:59:25,588 INFO L226 Difference]: Without dead ends: 1321 [2020-10-24 00:59:25,590 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-10-24 00:59:25,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2020-10-24 00:59:25,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1112. [2020-10-24 00:59:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2020-10-24 00:59:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1303 transitions. [2020-10-24 00:59:25,804 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1303 transitions. Word has length 63 [2020-10-24 00:59:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:25,805 INFO L481 AbstractCegarLoop]: Abstraction has 1112 states and 1303 transitions. [2020-10-24 00:59:25,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:25,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1303 transitions. [2020-10-24 00:59:25,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-24 00:59:25,807 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:25,807 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:25,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:59:25,808 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:25,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:25,808 INFO L82 PathProgramCache]: Analyzing trace with hash 382930092, now seen corresponding path program 1 times [2020-10-24 00:59:25,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:25,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2103460059] [2020-10-24 00:59:25,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:25,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:25,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2103460059] [2020-10-24 00:59:25,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:25,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:25,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248901198] [2020-10-24 00:59:25,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:25,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:25,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:25,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:25,868 INFO L87 Difference]: Start difference. First operand 1112 states and 1303 transitions. Second operand 4 states. [2020-10-24 00:59:26,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:26,192 INFO L93 Difference]: Finished difference Result 1112 states and 1303 transitions. [2020-10-24 00:59:26,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:26,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-10-24 00:59:26,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:26,193 INFO L225 Difference]: With dead ends: 1112 [2020-10-24 00:59:26,194 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:59:26,196 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-10-24 00:59:26,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:59:26,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:59:26,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:59:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:59:26,197 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2020-10-24 00:59:26,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:26,198 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:59:26,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:26,198 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:59:26,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:59:26,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 00:59:26,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:59:26,411 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-24 00:59:26,568 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 31 [2020-10-24 00:59:27,031 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 53 [2020-10-24 00:59:27,183 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 41 [2020-10-24 00:59:27,444 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-10-24 00:59:27,789 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-10-24 00:59:27,954 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-10-24 00:59:28,170 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-10-24 00:59:28,299 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 85 [2020-10-24 00:59:28,486 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 41 [2020-10-24 00:59:28,692 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-10-24 00:59:28,868 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 45 [2020-10-24 00:59:28,998 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 34 [2020-10-24 00:59:29,329 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-10-24 00:59:29,436 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2020-10-24 00:59:29,802 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-24 00:59:30,070 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 34 [2020-10-24 00:59:30,239 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 39 [2020-10-24 00:59:30,776 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-24 00:59:32,096 WARN L193 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-10-24 00:59:33,270 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-24 00:59:33,845 WARN L193 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-10-24 00:59:33,963 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-10-24 00:59:34,187 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-24 00:59:34,873 WARN L193 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-10-24 00:59:36,072 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-24 00:59:36,305 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-10-24 00:59:36,564 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-24 00:59:37,189 WARN L193 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-24 00:59:38,278 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-24 00:59:39,524 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-10-24 00:59:39,757 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-10-24 00:59:42,595 WARN L193 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-10-24 00:59:43,064 WARN L193 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-24 00:59:43,515 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-24 00:59:43,523 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-24 00:59:43,523 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-24 00:59:43,523 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-24 00:59:43,523 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-24 00:59:43,523 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-24 00:59:43,523 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-24 00:59:43,523 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:59:43,523 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-24 00:59:43,524 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 00:59:43,524 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-24 00:59:43,524 INFO L270 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-10-24 00:59:43,524 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-24 00:59:43,524 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-24 00:59:43,524 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:59:43,524 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:59:43,524 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:59:43,524 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 00:59:43,524 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 00:59:43,525 INFO L277 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-10-24 00:59:43,525 INFO L270 CegarLoopResult]: At program point L60-1(lines 29 104) 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-10-24 00:59:43,525 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 6 109) the Hoare annotation is: true [2020-10-24 00:59:43,525 INFO L270 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (let ((.cse3 (= main_~p5~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse2 (= main_~p6~0 0)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse4 .cse5) (and .cse1 .cse2 .cse6 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse4 .cse6 .cse5))) [2020-10-24 00:59:43,525 INFO L270 CegarLoopResult]: At program point L52-1(lines 29 104) 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-10-24 00:59:43,525 INFO L277 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-10-24 00:59:43,526 INFO L277 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-10-24 00:59:43,526 INFO L277 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-10-24 00:59:43,526 INFO L277 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: true [2020-10-24 00:59:43,526 INFO L270 CegarLoopResult]: At program point L69(line 69) 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-10-24 00:59:43,526 INFO L277 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-10-24 00:59:43,527 INFO L270 CegarLoopResult]: At program point L61(line 61) 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-10-24 00:59:43,527 INFO L270 CegarLoopResult]: At program point L94-1(lines 29 104) the Hoare annotation is: (or (= main_~p6~0 0) (= main_~lk6~0 1)) [2020-10-24 00:59:43,527 INFO L270 CegarLoopResult]: At program point L86(line 86) the Hoare annotation is: (let ((.cse3 (= main_~p5~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse2 (= main_~p6~0 0)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse4 .cse5) (and .cse1 .cse2 .cse6 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse4 .cse6 .cse5))) [2020-10-24 00:59:43,527 INFO L270 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-10-24 00:59:43,527 INFO L277 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-10-24 00:59:43,527 INFO L277 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-10-24 00:59:43,527 INFO L277 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-10-24 00:59:43,527 INFO L277 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-10-24 00:59:43,528 INFO L270 CegarLoopResult]: At program point L95(line 95) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1))) (or (and (= main_~lk6~0 1) .cse0) (and (= main_~p6~0 0) .cse0))) [2020-10-24 00:59:43,528 INFO L277 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-10-24 00:59:43,528 INFO L270 CegarLoopResult]: At program point L79-1(lines 29 104) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse4 (= main_~p6~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5) (and .cse0 .cse6 .cse4 .cse2) (and .cse4 .cse1 .cse2 .cse7) (and .cse6 .cse4 .cse7 .cse5) (and .cse1 .cse2 .cse3 .cse7) (and .cse1 .cse3 .cse7 .cse5) (and .cse0 .cse4 .cse1 .cse2) (and .cse4 .cse1 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3) (and .cse0 .cse6 .cse3 .cse5) (and .cse6 .cse4 .cse2 .cse7) (and .cse6 .cse2 .cse3 .cse7) (and .cse0 .cse6 .cse4 .cse5) (and .cse6 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse3 .cse5))) [2020-10-24 00:59:43,528 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 6 109) the Hoare annotation is: true [2020-10-24 00:59:43,528 INFO L277 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-10-24 00:59:43,529 INFO L270 CegarLoopResult]: At program point L96(line 96) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1))) (or (and (= main_~lk6~0 1) .cse0) (and (= main_~p6~0 0) .cse0))) [2020-10-24 00:59:43,529 INFO L277 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-10-24 00:59:43,529 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 6 109) the Hoare annotation is: true [2020-10-24 00:59:43,529 INFO L277 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: true [2020-10-24 00:59:43,529 INFO L277 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: true [2020-10-24 00:59:43,529 INFO L270 CegarLoopResult]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse5 (= main_~p4~0 0)) (.cse8 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse7 .cse1 .cse3 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse3) (and .cse1 .cse3 .cse4 .cse5 .cse8) (and .cse6 .cse7 .cse3 .cse5 .cse8) (and .cse6 .cse7 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse6 .cse3 .cse4 .cse5 .cse8) (and .cse0 .cse6 .cse7 .cse3 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse8) (and .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse3) (and .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse3 .cse5 .cse8))) [2020-10-24 00:59:43,529 INFO L277 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-10-24 00:59:43,530 INFO L277 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-10-24 00:59:43,530 INFO L277 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-10-24 00:59:43,530 INFO L277 CegarLoopResult]: At program point L105(lines 7 109) the Hoare annotation is: true [2020-10-24 00:59:43,530 INFO L277 CegarLoopResult]: At program point L31(lines 31 33) the Hoare annotation is: true [2020-10-24 00:59:43,530 INFO L270 CegarLoopResult]: At program point L64-1(lines 29 104) 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 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .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 .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .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 .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-10-24 00:59:43,530 INFO L270 CegarLoopResult]: At program point L89-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse3 (= main_~p6~0 0)) (.cse2 (= main_~p5~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-10-24 00:59:43,531 INFO L277 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-10-24 00:59:43,531 INFO L270 CegarLoopResult]: At program point L56-1(lines 29 104) 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-10-24 00:59:43,531 INFO L277 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-10-24 00:59:43,531 INFO L277 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: true [2020-10-24 00:59:43,531 INFO L270 CegarLoopResult]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse5 (= main_~p4~0 0)) (.cse8 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse7 .cse1 .cse3 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse3) (and .cse1 .cse3 .cse4 .cse5 .cse8) (and .cse6 .cse7 .cse3 .cse5 .cse8) (and .cse6 .cse7 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse6 .cse3 .cse4 .cse5 .cse8) (and .cse0 .cse6 .cse7 .cse3 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse8) (and .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse3) (and .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse3 .cse5 .cse8))) [2020-10-24 00:59:43,532 INFO L277 CegarLoopResult]: At program point L48(lines 48 50) the Hoare annotation is: true [2020-10-24 00:59:43,532 INFO L277 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-10-24 00:59:43,532 INFO L270 CegarLoopResult]: At program point L48-2(lines 29 104) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-10-24 00:59:43,532 INFO L277 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-10-24 00:59:43,532 INFO L270 CegarLoopResult]: At program point L65(line 65) 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-10-24 00:59:43,532 INFO L270 CegarLoopResult]: At program point L90(line 90) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p6~0 0)) (.cse4 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse2 .cse3) (and .cse0 .cse1 .cse4))) [2020-10-24 00:59:43,533 INFO L270 CegarLoopResult]: At program point L57(line 57) 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-10-24 00:59:43,533 INFO L277 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-10-24 00:59:43,533 INFO L277 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: true [2020-10-24 00:59:43,533 INFO L270 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: false [2020-10-24 00:59:43,533 INFO L270 CegarLoopResult]: At program point L74-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~p2~0 0)) (.cse5 (= main_~p6~0 0)) (.cse6 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse9 (= main_~p4~0 0)) (.cse7 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse3 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse8) (and .cse1 .cse4 .cse9 .cse7 .cse8) (and .cse6 .cse3 .cse4 .cse9 .cse7) (and .cse0 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse4 .cse7 .cse8) (and .cse6 .cse2 .cse4 .cse9 .cse8) (and .cse0 .cse6 .cse4 .cse7 .cse8) (and .cse1 .cse3 .cse4 .cse9 .cse7) (and .cse0 .cse1 .cse5 .cse3 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse6 .cse4 .cse9 .cse7 .cse8) (and .cse5 .cse6 .cse9 .cse7 .cse8) (and .cse0 .cse5 .cse6 .cse2 .cse8) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse2 .cse4 .cse8) (and .cse6 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse5 .cse6 .cse2 .cse3) (and .cse1 .cse5 .cse3 .cse9 .cse7) (and .cse1 .cse5 .cse2 .cse3 .cse9) (and .cse0 .cse6 .cse3 .cse4 .cse7) (and .cse1 .cse5 .cse2 .cse9 .cse8) (and .cse5 .cse6 .cse2 .cse9 .cse8) (and .cse1 .cse2 .cse4 .cse9 .cse8) (and .cse1 .cse5 .cse9 .cse7 .cse8) (and .cse0 .cse1 .cse5 .cse7 .cse8) (and .cse5 .cse6 .cse2 .cse3 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse8) (and .cse5 .cse6 .cse3 .cse9 .cse7))) [2020-10-24 00:59:43,533 INFO L277 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-10-24 00:59:43,534 INFO L277 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-10-24 00:59:43,534 INFO L277 CegarLoopResult]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2020-10-24 00:59:43,534 INFO L270 CegarLoopResult]: At program point L91(line 91) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p6~0 0)) (.cse4 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse2 .cse3) (and .cse0 .cse1 .cse4))) [2020-10-24 00:59:43,534 INFO L277 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-10-24 00:59:43,534 INFO L277 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-10-24 00:59:43,534 INFO L277 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-10-24 00:59:43,534 INFO L270 CegarLoopResult]: At program point L108(line 108) the Hoare annotation is: false [2020-10-24 00:59:43,535 INFO L270 CegarLoopResult]: At program point L75(line 75) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse10 (= main_~lk2~0 1)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse8 (= main_~lk3~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse10 .cse6 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse5) (and .cse2 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse8 .cse1 .cse10 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse5) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5))) [2020-10-24 00:59:43,535 INFO L277 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-10-24 00:59:43,535 INFO L277 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-10-24 00:59:43,535 INFO L270 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: (= main_~lk6~0 1) [2020-10-24 00:59:43,535 INFO L270 CegarLoopResult]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2020-10-24 00:59:43,535 INFO L277 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-10-24 00:59:43,536 INFO L270 CegarLoopResult]: At program point L84-1(lines 29 104) the Hoare annotation is: (let ((.cse5 (= main_~lk6~0 1)) (.cse4 (= main_~p5~0 0)) (.cse1 (= main_~p4~0 0)) (.cse3 (= main_~lk4~0 1)) (.cse0 (= main_~p6~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse3 .cse5 .cse2) (and .cse4 .cse5 .cse1) (and .cse5 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse4 .cse1) (and .cse3 .cse0 .cse2))) [2020-10-24 00:59:43,536 INFO L277 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-10-24 00:59:43,536 INFO L270 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse10 (= main_~lk2~0 1)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse8 (= main_~lk3~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse10 .cse6 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse5) (and .cse2 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse8 .cse1 .cse10 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse5) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5))) [2020-10-24 00:59:43,536 INFO L270 CegarLoopResult]: At program point L101(line 101) the Hoare annotation is: (= main_~lk6~0 1) [2020-10-24 00:59:43,537 INFO L270 CegarLoopResult]: At program point L68-1(lines 29 104) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse9 (= main_~p1~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse9) (and .cse10 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse9 .cse4) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse5) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse5) (and .cse10 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse1 .cse2 .cse11 .cse7 .cse4 .cse5) (and .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse9 .cse4) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse10 .cse1 .cse7 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse5) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2020-10-24 00:59:43,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:59:43 BoogieIcfgContainer [2020-10-24 00:59:43,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:59:43,552 INFO L168 Benchmark]: Toolchain (without parser) took 25676.13 ms. Allocated memory was 156.2 MB in the beginning and 602.9 MB in the end (delta: 446.7 MB). Free memory was 133.2 MB in the beginning and 236.4 MB in the end (delta: -103.3 MB). Peak memory consumption was 358.7 MB. Max. memory is 8.0 GB. [2020-10-24 00:59:43,552 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 156.2 MB. Free memory was 130.7 MB in the beginning and 130.6 MB in the end (delta: 77.6 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:59:43,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.95 ms. Allocated memory is still 156.2 MB. Free memory was 132.6 MB in the beginning and 122.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:59:43,554 INFO L168 Benchmark]: Boogie Preprocessor took 35.94 ms. Allocated memory is still 156.2 MB. Free memory was 122.9 MB in the beginning and 121.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 00:59:43,554 INFO L168 Benchmark]: RCFGBuilder took 525.05 ms. Allocated memory is still 156.2 MB. Free memory was 121.2 MB in the beginning and 133.5 MB in the end (delta: -12.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 8.0 GB. [2020-10-24 00:59:43,555 INFO L168 Benchmark]: TraceAbstraction took 24834.50 ms. Allocated memory was 156.2 MB in the beginning and 602.9 MB in the end (delta: 446.7 MB). Free memory was 133.0 MB in the beginning and 236.4 MB in the end (delta: -103.4 MB). Peak memory consumption was 358.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:59:43,558 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 156.2 MB. Free memory was 130.7 MB in the beginning and 130.6 MB in the end (delta: 77.6 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 262.95 ms. Allocated memory is still 156.2 MB. Free memory was 132.6 MB in the beginning and 122.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 35.94 ms. Allocated memory is still 156.2 MB. Free memory was 122.9 MB in the beginning and 121.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 525.05 ms. Allocated memory is still 156.2 MB. Free memory was 121.2 MB in the beginning and 133.5 MB in the end (delta: -12.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 24834.50 ms. Allocated memory was 156.2 MB in the beginning and 602.9 MB in the end (delta: 446.7 MB). Free memory was 133.0 MB in the beginning and 236.4 MB in the end (delta: -103.4 MB). Peak memory consumption was 358.0 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: 29]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - 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, 90 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1456 SDtfs, 1641 SDslu, 202 SDs, 0 SdLazy, 1044 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1624occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 526 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 90 LocationsWithAnnotation, 134 PreInvPairs, 2190 NumberOfFragments, 5886 HoareAnnotationTreeSize, 134 FomulaSimplifications, 372834 FormulaSimplificationTreeSizeReduction, 4.0s HoareSimplificationTime, 90 FomulaSimplificationsInter, 12518 FormulaSimplificationTreeSizeReductionInter, 13.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 732 NumberOfCodeBlocks, 732 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 720 ConstructedInterpolants, 0 QuantifiedInterpolants, 74204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...