/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:04:23,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:04:23,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:04:23,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:04:23,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:04:23,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:04:23,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:04:23,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:04:23,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:04:23,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:04:23,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:04:23,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:04:23,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:04:23,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:04:23,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:04:23,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:04:23,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:04:23,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:04:23,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:04:23,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:04:23,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:04:23,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:04:23,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:04:23,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:04:23,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:04:23,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:04:23,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:04:23,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:04:23,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:04:23,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:04:23,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:04:23,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:04:23,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:04:23,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:04:23,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:04:23,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:04:23,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:04:23,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:04:23,991 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:04:23,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:04:23,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:04:23,994 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:04:24,007 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:04:24,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:04:24,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:04:24,010 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:04:24,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:04:24,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:04:24,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:04:24,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:04:24,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:04:24,011 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:04:24,012 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:04:24,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:04:24,012 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:04:24,012 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:04:24,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:04:24,013 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:04:24,013 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:04:24,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:04:24,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:04:24,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:04:24,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:04:24,014 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:04:24,015 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 05:04:24,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:04:24,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:04:24,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:04:24,501 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:04:24,502 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:04:24,503 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-2.c [2020-11-07 05:04:24,584 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88fd4ebfe/f2985c4e9f9740958843e94a762dc7be/FLAG6bc9f60c4 [2020-11-07 05:04:25,158 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:04:25,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-2.c [2020-11-07 05:04:25,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88fd4ebfe/f2985c4e9f9740958843e94a762dc7be/FLAG6bc9f60c4 [2020-11-07 05:04:25,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88fd4ebfe/f2985c4e9f9740958843e94a762dc7be [2020-11-07 05:04:25,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:04:25,545 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:04:25,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:04:25,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:04:25,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:04:25,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:04:25" (1/1) ... [2020-11-07 05:04:25,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f33cd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:25, skipping insertion in model container [2020-11-07 05:04:25,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:04:25" (1/1) ... [2020-11-07 05:04:25,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:04:25,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:04:25,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:04:25,773 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:04:25,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:04:25,804 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:04:25,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:25 WrapperNode [2020-11-07 05:04:25,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:04:25,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:04:25,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:04:25,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:04:25,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:25" (1/1) ... [2020-11-07 05:04:25,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:25" (1/1) ... [2020-11-07 05:04:25,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:25" (1/1) ... [2020-11-07 05:04:25,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:25" (1/1) ... [2020-11-07 05:04:25,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:25" (1/1) ... [2020-11-07 05:04:25,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:25" (1/1) ... [2020-11-07 05:04:25,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:25" (1/1) ... [2020-11-07 05:04:25,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:04:25,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:04:25,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:04:25,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:04:25,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:04:25,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:04:25,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:04:25,945 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:04:25,945 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-11-07 05:04:25,946 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-11-07 05:04:25,946 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:04:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:04:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:04:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:04:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:04:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:04:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-11-07 05:04:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-11-07 05:04:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:04:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:04:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:04:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:04:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:04:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:04:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:04:26,307 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:04:26,307 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:04:26,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:04:26 BoogieIcfgContainer [2020-11-07 05:04:26,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:04:26,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:04:26,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:04:26,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:04:26,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:04:25" (1/3) ... [2020-11-07 05:04:26,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd63066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:04:26, skipping insertion in model container [2020-11-07 05:04:26,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:25" (2/3) ... [2020-11-07 05:04:26,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd63066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:04:26, skipping insertion in model container [2020-11-07 05:04:26,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:04:26" (3/3) ... [2020-11-07 05:04:26,319 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-2.c [2020-11-07 05:04:26,335 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:04:26,339 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:04:26,352 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:04:26,377 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:04:26,378 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:04:26,378 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:04:26,378 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:04:26,378 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:04:26,379 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:04:26,379 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:04:26,379 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:04:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-11-07 05:04:26,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:04:26,404 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:26,405 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 05:04:26,406 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:26,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:26,413 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-11-07 05:04:26,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:26,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [200604738] [2020-11-07 05:04:26,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:26,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:26,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:04:26,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [200604738] [2020-11-07 05:04:26,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:04:26,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:04:26,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760133451] [2020-11-07 05:04:26,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:04:26,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:26,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:04:26,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:04:26,968 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-11-07 05:04:27,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:27,469 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2020-11-07 05:04:27,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:04:27,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:04:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:27,483 INFO L225 Difference]: With dead ends: 74 [2020-11-07 05:04:27,483 INFO L226 Difference]: Without dead ends: 51 [2020-11-07 05:04:27,487 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 05:04:27,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-07 05:04:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-11-07 05:04:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 05:04:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 05:04:27,549 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-11-07 05:04:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:27,550 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 05:04:27,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:04:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 05:04:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 05:04:27,553 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:27,553 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] [2020-11-07 05:04:27,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:04:27,554 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:27,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:27,555 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-11-07 05:04:27,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:27,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [915591747] [2020-11-07 05:04:27,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:27,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:27,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:04:27,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [915591747] [2020-11-07 05:04:27,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:04:27,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:04:27,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701110290] [2020-11-07 05:04:27,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:04:27,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:27,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:04:27,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:04:27,683 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-11-07 05:04:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:28,035 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-11-07 05:04:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:04:28,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 05:04:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:28,038 INFO L225 Difference]: With dead ends: 60 [2020-11-07 05:04:28,039 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 05:04:28,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:04:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 05:04:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 05:04:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 05:04:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 05:04:28,060 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-11-07 05:04:28,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:28,061 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 05:04:28,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:04:28,061 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 05:04:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 05:04:28,064 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:28,064 INFO L422 BasicCegarLoop]: trace histogram [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 05:04:28,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:04:28,065 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:28,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:28,066 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-11-07 05:04:28,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:28,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1099857008] [2020-11-07 05:04:28,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 05:04:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:04:28,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1099857008] [2020-11-07 05:04:28,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:28,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:04:28,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704498291] [2020-11-07 05:04:28,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:04:28,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:28,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:04:28,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:04:28,253 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2020-11-07 05:04:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:28,572 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-11-07 05:04:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:04:28,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 05:04:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:28,575 INFO L225 Difference]: With dead ends: 92 [2020-11-07 05:04:28,575 INFO L226 Difference]: Without dead ends: 55 [2020-11-07 05:04:28,577 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:04:28,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-07 05:04:28,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-11-07 05:04:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-07 05:04:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-11-07 05:04:28,594 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-11-07 05:04:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:28,595 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-11-07 05:04:28,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:04:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-11-07 05:04:28,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 05:04:28,597 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:28,597 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 05:04:28,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:04:28,598 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:28,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:28,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-11-07 05:04:28,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:28,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [155547640] [2020-11-07 05:04:28,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:04:28,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [155547640] [2020-11-07 05:04:28,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:28,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:04:28,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54762787] [2020-11-07 05:04:28,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:04:28,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:28,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:04:28,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:04:28,817 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2020-11-07 05:04:29,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:29,376 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-11-07 05:04:29,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:04:29,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-11-07 05:04:29,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:29,380 INFO L225 Difference]: With dead ends: 84 [2020-11-07 05:04:29,380 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 05:04:29,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:04:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 05:04:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-11-07 05:04:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-07 05:04:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-11-07 05:04:29,406 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 43 [2020-11-07 05:04:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:29,406 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-11-07 05:04:29,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:04:29,407 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-11-07 05:04:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 05:04:29,410 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:29,410 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:04:29,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:04:29,410 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:29,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:29,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-11-07 05:04:29,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:29,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1032055710] [2020-11-07 05:04:29,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 05:04:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 05:04:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 05:04:29,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1032055710] [2020-11-07 05:04:29,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:29,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:04:29,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580055526] [2020-11-07 05:04:29,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:04:29,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:29,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:04:29,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:04:29,571 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 7 states. [2020-11-07 05:04:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:29,920 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2020-11-07 05:04:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:04:29,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-11-07 05:04:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:29,923 INFO L225 Difference]: With dead ends: 140 [2020-11-07 05:04:29,923 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 05:04:29,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:04:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 05:04:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 05:04:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 05:04:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2020-11-07 05:04:29,948 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 59 [2020-11-07 05:04:29,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:29,948 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2020-11-07 05:04:29,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:04:29,948 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2020-11-07 05:04:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 05:04:29,951 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:29,951 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:04:29,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:04:29,952 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:29,952 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-11-07 05:04:29,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:29,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2054197] [2020-11-07 05:04:29,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:30,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:30,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:30,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:30,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:30,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:30,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-07 05:04:30,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2054197] [2020-11-07 05:04:30,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:30,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:04:30,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400195110] [2020-11-07 05:04:30,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:04:30,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:30,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:04:30,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:04:30,114 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 8 states. [2020-11-07 05:04:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:30,658 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2020-11-07 05:04:30,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:04:30,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 05:04:30,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:30,664 INFO L225 Difference]: With dead ends: 152 [2020-11-07 05:04:30,664 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 05:04:30,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:04:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 05:04:30,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2020-11-07 05:04:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-07 05:04:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2020-11-07 05:04:30,695 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 60 [2020-11-07 05:04:30,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:30,696 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2020-11-07 05:04:30,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:04:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2020-11-07 05:04:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 05:04:30,698 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:30,698 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:04:30,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:04:30,699 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:30,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:30,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-11-07 05:04:30,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:30,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [678853091] [2020-11-07 05:04:30,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:30,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:30,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:30,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:30,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:30,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:30,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 05:04:30,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [678853091] [2020-11-07 05:04:30,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:30,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:04:30,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008652336] [2020-11-07 05:04:30,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:04:30,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:30,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:04:30,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:04:30,857 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 9 states. [2020-11-07 05:04:31,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:31,499 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2020-11-07 05:04:31,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:04:31,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-11-07 05:04:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:31,506 INFO L225 Difference]: With dead ends: 128 [2020-11-07 05:04:31,506 INFO L226 Difference]: Without dead ends: 121 [2020-11-07 05:04:31,508 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:04:31,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-07 05:04:31,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2020-11-07 05:04:31,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-07 05:04:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-11-07 05:04:31,557 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 61 [2020-11-07 05:04:31,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:31,558 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-11-07 05:04:31,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:04:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2020-11-07 05:04:31,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 05:04:31,562 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:31,562 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:04:31,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:04:31,563 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:31,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:31,563 INFO L82 PathProgramCache]: Analyzing trace with hash 942662771, now seen corresponding path program 1 times [2020-11-07 05:04:31,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:31,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1047791567] [2020-11-07 05:04:31,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 05:04:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 05:04:31,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1047791567] [2020-11-07 05:04:31,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:31,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:04:31,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878184368] [2020-11-07 05:04:31,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:04:31,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:31,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:04:31,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:04:31,853 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 9 states. [2020-11-07 05:04:32,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:32,406 INFO L93 Difference]: Finished difference Result 237 states and 358 transitions. [2020-11-07 05:04:32,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:04:32,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-11-07 05:04:32,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:32,410 INFO L225 Difference]: With dead ends: 237 [2020-11-07 05:04:32,410 INFO L226 Difference]: Without dead ends: 136 [2020-11-07 05:04:32,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:04:32,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-07 05:04:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-11-07 05:04:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 05:04:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2020-11-07 05:04:32,451 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 78 [2020-11-07 05:04:32,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:32,452 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2020-11-07 05:04:32,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:04:32,452 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2020-11-07 05:04:32,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 05:04:32,454 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:32,454 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:04:32,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:04:32,455 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:32,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:32,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1118264142, now seen corresponding path program 1 times [2020-11-07 05:04:32,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:32,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [148252891] [2020-11-07 05:04:32,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:32,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:32,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:32,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:32,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:32,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:32,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:32,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:32,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:04:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 05:04:32,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [148252891] [2020-11-07 05:04:32,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:32,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:04:32,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931054441] [2020-11-07 05:04:32,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:04:32,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:32,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:04:32,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:04:32,702 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand 11 states. [2020-11-07 05:04:33,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:33,473 INFO L93 Difference]: Finished difference Result 267 states and 410 transitions. [2020-11-07 05:04:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 05:04:33,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2020-11-07 05:04:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:33,482 INFO L225 Difference]: With dead ends: 267 [2020-11-07 05:04:33,482 INFO L226 Difference]: Without dead ends: 160 [2020-11-07 05:04:33,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:04:33,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-07 05:04:33,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-11-07 05:04:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-07 05:04:33,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-11-07 05:04:33,577 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 79 [2020-11-07 05:04:33,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:33,578 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-11-07 05:04:33,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:04:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-11-07 05:04:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-07 05:04:33,586 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:33,586 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-07 05:04:33,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:04:33,587 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:33,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:33,587 INFO L82 PathProgramCache]: Analyzing trace with hash -443839068, now seen corresponding path program 2 times [2020-11-07 05:04:33,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:33,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [444321663] [2020-11-07 05:04:33,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:33,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:33,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:33,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:33,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:33,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:33,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:33,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:33,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:04:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:33,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:33,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:33,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:33,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 59 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-11-07 05:04:33,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [444321663] [2020-11-07 05:04:33,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:33,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 05:04:33,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113126430] [2020-11-07 05:04:33,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:04:33,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:33,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:04:33,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:04:33,982 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 13 states. [2020-11-07 05:04:35,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:35,271 INFO L93 Difference]: Finished difference Result 275 states and 430 transitions. [2020-11-07 05:04:35,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 05:04:35,273 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 114 [2020-11-07 05:04:35,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:35,277 INFO L225 Difference]: With dead ends: 275 [2020-11-07 05:04:35,277 INFO L226 Difference]: Without dead ends: 125 [2020-11-07 05:04:35,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2020-11-07 05:04:35,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-11-07 05:04:35,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2020-11-07 05:04:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-07 05:04:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2020-11-07 05:04:35,322 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 114 [2020-11-07 05:04:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:35,324 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2020-11-07 05:04:35,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:04:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2020-11-07 05:04:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-07 05:04:35,326 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:35,326 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2020-11-07 05:04:35,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:04:35,327 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:35,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:35,327 INFO L82 PathProgramCache]: Analyzing trace with hash 693727952, now seen corresponding path program 1 times [2020-11-07 05:04:35,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:35,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [750929008] [2020-11-07 05:04:35,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:04:35,349 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:04:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:04:35,375 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:04:35,422 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:04:35,423 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:04:35,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:04:35,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:04:35 BoogieIcfgContainer [2020-11-07 05:04:35,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:04:35,512 INFO L168 Benchmark]: Toolchain (without parser) took 9969.71 ms. Allocated memory was 155.2 MB in the beginning and 269.5 MB in the end (delta: 114.3 MB). Free memory was 131.5 MB in the beginning and 222.3 MB in the end (delta: -90.9 MB). Peak memory consumption was 25.7 MB. Max. memory is 8.0 GB. [2020-11-07 05:04:35,512 INFO L168 Benchmark]: CDTParser took 1.19 ms. Allocated memory is still 155.2 MB. Free memory is still 128.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:04:35,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.50 ms. Allocated memory is still 155.2 MB. Free memory was 131.0 MB in the beginning and 121.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:04:35,514 INFO L168 Benchmark]: Boogie Preprocessor took 39.14 ms. Allocated memory is still 155.2 MB. Free memory was 121.5 MB in the beginning and 120.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:04:35,514 INFO L168 Benchmark]: RCFGBuilder took 462.58 ms. Allocated memory is still 155.2 MB. Free memory was 120.1 MB in the beginning and 137.4 MB in the end (delta: -17.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:04:35,515 INFO L168 Benchmark]: TraceAbstraction took 9197.84 ms. Allocated memory was 155.2 MB in the beginning and 269.5 MB in the end (delta: 114.3 MB). Free memory was 136.9 MB in the beginning and 222.3 MB in the end (delta: -85.5 MB). Peak memory consumption was 29.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:04:35,518 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.19 ms. Allocated memory is still 155.2 MB. Free memory is still 128.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 258.50 ms. Allocated memory is still 155.2 MB. Free memory was 131.0 MB in the beginning and 121.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 39.14 ms. Allocated memory is still 155.2 MB. Free memory was 121.5 MB in the beginning and 120.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 462.58 ms. Allocated memory is still 155.2 MB. Free memory was 120.1 MB in the beginning and 137.4 MB in the end (delta: -17.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9197.84 ms. Allocated memory was 155.2 MB in the beginning and 269.5 MB in the end (delta: 114.3 MB). Free memory was 136.9 MB in the beginning and 222.3 MB in the end (delta: -85.5 MB). Peak memory consumption was 29.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L38] int x = 4; VAL [x=4] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=3, \result=2, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=2, \result=1, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=4, \result=3, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=3, x=4] [L39] int result = fibo1(x); VAL [fibo1(x)=3, result=3, x=4] [L40] COND TRUE result == 3 VAL [result=3, x=4] [L41] CALL reach_error() [L4] __assert_fail("0", "fibo_2calls_4-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.0s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 506 SDtfs, 742 SDslu, 851 SDs, 0 SdLazy, 2349 SolverSat, 303 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 61 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 683 NumberOfCodeBlocks, 683 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 577 ConstructedInterpolants, 0 QuantifiedInterpolants, 86657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 207/306 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...