/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-7d8eed3 [2020-11-07 05:11:31,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:11:31,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:11:31,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:11:31,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:11:31,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:11:31,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:11:31,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:11:31,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:11:31,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:11:31,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:11:31,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:11:31,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:11:31,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:11:31,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:11:31,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:11:31,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:11:31,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:11:31,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:11:32,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:11:32,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:11:32,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:11:32,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:11:32,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:11:32,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:11:32,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:11:32,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:11:32,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:11:32,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:11:32,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:11:32,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:11:32,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:11:32,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:11:32,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:11:32,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:11:32,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:11:32,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:11:32,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:11:32,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:11:32,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:11:32,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:11:32,044 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:11:32,057 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:11:32,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:11:32,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:11:32,065 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:11:32,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:11:32,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:11:32,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:11:32,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:11:32,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:11:32,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:11:32,067 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:11:32,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:11:32,067 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:11:32,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:11:32,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:11:32,068 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:11:32,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:11:32,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:11:32,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:11:32,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:11:32,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:11:32,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:11:32,070 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 05:11:32,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:11:32,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:11:32,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:11:32,560 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:11:32,560 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:11:32,561 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-11-07 05:11:32,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e5aae890/2b3a289136ea4436a318b0cc511f854e/FLAG45acf80b4 [2020-11-07 05:11:33,274 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:11:33,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2020-11-07 05:11:33,284 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e5aae890/2b3a289136ea4436a318b0cc511f854e/FLAG45acf80b4 [2020-11-07 05:11:33,663 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e5aae890/2b3a289136ea4436a318b0cc511f854e [2020-11-07 05:11:33,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:11:33,677 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:11:33,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:11:33,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:11:33,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:11:33,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:11:33" (1/1) ... [2020-11-07 05:11:33,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd3882f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:33, skipping insertion in model container [2020-11-07 05:11:33,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:11:33" (1/1) ... [2020-11-07 05:11:33,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:11:33,729 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:11:33,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:11:33,963 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:11:33,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:11:34,005 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:11:34,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:34 WrapperNode [2020-11-07 05:11:34,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:11:34,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:11:34,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:11:34,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:11:34,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:34" (1/1) ... [2020-11-07 05:11:34,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:34" (1/1) ... [2020-11-07 05:11:34,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:34" (1/1) ... [2020-11-07 05:11:34,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:34" (1/1) ... [2020-11-07 05:11:34,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:34" (1/1) ... [2020-11-07 05:11:34,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:34" (1/1) ... [2020-11-07 05:11:34,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:34" (1/1) ... [2020-11-07 05:11:34,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:11:34,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:11:34,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:11:34,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:11:34,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:11:34,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:11:34,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:11:34,127 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:11:34,127 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:11:34,127 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:11:34,127 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:11:34,127 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:11:34,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:11:34,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:11:34,128 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:11:34,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:11:34,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:11:34,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:11:34,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:11:34,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:11:34,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:11:34,717 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:11:34,718 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 05:11:34,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:11:34 BoogieIcfgContainer [2020-11-07 05:11:34,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:11:34,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:11:34,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:11:34,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:11:34,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:11:33" (1/3) ... [2020-11-07 05:11:34,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2037d139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:11:34, skipping insertion in model container [2020-11-07 05:11:34,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:34" (2/3) ... [2020-11-07 05:11:34,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2037d139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:11:34, skipping insertion in model container [2020-11-07 05:11:34,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:11:34" (3/3) ... [2020-11-07 05:11:34,730 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-11-07 05:11:34,748 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:11:34,752 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:11:34,765 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:11:34,791 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:11:34,791 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:11:34,791 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:11:34,791 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:11:34,792 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:11:34,792 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:11:34,792 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:11:34,792 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:11:34,811 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-11-07 05:11:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-07 05:11:34,823 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:34,824 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-11-07 05:11:34,825 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:34,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:34,832 INFO L82 PathProgramCache]: Analyzing trace with hash 561928489, now seen corresponding path program 1 times [2020-11-07 05:11:34,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:34,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1064432204] [2020-11-07 05:11:34,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:35,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:35,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1064432204] [2020-11-07 05:11:35,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:35,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:35,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052871600] [2020-11-07 05:11:35,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:35,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:35,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:35,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:35,268 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2020-11-07 05:11:35,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:35,649 INFO L93 Difference]: Finished difference Result 181 states and 243 transitions. [2020-11-07 05:11:35,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:35,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-11-07 05:11:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:35,664 INFO L225 Difference]: With dead ends: 181 [2020-11-07 05:11:35,664 INFO L226 Difference]: Without dead ends: 120 [2020-11-07 05:11:35,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:35,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-11-07 05:11:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2020-11-07 05:11:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-11-07 05:11:35,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 151 transitions. [2020-11-07 05:11:35,738 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 151 transitions. Word has length 58 [2020-11-07 05:11:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:35,739 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 151 transitions. [2020-11-07 05:11:35,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 151 transitions. [2020-11-07 05:11:35,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 05:11:35,742 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:35,742 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-11-07 05:11:35,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:11:35,743 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:35,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:35,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1435115152, now seen corresponding path program 1 times [2020-11-07 05:11:35,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:35,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1281035723] [2020-11-07 05:11:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:35,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:35,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1281035723] [2020-11-07 05:11:35,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:35,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:35,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853468732] [2020-11-07 05:11:35,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:35,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:35,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:35,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:35,882 INFO L87 Difference]: Start difference. First operand 119 states and 151 transitions. Second operand 4 states. [2020-11-07 05:11:36,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:36,120 INFO L93 Difference]: Finished difference Result 144 states and 185 transitions. [2020-11-07 05:11:36,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:36,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-11-07 05:11:36,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:36,123 INFO L225 Difference]: With dead ends: 144 [2020-11-07 05:11:36,123 INFO L226 Difference]: Without dead ends: 141 [2020-11-07 05:11:36,125 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:36,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-11-07 05:11:36,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2020-11-07 05:11:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-11-07 05:11:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2020-11-07 05:11:36,154 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 59 [2020-11-07 05:11:36,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:36,154 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2020-11-07 05:11:36,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:36,154 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2020-11-07 05:11:36,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 05:11:36,156 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:36,156 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-11-07 05:11:36,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:11:36,157 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:36,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:36,157 INFO L82 PathProgramCache]: Analyzing trace with hash 247511734, now seen corresponding path program 1 times [2020-11-07 05:11:36,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:36,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1100090869] [2020-11-07 05:11:36,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:36,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:36,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:36,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1100090869] [2020-11-07 05:11:36,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:36,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:36,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95105304] [2020-11-07 05:11:36,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:36,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:36,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:36,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:36,246 INFO L87 Difference]: Start difference. First operand 119 states and 150 transitions. Second operand 4 states. [2020-11-07 05:11:36,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:36,502 INFO L93 Difference]: Finished difference Result 275 states and 367 transitions. [2020-11-07 05:11:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:36,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-11-07 05:11:36,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:36,505 INFO L225 Difference]: With dead ends: 275 [2020-11-07 05:11:36,506 INFO L226 Difference]: Without dead ends: 193 [2020-11-07 05:11:36,507 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-11-07 05:11:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2020-11-07 05:11:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-11-07 05:11:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 249 transitions. [2020-11-07 05:11:36,582 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 249 transitions. Word has length 59 [2020-11-07 05:11:36,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:36,583 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 249 transitions. [2020-11-07 05:11:36,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:36,584 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 249 transitions. [2020-11-07 05:11:36,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 05:11:36,590 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:36,590 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-11-07 05:11:36,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:11:36,591 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:36,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:36,591 INFO L82 PathProgramCache]: Analyzing trace with hash 134996116, now seen corresponding path program 1 times [2020-11-07 05:11:36,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:36,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1472035791] [2020-11-07 05:11:36,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:36,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:36,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1472035791] [2020-11-07 05:11:36,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:36,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:36,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033323807] [2020-11-07 05:11:36,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:36,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:36,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:36,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:36,747 INFO L87 Difference]: Start difference. First operand 192 states and 249 transitions. Second operand 4 states. [2020-11-07 05:11:37,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:37,014 INFO L93 Difference]: Finished difference Result 234 states and 306 transitions. [2020-11-07 05:11:37,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:37,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-11-07 05:11:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:37,016 INFO L225 Difference]: With dead ends: 234 [2020-11-07 05:11:37,017 INFO L226 Difference]: Without dead ends: 231 [2020-11-07 05:11:37,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-11-07 05:11:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 192. [2020-11-07 05:11:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-11-07 05:11:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 247 transitions. [2020-11-07 05:11:37,079 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 247 transitions. Word has length 60 [2020-11-07 05:11:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:37,080 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 247 transitions. [2020-11-07 05:11:37,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 247 transitions. [2020-11-07 05:11:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 05:11:37,094 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:37,094 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-11-07 05:11:37,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:11:37,094 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:37,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:37,095 INFO L82 PathProgramCache]: Analyzing trace with hash -909461547, now seen corresponding path program 1 times [2020-11-07 05:11:37,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:37,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [592099770] [2020-11-07 05:11:37,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:37,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:37,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [592099770] [2020-11-07 05:11:37,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:37,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:37,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720621570] [2020-11-07 05:11:37,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:37,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:37,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:37,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:37,187 INFO L87 Difference]: Start difference. First operand 192 states and 247 transitions. Second operand 4 states. [2020-11-07 05:11:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:37,470 INFO L93 Difference]: Finished difference Result 488 states and 650 transitions. [2020-11-07 05:11:37,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:37,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-11-07 05:11:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:37,473 INFO L225 Difference]: With dead ends: 488 [2020-11-07 05:11:37,474 INFO L226 Difference]: Without dead ends: 333 [2020-11-07 05:11:37,475 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:37,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-11-07 05:11:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2020-11-07 05:11:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-11-07 05:11:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 431 transitions. [2020-11-07 05:11:37,537 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 431 transitions. Word has length 60 [2020-11-07 05:11:37,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:37,537 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 431 transitions. [2020-11-07 05:11:37,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 431 transitions. [2020-11-07 05:11:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 05:11:37,539 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:37,539 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-11-07 05:11:37,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:11:37,539 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:37,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:37,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1879083938, now seen corresponding path program 1 times [2020-11-07 05:11:37,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:37,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1956390656] [2020-11-07 05:11:37,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:37,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:37,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1956390656] [2020-11-07 05:11:37,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:37,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:37,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991777486] [2020-11-07 05:11:37,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:37,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:37,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:37,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:37,626 INFO L87 Difference]: Start difference. First operand 332 states and 431 transitions. Second operand 4 states. [2020-11-07 05:11:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:37,949 INFO L93 Difference]: Finished difference Result 896 states and 1186 transitions. [2020-11-07 05:11:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:37,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-11-07 05:11:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:37,953 INFO L225 Difference]: With dead ends: 896 [2020-11-07 05:11:37,953 INFO L226 Difference]: Without dead ends: 601 [2020-11-07 05:11:37,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:37,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-11-07 05:11:38,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 600. [2020-11-07 05:11:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-11-07 05:11:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 775 transitions. [2020-11-07 05:11:38,060 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 775 transitions. Word has length 61 [2020-11-07 05:11:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:38,061 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 775 transitions. [2020-11-07 05:11:38,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:38,061 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 775 transitions. [2020-11-07 05:11:38,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 05:11:38,062 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:38,062 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-11-07 05:11:38,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:11:38,063 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:38,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:38,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1513976804, now seen corresponding path program 1 times [2020-11-07 05:11:38,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:38,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1319682838] [2020-11-07 05:11:38,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:38,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:38,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1319682838] [2020-11-07 05:11:38,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:38,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:38,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525791553] [2020-11-07 05:11:38,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:38,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:38,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:38,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:38,150 INFO L87 Difference]: Start difference. First operand 600 states and 775 transitions. Second operand 4 states. [2020-11-07 05:11:38,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:38,459 INFO L93 Difference]: Finished difference Result 732 states and 946 transitions. [2020-11-07 05:11:38,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:38,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-11-07 05:11:38,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:38,465 INFO L225 Difference]: With dead ends: 732 [2020-11-07 05:11:38,465 INFO L226 Difference]: Without dead ends: 729 [2020-11-07 05:11:38,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2020-11-07 05:11:38,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 600. [2020-11-07 05:11:38,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-11-07 05:11:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 767 transitions. [2020-11-07 05:11:38,580 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 767 transitions. Word has length 61 [2020-11-07 05:11:38,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:38,580 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 767 transitions. [2020-11-07 05:11:38,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:38,580 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 767 transitions. [2020-11-07 05:11:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 05:11:38,581 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:38,582 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-11-07 05:11:38,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:11:38,582 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:38,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:38,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1092518240, now seen corresponding path program 1 times [2020-11-07 05:11:38,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:38,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [317013375] [2020-11-07 05:11:38,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:38,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:38,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [317013375] [2020-11-07 05:11:38,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:38,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:38,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230700629] [2020-11-07 05:11:38,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:38,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:38,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:38,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:38,645 INFO L87 Difference]: Start difference. First operand 600 states and 767 transitions. Second operand 4 states. [2020-11-07 05:11:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:38,998 INFO L93 Difference]: Finished difference Result 724 states and 922 transitions. [2020-11-07 05:11:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:38,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-11-07 05:11:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:39,003 INFO L225 Difference]: With dead ends: 724 [2020-11-07 05:11:39,004 INFO L226 Difference]: Without dead ends: 721 [2020-11-07 05:11:39,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:39,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2020-11-07 05:11:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 600. [2020-11-07 05:11:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-11-07 05:11:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 759 transitions. [2020-11-07 05:11:39,132 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 759 transitions. Word has length 62 [2020-11-07 05:11:39,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:39,132 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 759 transitions. [2020-11-07 05:11:39,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:39,133 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 759 transitions. [2020-11-07 05:11:39,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 05:11:39,134 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:39,134 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-11-07 05:11:39,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:11:39,135 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:39,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:39,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1870307711, now seen corresponding path program 1 times [2020-11-07 05:11:39,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:39,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [343188099] [2020-11-07 05:11:39,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:39,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:39,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [343188099] [2020-11-07 05:11:39,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:39,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:39,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448573143] [2020-11-07 05:11:39,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:39,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:39,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:39,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:39,197 INFO L87 Difference]: Start difference. First operand 600 states and 759 transitions. Second operand 4 states. [2020-11-07 05:11:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:39,584 INFO L93 Difference]: Finished difference Result 1676 states and 2138 transitions. [2020-11-07 05:11:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:39,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-11-07 05:11:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:39,590 INFO L225 Difference]: With dead ends: 1676 [2020-11-07 05:11:39,590 INFO L226 Difference]: Without dead ends: 1113 [2020-11-07 05:11:39,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2020-11-07 05:11:39,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1112. [2020-11-07 05:11:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2020-11-07 05:11:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1383 transitions. [2020-11-07 05:11:39,745 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1383 transitions. Word has length 62 [2020-11-07 05:11:39,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:39,745 INFO L481 AbstractCegarLoop]: Abstraction has 1112 states and 1383 transitions. [2020-11-07 05:11:39,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1383 transitions. [2020-11-07 05:11:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 05:11:39,747 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:39,747 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-11-07 05:11:39,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:11:39,748 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:39,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2137320306, now seen corresponding path program 1 times [2020-11-07 05:11:39,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:39,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1643634910] [2020-11-07 05:11:39,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:39,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:39,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1643634910] [2020-11-07 05:11:39,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:39,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:39,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856112354] [2020-11-07 05:11:39,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:39,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:39,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:39,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:39,866 INFO L87 Difference]: Start difference. First operand 1112 states and 1383 transitions. Second operand 4 states. [2020-11-07 05:11:40,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:40,398 INFO L93 Difference]: Finished difference Result 3164 states and 3946 transitions. [2020-11-07 05:11:40,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:40,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-11-07 05:11:40,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:40,407 INFO L225 Difference]: With dead ends: 3164 [2020-11-07 05:11:40,407 INFO L226 Difference]: Without dead ends: 1625 [2020-11-07 05:11:40,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:40,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2020-11-07 05:11:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1624. [2020-11-07 05:11:40,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2020-11-07 05:11:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1943 transitions. [2020-11-07 05:11:40,678 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 1943 transitions. Word has length 63 [2020-11-07 05:11:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:40,678 INFO L481 AbstractCegarLoop]: Abstraction has 1624 states and 1943 transitions. [2020-11-07 05:11:40,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1943 transitions. [2020-11-07 05:11:40,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 05:11:40,680 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:40,681 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-11-07 05:11:40,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:11:40,681 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:40,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:40,682 INFO L82 PathProgramCache]: Analyzing trace with hash -912193112, now seen corresponding path program 1 times [2020-11-07 05:11:40,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:40,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1306149179] [2020-11-07 05:11:40,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:40,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:40,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1306149179] [2020-11-07 05:11:40,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:40,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:40,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811063736] [2020-11-07 05:11:40,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:40,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:40,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:40,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:40,748 INFO L87 Difference]: Start difference. First operand 1624 states and 1943 transitions. Second operand 4 states. [2020-11-07 05:11:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:41,246 INFO L93 Difference]: Finished difference Result 1836 states and 2170 transitions. [2020-11-07 05:11:41,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:41,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-11-07 05:11:41,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:41,253 INFO L225 Difference]: With dead ends: 1836 [2020-11-07 05:11:41,254 INFO L226 Difference]: Without dead ends: 1321 [2020-11-07 05:11:41,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2020-11-07 05:11:41,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1112. [2020-11-07 05:11:41,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2020-11-07 05:11:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1303 transitions. [2020-11-07 05:11:41,427 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1303 transitions. Word has length 63 [2020-11-07 05:11:41,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:41,428 INFO L481 AbstractCegarLoop]: Abstraction has 1112 states and 1303 transitions. [2020-11-07 05:11:41,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1303 transitions. [2020-11-07 05:11:41,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-07 05:11:41,430 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:41,431 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-11-07 05:11:41,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:11:41,431 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:41,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:41,432 INFO L82 PathProgramCache]: Analyzing trace with hash 382930092, now seen corresponding path program 1 times [2020-11-07 05:11:41,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:41,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [989070332] [2020-11-07 05:11:41,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:41,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:41,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:41,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [989070332] [2020-11-07 05:11:41,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:41,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:41,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29995712] [2020-11-07 05:11:41,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:41,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:41,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:41,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:41,527 INFO L87 Difference]: Start difference. First operand 1112 states and 1303 transitions. Second operand 4 states. [2020-11-07 05:11:41,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:41,832 INFO L93 Difference]: Finished difference Result 1112 states and 1303 transitions. [2020-11-07 05:11:41,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:41,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-11-07 05:11:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:41,833 INFO L225 Difference]: With dead ends: 1112 [2020-11-07 05:11:41,833 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 05:11:41,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 05:11:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 05:11:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 05:11:41,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 05:11:41,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2020-11-07 05:11:41,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:41,837 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 05:11:41,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 05:11:41,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 05:11:41,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:11:41,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 05:11:42,070 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-07 05:11:42,254 WARN L194 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 31 [2020-11-07 05:11:42,677 WARN L194 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 53 [2020-11-07 05:11:42,794 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 41 [2020-11-07 05:11:43,046 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-11-07 05:11:43,314 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-11-07 05:11:43,439 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-11-07 05:11:43,603 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-11-07 05:11:43,714 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 85 [2020-11-07 05:11:44,013 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-11-07 05:11:44,133 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 45 [2020-11-07 05:11:44,492 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-11-07 05:11:44,943 WARN L194 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-11-07 05:11:45,180 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 34 [2020-11-07 05:11:45,315 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 39 [2020-11-07 05:11:45,928 WARN L194 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 05:11:47,479 WARN L194 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-11-07 05:11:48,853 WARN L194 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 05:11:49,526 WARN L194 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-11-07 05:11:49,662 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-11-07 05:11:49,929 WARN L194 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 05:11:50,747 WARN L194 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-11-07 05:11:50,886 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-11-07 05:11:52,299 WARN L194 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 05:11:52,598 WARN L194 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-11-07 05:11:52,934 WARN L194 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 05:11:53,060 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-11-07 05:11:53,653 WARN L194 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 05:11:55,041 WARN L194 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 05:11:56,631 WARN L194 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-11-07 05:11:56,930 WARN L194 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-11-07 05:12:00,266 WARN L194 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-11-07 05:12:00,839 WARN L194 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 05:12:00,956 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-11-07 05:12:01,112 WARN L194 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-11-07 05:12:01,438 WARN L194 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 05:12:01,459 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 05:12:01,459 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 05:12:01,459 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 05:12:01,460 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 05:12:01,460 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 05:12:01,460 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 05:12:01,460 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:12:01,460 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 05:12:01,460 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 05:12:01,460 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 05:12:01,461 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 05:12:01,461 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 05:12:01,461 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 05:12:01,461 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:12:01,461 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:12:01,461 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:12:01,461 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 05:12:01,462 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 05:12:01,462 INFO L269 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-11-07 05:12:01,464 INFO L262 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-11-07 05:12:01,464 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 6 109) the Hoare annotation is: true [2020-11-07 05:12:01,465 INFO L262 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-11-07 05:12:01,465 INFO L262 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-11-07 05:12:01,466 INFO L269 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-11-07 05:12:01,466 INFO L269 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-11-07 05:12:01,466 INFO L269 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-11-07 05:12:01,466 INFO L269 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: true [2020-11-07 05:12:01,467 INFO L262 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-11-07 05:12:01,467 INFO L269 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-11-07 05:12:01,467 INFO L262 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-11-07 05:12:01,468 INFO L262 CegarLoopResult]: At program point L94-1(lines 29 104) the Hoare annotation is: (or (= main_~p6~0 0) (= main_~lk6~0 1)) [2020-11-07 05:12:01,468 INFO L262 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-11-07 05:12:01,468 INFO L262 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-11-07 05:12:01,468 INFO L269 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-11-07 05:12:01,468 INFO L269 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-11-07 05:12:01,469 INFO L269 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-11-07 05:12:01,469 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 05:12:01,469 INFO L262 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-11-07 05:12:01,469 INFO L269 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-11-07 05:12:01,469 INFO L262 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-11-07 05:12:01,470 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 6 109) the Hoare annotation is: true [2020-11-07 05:12:01,470 INFO L269 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-11-07 05:12:01,470 INFO L262 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-11-07 05:12:01,470 INFO L269 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-11-07 05:12:01,470 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 6 109) the Hoare annotation is: true [2020-11-07 05:12:01,470 INFO L269 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: true [2020-11-07 05:12:01,470 INFO L269 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: true [2020-11-07 05:12:01,471 INFO L262 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-11-07 05:12:01,471 INFO L269 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-11-07 05:12:01,471 INFO L269 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-11-07 05:12:01,471 INFO L269 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-11-07 05:12:01,471 INFO L269 CegarLoopResult]: At program point L105(lines 7 109) the Hoare annotation is: true [2020-11-07 05:12:01,471 INFO L269 CegarLoopResult]: At program point L31(lines 31 33) the Hoare annotation is: true [2020-11-07 05:12:01,472 INFO L262 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-11-07 05:12:01,472 INFO L262 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-11-07 05:12:01,472 INFO L269 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-11-07 05:12:01,473 INFO L262 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-11-07 05:12:01,473 INFO L269 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-11-07 05:12:01,473 INFO L269 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: true [2020-11-07 05:12:01,473 INFO L262 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-11-07 05:12:01,473 INFO L269 CegarLoopResult]: At program point L48(lines 48 50) the Hoare annotation is: true [2020-11-07 05:12:01,474 INFO L269 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-11-07 05:12:01,474 INFO L262 CegarLoopResult]: At program point L48-2(lines 29 104) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-11-07 05:12:01,474 INFO L269 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-11-07 05:12:01,474 INFO L262 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-11-07 05:12:01,474 INFO L262 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-11-07 05:12:01,475 INFO L262 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-11-07 05:12:01,475 INFO L269 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-11-07 05:12:01,475 INFO L269 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: true [2020-11-07 05:12:01,475 INFO L262 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: false [2020-11-07 05:12:01,476 INFO L262 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-11-07 05:12:01,476 INFO L269 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-11-07 05:12:01,477 INFO L269 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-11-07 05:12:01,477 INFO L269 CegarLoopResult]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2020-11-07 05:12:01,477 INFO L262 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-11-07 05:12:01,477 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 05:12:01,477 INFO L269 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-11-07 05:12:01,477 INFO L269 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-11-07 05:12:01,478 INFO L262 CegarLoopResult]: At program point L108(line 108) the Hoare annotation is: false [2020-11-07 05:12:01,478 INFO L262 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-11-07 05:12:01,478 INFO L269 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-11-07 05:12:01,478 INFO L269 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-11-07 05:12:01,479 INFO L262 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: (= main_~lk6~0 1) [2020-11-07 05:12:01,479 INFO L262 CegarLoopResult]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2020-11-07 05:12:01,479 INFO L269 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-11-07 05:12:01,479 INFO L262 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-11-07 05:12:01,479 INFO L269 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-11-07 05:12:01,480 INFO L262 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-11-07 05:12:01,480 INFO L262 CegarLoopResult]: At program point L101(line 101) the Hoare annotation is: (= main_~lk6~0 1) [2020-11-07 05:12:01,481 INFO L262 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-11-07 05:12:01,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:12:01 BoogieIcfgContainer [2020-11-07 05:12:01,502 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:12:01,506 INFO L168 Benchmark]: Toolchain (without parser) took 27832.45 ms. Allocated memory was 125.8 MB in the beginning and 509.6 MB in the end (delta: 383.8 MB). Free memory was 102.8 MB in the beginning and 230.1 MB in the end (delta: -127.3 MB). Peak memory consumption was 306.3 MB. Max. memory is 8.0 GB. [2020-11-07 05:12:01,510 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 125.8 MB. Free memory was 103.5 MB in the beginning and 103.4 MB in the end (delta: 68.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:12:01,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.59 ms. Allocated memory is still 125.8 MB. Free memory was 102.2 MB in the beginning and 92.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:12:01,518 INFO L168 Benchmark]: Boogie Preprocessor took 39.55 ms. Allocated memory is still 125.8 MB. Free memory was 92.5 MB in the beginning and 91.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:12:01,519 INFO L168 Benchmark]: RCFGBuilder took 671.73 ms. Allocated memory was 125.8 MB in the beginning and 159.4 MB in the end (delta: 33.6 MB). Free memory was 90.9 MB in the beginning and 137.6 MB in the end (delta: -46.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:12:01,522 INFO L168 Benchmark]: TraceAbstraction took 26780.17 ms. Allocated memory was 159.4 MB in the beginning and 509.6 MB in the end (delta: 350.2 MB). Free memory was 137.4 MB in the beginning and 230.1 MB in the end (delta: -92.7 MB). Peak memory consumption was 307.8 MB. Max. memory is 8.0 GB. [2020-11-07 05:12:01,532 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.19 ms. Allocated memory is still 125.8 MB. Free memory was 103.5 MB in the beginning and 103.4 MB in the end (delta: 68.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 324.59 ms. Allocated memory is still 125.8 MB. Free memory was 102.2 MB in the beginning and 92.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 39.55 ms. Allocated memory is still 125.8 MB. Free memory was 92.5 MB in the beginning and 91.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 671.73 ms. Allocated memory was 125.8 MB in the beginning and 159.4 MB in the end (delta: 33.6 MB). Free memory was 90.9 MB in the beginning and 137.6 MB in the end (delta: -46.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 26780.17 ms. Allocated memory was 159.4 MB in the beginning and 509.6 MB in the end (delta: 350.2 MB). Free memory was 137.4 MB in the beginning and 230.1 MB in the end (delta: -92.7 MB). Peak memory consumption was 307.8 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.0s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1456 SDtfs, 1641 SDslu, 202 SDs, 0 SdLazy, 1044 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s 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.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 526 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 90 LocationsWithAnnotation, 134 PreInvPairs, 2190 NumberOfFragments, 5886 HoareAnnotationTreeSize, 134 FomulaSimplifications, 372834 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 90 FomulaSimplificationsInter, 12518 FormulaSimplificationTreeSizeReductionInter, 16.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s 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...