/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id2_b3_o5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:41:20,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:41:20,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:41:21,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:41:21,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:41:21,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:41:21,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:41:21,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:41:21,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:41:21,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:41:21,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:41:21,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:41:21,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:41:21,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:41:21,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:41:21,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:41:21,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:41:21,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:41:21,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:41:21,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:41:21,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:41:21,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:41:21,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:41:21,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:41:21,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:41:21,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:41:21,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:41:21,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:41:21,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:41:21,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:41:21,140 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:41:21,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:41:21,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:41:21,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:41:21,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:41:21,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:41:21,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:41:21,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:41:21,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:41:21,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:41:21,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:41:21,152 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 00:41:21,177 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:41:21,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:41:21,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:41:21,183 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:41:21,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:41:21,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:41:21,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:41:21,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:41:21,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:41:21,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:41:21,186 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:41:21,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:41:21,187 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:41:21,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:41:21,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:41:21,188 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:41:21,188 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:41:21,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:41:21,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:41:21,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:41:21,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:41:21,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:41:21,190 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 [2020-11-07 00:41:21,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:41:21,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:41:21,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:41:21,690 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:41:21,691 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:41:21,692 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_b3_o5.c [2020-11-07 00:41:21,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579131582/5b5168be00034300969f9fb6b9f2b301/FLAGd15431593 [2020-11-07 00:41:22,481 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:41:22,482 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_b3_o5.c [2020-11-07 00:41:22,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579131582/5b5168be00034300969f9fb6b9f2b301/FLAGd15431593 [2020-11-07 00:41:22,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579131582/5b5168be00034300969f9fb6b9f2b301 [2020-11-07 00:41:22,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:41:22,881 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:41:22,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:41:22,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:41:22,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:41:22,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:22" (1/1) ... [2020-11-07 00:41:22,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502fe97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:22, skipping insertion in model container [2020-11-07 00:41:22,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:22" (1/1) ... [2020-11-07 00:41:22,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:41:22,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:41:23,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:41:23,159 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:41:23,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:41:23,195 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:41:23,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:23 WrapperNode [2020-11-07 00:41:23,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:41:23,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:41:23,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:41:23,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:41:23,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:23" (1/1) ... [2020-11-07 00:41:23,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:23" (1/1) ... [2020-11-07 00:41:23,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:23" (1/1) ... [2020-11-07 00:41:23,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:23" (1/1) ... [2020-11-07 00:41:23,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:23" (1/1) ... [2020-11-07 00:41:23,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:23" (1/1) ... [2020-11-07 00:41:23,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:23" (1/1) ... [2020-11-07 00:41:23,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:41:23,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:41:23,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:41:23,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:41:23,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:23" (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 00:41:23,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:41:23,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:41:23,326 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:41:23,326 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 00:41:23,326 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-11-07 00:41:23,326 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:41:23,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-11-07 00:41:23,327 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:41:23,327 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:41:23,327 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:41:23,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:41:23,327 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 00:41:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-11-07 00:41:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:41:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:41:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:41:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:41:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:41:23,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:41:23,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:41:24,005 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:41:24,005 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:41:24,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:24 BoogieIcfgContainer [2020-11-07 00:41:24,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:41:24,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:41:24,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:41:24,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:41:24,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:41:22" (1/3) ... [2020-11-07 00:41:24,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b24038e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:24, skipping insertion in model container [2020-11-07 00:41:24,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:23" (2/3) ... [2020-11-07 00:41:24,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b24038e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:24, skipping insertion in model container [2020-11-07 00:41:24,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:24" (3/3) ... [2020-11-07 00:41:24,019 INFO L111 eAbstractionObserver]: Analyzing ICFG id2_b3_o5.c [2020-11-07 00:41:24,040 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:41:24,044 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:41:24,059 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:41:24,090 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:41:24,090 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:41:24,091 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:41:24,091 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:41:24,091 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:41:24,091 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:41:24,091 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:41:24,091 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:41:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-11-07 00:41:24,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:41:24,119 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:24,120 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] [2020-11-07 00:41:24,121 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:24,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:24,128 INFO L82 PathProgramCache]: Analyzing trace with hash 138014369, now seen corresponding path program 1 times [2020-11-07 00:41:24,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:24,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [831264077] [2020-11-07 00:41:24,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:24,234 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,531 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 00:41:24,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [831264077] [2020-11-07 00:41:24,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:24,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:41:24,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539228409] [2020-11-07 00:41:24,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:41:24,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:24,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:41:24,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:41:24,561 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 6 states. [2020-11-07 00:41:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:25,028 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2020-11-07 00:41:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:41:25,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:41:25,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:25,041 INFO L225 Difference]: With dead ends: 64 [2020-11-07 00:41:25,041 INFO L226 Difference]: Without dead ends: 45 [2020-11-07 00:41:25,046 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-11-07 00:41:25,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-11-07 00:41:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-07 00:41:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-11-07 00:41:25,110 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 25 [2020-11-07 00:41:25,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:25,110 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-11-07 00:41:25,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:41:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-11-07 00:41:25,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-07 00:41:25,116 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:25,117 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] [2020-11-07 00:41:25,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:41:25,118 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:25,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:25,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1111577060, now seen corresponding path program 1 times [2020-11-07 00:41:25,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:25,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [848657480] [2020-11-07 00:41:25,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:25,138 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:25,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:25,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:25,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:25,370 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 00:41:25,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [848657480] [2020-11-07 00:41:25,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:25,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:41:25,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22886457] [2020-11-07 00:41:25,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:41:25,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:25,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:41:25,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:41:25,375 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2020-11-07 00:41:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:25,758 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2020-11-07 00:41:25,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:41:25,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-11-07 00:41:25,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:25,762 INFO L225 Difference]: With dead ends: 73 [2020-11-07 00:41:25,762 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 00:41:25,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:25,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 00:41:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2020-11-07 00:41:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-07 00:41:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-11-07 00:41:25,785 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 34 [2020-11-07 00:41:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:25,786 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-11-07 00:41:25,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:41:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-11-07 00:41:25,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-07 00:41:25,788 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:25,788 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] [2020-11-07 00:41:25,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:41:25,789 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:25,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:25,790 INFO L82 PathProgramCache]: Analyzing trace with hash 982288804, now seen corresponding path program 1 times [2020-11-07 00:41:25,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:25,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1791849594] [2020-11-07 00:41:25,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:25,793 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:25,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:25,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:25,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,030 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 00:41:26,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1791849594] [2020-11-07 00:41:26,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:26,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:41:26,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276048925] [2020-11-07 00:41:26,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:41:26,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:26,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:41:26,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:41:26,035 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2020-11-07 00:41:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:26,588 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2020-11-07 00:41:26,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:41:26,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2020-11-07 00:41:26,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:26,590 INFO L225 Difference]: With dead ends: 59 [2020-11-07 00:41:26,591 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 00:41:26,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:41:26,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 00:41:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 00:41:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:41:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-11-07 00:41:26,609 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 34 [2020-11-07 00:41:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:26,609 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-11-07 00:41:26,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:41:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-11-07 00:41:26,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:41:26,611 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:26,611 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:41:26,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:41:26,612 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:26,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:26,613 INFO L82 PathProgramCache]: Analyzing trace with hash 935446002, now seen corresponding path program 1 times [2020-11-07 00:41:26,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:26,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [122597487] [2020-11-07 00:41:26,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:26,616 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:41:26,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [122597487] [2020-11-07 00:41:26,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:26,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:41:26,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980959396] [2020-11-07 00:41:26,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:41:26,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:26,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:41:26,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:41:26,865 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2020-11-07 00:41:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:27,213 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2020-11-07 00:41:27,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:41:27,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-11-07 00:41:27,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:27,216 INFO L225 Difference]: With dead ends: 79 [2020-11-07 00:41:27,216 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 00:41:27,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:27,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 00:41:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2020-11-07 00:41:27,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-07 00:41:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-11-07 00:41:27,236 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 43 [2020-11-07 00:41:27,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:27,237 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-11-07 00:41:27,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:41:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-11-07 00:41:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:41:27,239 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:27,240 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:41:27,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:41:27,240 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:27,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:27,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1355534926, now seen corresponding path program 1 times [2020-11-07 00:41:27,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:27,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1531436092] [2020-11-07 00:41:27,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:27,247 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:41:27,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1531436092] [2020-11-07 00:41:27,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:27,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:41:27,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123871310] [2020-11-07 00:41:27,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:41:27,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:27,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:41:27,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:41:27,482 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2020-11-07 00:41:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:28,119 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2020-11-07 00:41:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:41:28,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2020-11-07 00:41:28,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:28,121 INFO L225 Difference]: With dead ends: 85 [2020-11-07 00:41:28,121 INFO L226 Difference]: Without dead ends: 65 [2020-11-07 00:41:28,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:41:28,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-07 00:41:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2020-11-07 00:41:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-07 00:41:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2020-11-07 00:41:28,142 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 43 [2020-11-07 00:41:28,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:28,143 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2020-11-07 00:41:28,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:41:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2020-11-07 00:41:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:41:28,144 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:28,144 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:41:28,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:41:28,145 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:28,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:28,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1484823182, now seen corresponding path program 1 times [2020-11-07 00:41:28,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:28,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [535104480] [2020-11-07 00:41:28,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:28,148 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:41:28,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [535104480] [2020-11-07 00:41:28,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:28,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:41:28,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894674604] [2020-11-07 00:41:28,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:41:28,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:28,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:41:28,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:41:28,488 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 12 states. [2020-11-07 00:41:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:29,523 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2020-11-07 00:41:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:41:29,526 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2020-11-07 00:41:29,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:29,527 INFO L225 Difference]: With dead ends: 71 [2020-11-07 00:41:29,527 INFO L226 Difference]: Without dead ends: 65 [2020-11-07 00:41:29,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:41:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-07 00:41:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2020-11-07 00:41:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-07 00:41:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2020-11-07 00:41:29,571 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 43 [2020-11-07 00:41:29,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:29,571 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2020-11-07 00:41:29,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:41:29,571 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-11-07 00:41:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 00:41:29,575 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:29,576 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:41:29,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:41:29,577 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:29,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:29,579 INFO L82 PathProgramCache]: Analyzing trace with hash 463887169, now seen corresponding path program 1 times [2020-11-07 00:41:29,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:29,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1212064530] [2020-11-07 00:41:29,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:29,582 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:29,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:29,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:29,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:29,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:29,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 00:41:29,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1212064530] [2020-11-07 00:41:29,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:29,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:41:29,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100576386] [2020-11-07 00:41:29,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:41:29,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:29,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:41:29,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:41:29,815 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 9 states. [2020-11-07 00:41:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:30,520 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2020-11-07 00:41:30,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:41:30,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2020-11-07 00:41:30,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:30,524 INFO L225 Difference]: With dead ends: 91 [2020-11-07 00:41:30,524 INFO L226 Difference]: Without dead ends: 71 [2020-11-07 00:41:30,525 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:41:30,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-11-07 00:41:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2020-11-07 00:41:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-07 00:41:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2020-11-07 00:41:30,546 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 52 [2020-11-07 00:41:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:30,547 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2020-11-07 00:41:30,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:41:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-11-07 00:41:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 00:41:30,548 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:30,548 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:41:30,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:41:30,549 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:30,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:30,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1827093759, now seen corresponding path program 1 times [2020-11-07 00:41:30,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:30,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [721812990] [2020-11-07 00:41:30,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:30,553 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:30,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:30,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:30,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:30,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:30,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 00:41:30,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [721812990] [2020-11-07 00:41:30,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:30,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:41:30,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586648281] [2020-11-07 00:41:30,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:41:30,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:30,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:41:30,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:41:30,826 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 12 states. [2020-11-07 00:41:31,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:31,859 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2020-11-07 00:41:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:41:31,862 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2020-11-07 00:41:31,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:31,865 INFO L225 Difference]: With dead ends: 97 [2020-11-07 00:41:31,865 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 00:41:31,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:41:31,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 00:41:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2020-11-07 00:41:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-07 00:41:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2020-11-07 00:41:31,891 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 52 [2020-11-07 00:41:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:31,892 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2020-11-07 00:41:31,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:41:31,892 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2020-11-07 00:41:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 00:41:31,893 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:31,894 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 00:41:31,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:41:31,894 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:31,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:31,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1956382015, now seen corresponding path program 1 times [2020-11-07 00:41:31,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:31,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [772143969] [2020-11-07 00:41:31,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:31,898 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 00:41:32,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [772143969] [2020-11-07 00:41:32,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:32,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:41:32,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265398720] [2020-11-07 00:41:32,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:41:32,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:32,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:41:32,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:41:32,331 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 15 states. [2020-11-07 00:41:33,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:33,793 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2020-11-07 00:41:33,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 00:41:33,794 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2020-11-07 00:41:33,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:33,795 INFO L225 Difference]: With dead ends: 85 [2020-11-07 00:41:33,796 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 00:41:33,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2020-11-07 00:41:33,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 00:41:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2020-11-07 00:41:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-07 00:41:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2020-11-07 00:41:33,819 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 52 [2020-11-07 00:41:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:33,819 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2020-11-07 00:41:33,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:41:33,820 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2020-11-07 00:41:33,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:41:33,821 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:33,821 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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 00:41:33,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:41:33,821 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:33,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:33,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1484609405, now seen corresponding path program 1 times [2020-11-07 00:41:33,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:33,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [247638144] [2020-11-07 00:41:33,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:33,825 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:33,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:33,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:33,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:33,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:34,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:34,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 00:41:34,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [247638144] [2020-11-07 00:41:34,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:34,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:41:34,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915986255] [2020-11-07 00:41:34,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:41:34,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:34,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:41:34,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:41:34,158 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 12 states. [2020-11-07 00:41:35,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:35,206 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2020-11-07 00:41:35,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:41:35,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-11-07 00:41:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:35,208 INFO L225 Difference]: With dead ends: 105 [2020-11-07 00:41:35,209 INFO L226 Difference]: Without dead ends: 83 [2020-11-07 00:41:35,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:41:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-11-07 00:41:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2020-11-07 00:41:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-07 00:41:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2020-11-07 00:41:35,235 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 61 [2020-11-07 00:41:35,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:35,235 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2020-11-07 00:41:35,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:41:35,236 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2020-11-07 00:41:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:41:35,237 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:35,237 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 00:41:35,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:41:35,238 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:35,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:35,238 INFO L82 PathProgramCache]: Analyzing trace with hash 519376963, now seen corresponding path program 2 times [2020-11-07 00:41:35,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:35,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1431427001] [2020-11-07 00:41:35,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:35,241 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:35,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:35,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:35,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:35,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:35,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:35,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 00:41:35,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1431427001] [2020-11-07 00:41:35,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:35,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:41:35,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757682967] [2020-11-07 00:41:35,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:41:35,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:35,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:41:35,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:41:35,675 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 15 states. [2020-11-07 00:41:37,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:37,068 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2020-11-07 00:41:37,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 00:41:37,069 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2020-11-07 00:41:37,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:37,071 INFO L225 Difference]: With dead ends: 113 [2020-11-07 00:41:37,071 INFO L226 Difference]: Without dead ends: 91 [2020-11-07 00:41:37,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2020-11-07 00:41:37,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-07 00:41:37,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2020-11-07 00:41:37,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-07 00:41:37,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2020-11-07 00:41:37,096 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 61 [2020-11-07 00:41:37,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:37,096 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2020-11-07 00:41:37,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:41:37,096 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2020-11-07 00:41:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-07 00:41:37,098 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:37,098 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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 00:41:37,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:41:37,098 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:37,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:37,099 INFO L82 PathProgramCache]: Analyzing trace with hash -123538722, now seen corresponding path program 2 times [2020-11-07 00:41:37,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:37,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1025437646] [2020-11-07 00:41:37,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:37,102 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 00:41:37,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1025437646] [2020-11-07 00:41:37,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:37,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:41:37,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917915645] [2020-11-07 00:41:37,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:41:37,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:37,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:41:37,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:41:37,513 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 15 states. [2020-11-07 00:41:38,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:38,885 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2020-11-07 00:41:38,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 00:41:38,886 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2020-11-07 00:41:38,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:38,887 INFO L225 Difference]: With dead ends: 102 [2020-11-07 00:41:38,888 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:41:38,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2020-11-07 00:41:38,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:41:38,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:41:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:41:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:41:38,891 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2020-11-07 00:41:38,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:38,891 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:41:38,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:41:38,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:41:38,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:41:38,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:41:38,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:41:39,882 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 14 [2020-11-07 00:41:40,020 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2020-11-07 00:41:40,364 WARN L194 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 23 [2020-11-07 00:41:40,593 WARN L194 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 22 [2020-11-07 00:41:40,894 WARN L194 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 31 [2020-11-07 00:41:41,045 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2020-11-07 00:41:41,166 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 18 [2020-11-07 00:41:41,390 WARN L194 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 30 [2020-11-07 00:41:41,658 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2020-11-07 00:41:41,893 WARN L194 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 23 [2020-11-07 00:41:42,018 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 22 [2020-11-07 00:41:42,024 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 00:41:42,024 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 00:41:42,025 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:41:42,025 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 00:41:42,025 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 00:41:42,025 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 00:41:42,025 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:42,025 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:42,025 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:41:42,026 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 00:41:42,026 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 00:41:42,026 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 00:41:42,026 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 00:41:42,026 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:41:42,026 INFO L262 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-11-07 00:41:42,027 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= 4 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-11-07 00:41:42,027 INFO L262 CegarLoopResult]: At program point id2FINAL(lines 16 21) the Hoare annotation is: (or (and (<= 1 id2_~ret~1) (<= |id2_#res| 1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= |id2_#res| 0) (<= 0 |id2_#res|)) (and (<= 2 |id2_#res|) (<= id2_~ret~1 2) (<= |id2_#res| 2) (<= 2 id2_~ret~1)) (and (<= |id2_#res| 3) (<= 3 |id2_#res|))) [2020-11-07 00:41:42,027 INFO L269 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-11-07 00:41:42,027 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and (<= 4 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0)) [2020-11-07 00:41:42,027 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 00:41:42,028 INFO L262 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (or (and (<= 0 |id2_#t~ret8|) (<= |id2_#t~ret8| 0)) (and (<= 2 |id2_#t~ret8|) (<= |id2_#t~ret8| 2)) (and (<= 3 |id2_#t~ret8|) (<= |id2_#t~ret8| 3)) (and (<= |id2_#t~ret8| 1) (<= 1 |id2_#t~ret8|))) [2020-11-07 00:41:42,028 INFO L269 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-11-07 00:41:42,028 INFO L262 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (or (and (<= 0 |id2_#t~ret8|) (<= 1 id2_~ret~1) (<= |id2_#t~ret8| 0) (<= id2_~ret~1 1)) (and (<= id2_~ret~1 2) (<= |id2_#t~ret8| 1) (<= 1 |id2_#t~ret8|) (<= 2 id2_~ret~1)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3) (<= |id2_#t~ret8| 2) (<= 2 |id2_#t~ret8|)) (and (<= 3 |id2_#t~ret8|) (<= 4 id2_~ret~1) (<= |id2_#t~ret8| 3) (<= (div id2_~ret~1 4294967296) 0))) [2020-11-07 00:41:42,028 INFO L262 CegarLoopResult]: At program point id2EXIT(lines 16 21) the Hoare annotation is: (or (and (<= 1 id2_~ret~1) (<= |id2_#res| 1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= |id2_#res| 0) (<= 0 |id2_#res|)) (and (<= 2 |id2_#res|) (<= id2_~ret~1 2) (<= |id2_#res| 2) (<= 2 id2_~ret~1)) (and (<= |id2_#res| 3) (<= 3 |id2_#res|))) [2020-11-07 00:41:42,028 INFO L269 CegarLoopResult]: At program point id2ENTRY(lines 16 21) the Hoare annotation is: true [2020-11-07 00:41:42,028 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:41:42,028 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:42,029 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:41:42,029 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:41:42,029 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 23 29) the Hoare annotation is: true [2020-11-07 00:41:42,029 INFO L262 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: false [2020-11-07 00:41:42,029 INFO L262 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: (and (<= main_~result~0 3) (< 0 (+ (div main_~result~0 4294967296) 1))) [2020-11-07 00:41:42,029 INFO L262 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: false [2020-11-07 00:41:42,029 INFO L269 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-11-07 00:41:42,029 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 23 29) the Hoare annotation is: true [2020-11-07 00:41:42,030 INFO L269 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-11-07 00:41:42,030 INFO L262 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (or (and (<= |main_#t~ret10| 3) (<= 3 |main_#t~ret10|)) (and (<= |main_#t~ret10| 2) (<= 2 |main_#t~ret10|)) (= |main_#t~ret10| 0) (and (<= |main_#t~ret10| 1) (<= 1 |main_#t~ret10|))) [2020-11-07 00:41:42,030 INFO L269 CegarLoopResult]: At program point L26-2(lines 23 29) the Hoare annotation is: true [2020-11-07 00:41:42,030 INFO L262 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div main_~result~0 4294967296) 1)))) (or (and (<= main_~result~0 3) (<= |main_#t~ret10| 3) .cse0 (<= 3 |main_#t~ret10|)) (and (<= |main_#t~ret10| 1) (<= 1 |main_#t~ret10|) (<= main_~result~0 1) .cse0) (and (= main_~result~0 0) (= |main_#t~ret10| 0)) (and (<= main_~result~0 2) (<= |main_#t~ret10| 2) (<= 2 |main_#t~ret10|) .cse0))) [2020-11-07 00:41:42,030 INFO L262 CegarLoopResult]: At program point idFINAL(lines 9 14) the Hoare annotation is: (or (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= id_~ret~0 2) (<= 2 |id_#res|) (<= |id_#res| 2) (<= 2 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= |id_#res| 3) (<= 3 |id_#res|))) [2020-11-07 00:41:42,031 INFO L262 CegarLoopResult]: At program point idEXIT(lines 9 14) the Hoare annotation is: (or (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= id_~ret~0 2) (<= 2 |id_#res|) (<= |id_#res| 2) (<= 2 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= |id_#res| 3) (<= 3 |id_#res|))) [2020-11-07 00:41:42,031 INFO L269 CegarLoopResult]: At program point idENTRY(lines 9 14) the Hoare annotation is: true [2020-11-07 00:41:42,031 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (or (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= 3 id_~ret~0) (<= id_~ret~0 3)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-11-07 00:41:42,031 INFO L262 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: (or (and (<= 4 id_~ret~0) (<= (div id_~ret~0 4294967296) 0)) (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= 3 id_~ret~0) (<= id_~ret~0 3)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-11-07 00:41:42,031 INFO L269 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-11-07 00:41:42,031 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 00:41:42,031 INFO L269 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-11-07 00:41:42,032 INFO L262 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (or (and (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|)) (and (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|)) (and (<= 0 |id_#t~ret7|) (<= |id_#t~ret7| 0)) (and (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3))) [2020-11-07 00:41:42,032 INFO L269 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: true [2020-11-07 00:41:42,032 INFO L262 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (or (and (<= 4 id_~ret~0) (<= 3 |id_#t~ret7|) (<= (div id_~ret~0 4294967296) 0) (<= |id_#t~ret7| 3)) (and (<= 3 id_~ret~0) (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= id_~ret~0 3)) (and (<= id_~ret~0 2) (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 id_~ret~0)) (and (<= 0 |id_#t~ret7|) (<= id_~ret~0 1) (<= |id_#t~ret7| 0) (<= 1 id_~ret~0))) [2020-11-07 00:41:42,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:41:42 BoogieIcfgContainer [2020-11-07 00:41:42,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:41:42,056 INFO L168 Benchmark]: Toolchain (without parser) took 19181.85 ms. Allocated memory was 152.0 MB in the beginning and 316.7 MB in the end (delta: 164.6 MB). Free memory was 129.1 MB in the beginning and 139.7 MB in the end (delta: -10.6 MB). Peak memory consumption was 184.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:42,057 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 152.0 MB. Free memory is still 126.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:41:42,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.20 ms. Allocated memory is still 152.0 MB. Free memory was 128.4 MB in the beginning and 119.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:42,058 INFO L168 Benchmark]: Boogie Preprocessor took 33.73 ms. Allocated memory is still 152.0 MB. Free memory was 119.0 MB in the beginning and 117.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:42,059 INFO L168 Benchmark]: RCFGBuilder took 776.70 ms. Allocated memory is still 152.0 MB. Free memory was 117.7 MB in the beginning and 134.7 MB in the end (delta: -17.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:42,060 INFO L168 Benchmark]: TraceAbstraction took 18043.93 ms. Allocated memory was 152.0 MB in the beginning and 316.7 MB in the end (delta: 164.6 MB). Free memory was 134.2 MB in the beginning and 139.7 MB in the end (delta: -5.5 MB). Peak memory consumption was 188.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:42,063 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 152.0 MB. Free memory is still 126.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 308.20 ms. Allocated memory is still 152.0 MB. Free memory was 128.4 MB in the beginning and 119.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 33.73 ms. Allocated memory is still 152.0 MB. Free memory was 119.0 MB in the beginning and 117.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 776.70 ms. Allocated memory is still 152.0 MB. Free memory was 117.7 MB in the beginning and 134.7 MB in the end (delta: -17.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 18043.93 ms. Allocated memory was 152.0 MB in the beginning and 316.7 MB in the end (delta: 164.6 MB). Free memory was 134.2 MB in the beginning and 139.7 MB in the end (delta: -5.5 MB). Peak memory consumption was 188.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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 - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for id2 Derived contract for procedure id2: (((((1 <= ret && \result <= 1) && ret <= 1) && 1 <= \result) || (\result <= 0 && 0 <= \result)) || (((2 <= \result && ret <= 2) && \result <= 2) && 2 <= ret)) || (\result <= 3 && 3 <= \result) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for id Derived contract for procedure id: (((((\result <= 1 && ret <= 1) && 1 <= \result) && 1 <= ret) || (((ret <= 2 && 2 <= \result) && \result <= 2) && 2 <= ret)) || (0 <= \result && \result <= 0)) || (\result <= 3 && 3 <= \result) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.8s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 528 SDtfs, 504 SDslu, 1471 SDs, 0 SdLazy, 3843 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 49 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 50 LocationsWithAnnotation, 105 PreInvPairs, 247 NumberOfFragments, 606 HoareAnnotationTreeSize, 105 FomulaSimplifications, 68689 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 50 FomulaSimplificationsInter, 5206 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...