/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-with-pointer/simple-recursive.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:20:05,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:20:05,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:20:05,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:20:05,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:20:05,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:20:05,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:20:05,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:20:05,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:20:05,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:20:05,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:20:05,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:20:05,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:20:05,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:20:05,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:20:05,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:20:05,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:20:05,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:20:05,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:20:05,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:20:05,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:20:05,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:20:05,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:20:06,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:20:06,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:20:06,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:20:06,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:20:06,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:20:06,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:20:06,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:20:06,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:20:06,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:20:06,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:20:06,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:20:06,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:20:06,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:20:06,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:20:06,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:20:06,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:20:06,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:20:06,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:20:06,037 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-21 10:20:06,084 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:20:06,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:20:06,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:20:06,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:20:06,088 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:20:06,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:20:06,088 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:20:06,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:20:06,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:20:06,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:20:06,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:20:06,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:20:06,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:20:06,091 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:20:06,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:20:06,091 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:20:06,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:20:06,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:20:06,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:20:06,092 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:20:06,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:20:06,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:20:06,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:20:06,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:20:06,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:20:06,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:20:06,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:20:06,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:20:06,094 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:20:06,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES 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: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-21 10:20:06,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:20:06,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:20:06,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:20:06,574 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:20:06,575 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:20:06,576 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-with-pointer/simple-recursive.c [2020-09-21 10:20:06,674 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d47722855/3b59750825a34e7cbf5776fc62308a4e/FLAG6033cb8a8 [2020-09-21 10:20:07,229 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:20:07,230 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-with-pointer/simple-recursive.c [2020-09-21 10:20:07,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d47722855/3b59750825a34e7cbf5776fc62308a4e/FLAG6033cb8a8 [2020-09-21 10:20:07,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d47722855/3b59750825a34e7cbf5776fc62308a4e [2020-09-21 10:20:07,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:20:07,591 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:20:07,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:20:07,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:20:07,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:20:07,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:20:07" (1/1) ... [2020-09-21 10:20:07,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257a0311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:07, skipping insertion in model container [2020-09-21 10:20:07,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:20:07" (1/1) ... [2020-09-21 10:20:07,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:20:07,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:20:07,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:20:07,873 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:20:07,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:20:07,913 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:20:07,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:07 WrapperNode [2020-09-21 10:20:07,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:20:07,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:20:07,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:20:07,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:20:08,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:07" (1/1) ... [2020-09-21 10:20:08,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:07" (1/1) ... [2020-09-21 10:20:08,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:07" (1/1) ... [2020-09-21 10:20:08,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:07" (1/1) ... [2020-09-21 10:20:08,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:07" (1/1) ... [2020-09-21 10:20:08,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:07" (1/1) ... [2020-09-21 10:20:08,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:07" (1/1) ... [2020-09-21 10:20:08,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:20:08,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:20:08,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:20:08,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:20:08,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:07" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-21 10:20:08,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:20:08,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:20:08,122 INFO L138 BoogieDeclarations]: Found implementation of procedure plus [2020-09-21 10:20:08,123 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2020-09-21 10:20:08,123 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:20:08,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:20:08,123 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2020-09-21 10:20:08,124 INFO L130 BoogieDeclarations]: Found specification of procedure plus [2020-09-21 10:20:08,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-21 10:20:08,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-21 10:20:08,124 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:20:08,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-21 10:20:08,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-09-21 10:20:08,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-21 10:20:08,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:20:08,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:20:08,388 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:20:08,392 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-21 10:20:08,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:20:08 BoogieIcfgContainer [2020-09-21 10:20:08,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:20:08,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:20:08,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:20:08,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:20:08,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:20:07" (1/3) ... [2020-09-21 10:20:08,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60490495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:20:08, skipping insertion in model container [2020-09-21 10:20:08,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:07" (2/3) ... [2020-09-21 10:20:08,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60490495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:20:08, skipping insertion in model container [2020-09-21 10:20:08,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:20:08" (3/3) ... [2020-09-21 10:20:08,426 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-recursive.c [2020-09-21 10:20:08,452 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:20:08,462 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:20:08,499 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:20:08,525 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:20:08,525 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:20:08,525 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:20:08,525 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:20:08,525 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:20:08,525 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:20:08,526 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:20:08,526 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:20:08,546 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-09-21 10:20:08,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-09-21 10:20:08,553 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:08,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:08,554 INFO L427 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:08,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:08,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1703201428, now seen corresponding path program 1 times [2020-09-21 10:20:08,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:08,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [774300352] [2020-09-21 10:20:08,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:08,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [774300352] [2020-09-21 10:20:08,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:08,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-21 10:20:08,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77416741] [2020-09-21 10:20:08,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:20:08,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:08,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:20:08,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:20:08,888 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 6 states. [2020-09-21 10:20:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:09,148 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-09-21 10:20:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-21 10:20:09,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-09-21 10:20:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:09,164 INFO L225 Difference]: With dead ends: 39 [2020-09-21 10:20:09,165 INFO L226 Difference]: Without dead ends: 18 [2020-09-21 10:20:09,170 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:20:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-09-21 10:20:09,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-09-21 10:20:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-09-21 10:20:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-09-21 10:20:09,226 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2020-09-21 10:20:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:09,227 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-09-21 10:20:09,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:20:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-09-21 10:20:09,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-21 10:20:09,229 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:09,229 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:09,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:20:09,230 INFO L427 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:09,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:09,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1207469216, now seen corresponding path program 1 times [2020-09-21 10:20:09,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:09,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [318535358] [2020-09-21 10:20:09,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:09,465 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [318535358] [2020-09-21 10:20:09,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:09,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:20:09,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440809693] [2020-09-21 10:20:09,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:20:09,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:09,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:20:09,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:20:09,471 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2020-09-21 10:20:09,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:09,809 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-09-21 10:20:09,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 10:20:09,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-09-21 10:20:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:09,811 INFO L225 Difference]: With dead ends: 26 [2020-09-21 10:20:09,811 INFO L226 Difference]: Without dead ends: 23 [2020-09-21 10:20:09,813 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2020-09-21 10:20:09,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-21 10:20:09,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-09-21 10:20:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-09-21 10:20:09,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2020-09-21 10:20:09,821 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2020-09-21 10:20:09,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:09,822 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2020-09-21 10:20:09,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:20:09,822 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-09-21 10:20:09,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-21 10:20:09,823 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:09,823 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:09,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:20:09,824 INFO L427 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:09,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:09,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1866674708, now seen corresponding path program 2 times [2020-09-21 10:20:09,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:09,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [711713266] [2020-09-21 10:20:09,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:10,025 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [711713266] [2020-09-21 10:20:10,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:10,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-21 10:20:10,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298277749] [2020-09-21 10:20:10,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-21 10:20:10,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:10,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-21 10:20:10,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:20:10,028 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 14 states. [2020-09-21 10:20:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:10,443 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-09-21 10:20:10,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-21 10:20:10,443 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2020-09-21 10:20:10,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:10,445 INFO L225 Difference]: With dead ends: 31 [2020-09-21 10:20:10,445 INFO L226 Difference]: Without dead ends: 28 [2020-09-21 10:20:10,446 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2020-09-21 10:20:10,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-21 10:20:10,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-09-21 10:20:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-09-21 10:20:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-09-21 10:20:10,467 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2020-09-21 10:20:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:10,467 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-09-21 10:20:10,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-21 10:20:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-09-21 10:20:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-21 10:20:10,471 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:10,471 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:10,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:20:10,471 INFO L427 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:10,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1116654880, now seen corresponding path program 3 times [2020-09-21 10:20:10,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:10,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1932779068] [2020-09-21 10:20:10,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:10,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1932779068] [2020-09-21 10:20:10,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:10,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-21 10:20:10,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803747713] [2020-09-21 10:20:10,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-21 10:20:10,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:10,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-21 10:20:10,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2020-09-21 10:20:10,847 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 18 states. [2020-09-21 10:20:11,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:11,534 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2020-09-21 10:20:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-21 10:20:11,534 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2020-09-21 10:20:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:11,535 INFO L225 Difference]: With dead ends: 36 [2020-09-21 10:20:11,536 INFO L226 Difference]: Without dead ends: 33 [2020-09-21 10:20:11,537 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=982, Unknown=0, NotChecked=0, Total=1190 [2020-09-21 10:20:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-21 10:20:11,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-09-21 10:20:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-09-21 10:20:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2020-09-21 10:20:11,545 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2020-09-21 10:20:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:11,546 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2020-09-21 10:20:11,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-21 10:20:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2020-09-21 10:20:11,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-21 10:20:11,547 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:11,547 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:11,548 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:20:11,548 INFO L427 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:11,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1506163092, now seen corresponding path program 4 times [2020-09-21 10:20:11,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:11,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1587529556] [2020-09-21 10:20:11,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,958 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:11,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1587529556] [2020-09-21 10:20:11,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:11,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-21 10:20:11,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382013977] [2020-09-21 10:20:11,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-21 10:20:11,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:11,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-21 10:20:11,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2020-09-21 10:20:11,961 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 22 states. [2020-09-21 10:20:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:12,707 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-09-21 10:20:12,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-21 10:20:12,708 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2020-09-21 10:20:12,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:12,710 INFO L225 Difference]: With dead ends: 41 [2020-09-21 10:20:12,710 INFO L226 Difference]: Without dead ends: 38 [2020-09-21 10:20:12,713 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=313, Invalid=1579, Unknown=0, NotChecked=0, Total=1892 [2020-09-21 10:20:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-21 10:20:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-09-21 10:20:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-09-21 10:20:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2020-09-21 10:20:12,728 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2020-09-21 10:20:12,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:12,729 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2020-09-21 10:20:12,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-21 10:20:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2020-09-21 10:20:12,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-21 10:20:12,732 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:12,732 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:12,733 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:20:12,733 INFO L427 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:12,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:12,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1044673952, now seen corresponding path program 5 times [2020-09-21 10:20:12,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:12,735 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [369741771] [2020-09-21 10:20:12,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:13,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:13,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [369741771] [2020-09-21 10:20:13,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:13,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-09-21 10:20:13,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506685169] [2020-09-21 10:20:13,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-21 10:20:13,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:13,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-21 10:20:13,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2020-09-21 10:20:13,316 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 26 states. [2020-09-21 10:20:14,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:14,405 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-09-21 10:20:14,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-09-21 10:20:14,406 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2020-09-21 10:20:14,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:14,407 INFO L225 Difference]: With dead ends: 46 [2020-09-21 10:20:14,407 INFO L226 Difference]: Without dead ends: 43 [2020-09-21 10:20:14,409 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=439, Invalid=2317, Unknown=0, NotChecked=0, Total=2756 [2020-09-21 10:20:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-21 10:20:14,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-09-21 10:20:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-21 10:20:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2020-09-21 10:20:14,438 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2020-09-21 10:20:14,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:14,440 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2020-09-21 10:20:14,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-21 10:20:14,441 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-09-21 10:20:14,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-21 10:20:14,442 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:14,445 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:14,446 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:20:14,446 INFO L427 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:14,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:14,447 INFO L82 PathProgramCache]: Analyzing trace with hash -272244460, now seen corresponding path program 6 times [2020-09-21 10:20:14,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:14,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [172026430] [2020-09-21 10:20:14,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:15,074 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [172026430] [2020-09-21 10:20:15,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:15,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2020-09-21 10:20:15,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497488574] [2020-09-21 10:20:15,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-09-21 10:20:15,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:15,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-09-21 10:20:15,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2020-09-21 10:20:15,076 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 30 states. [2020-09-21 10:20:16,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:16,500 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-09-21 10:20:16,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-09-21 10:20:16,504 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2020-09-21 10:20:16,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:16,505 INFO L225 Difference]: With dead ends: 51 [2020-09-21 10:20:16,506 INFO L226 Difference]: Without dead ends: 48 [2020-09-21 10:20:16,507 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=586, Invalid=3196, Unknown=0, NotChecked=0, Total=3782 [2020-09-21 10:20:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-21 10:20:16,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-09-21 10:20:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-21 10:20:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2020-09-21 10:20:16,516 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2020-09-21 10:20:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:16,517 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2020-09-21 10:20:16,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-09-21 10:20:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2020-09-21 10:20:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-09-21 10:20:16,518 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:16,519 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:16,519 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:20:16,519 INFO L427 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:16,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:16,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1667333664, now seen corresponding path program 7 times [2020-09-21 10:20:16,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:16,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1157549409] [2020-09-21 10:20:16,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:17,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1157549409] [2020-09-21 10:20:17,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:17,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2020-09-21 10:20:17,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781320648] [2020-09-21 10:20:17,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-09-21 10:20:17,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:17,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-09-21 10:20:17,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2020-09-21 10:20:17,151 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 34 states. [2020-09-21 10:20:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:18,886 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2020-09-21 10:20:18,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-09-21 10:20:18,888 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 46 [2020-09-21 10:20:18,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:18,890 INFO L225 Difference]: With dead ends: 56 [2020-09-21 10:20:18,890 INFO L226 Difference]: Without dead ends: 53 [2020-09-21 10:20:18,891 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=754, Invalid=4216, Unknown=0, NotChecked=0, Total=4970 [2020-09-21 10:20:18,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-21 10:20:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2020-09-21 10:20:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-09-21 10:20:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2020-09-21 10:20:18,901 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2020-09-21 10:20:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:18,901 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2020-09-21 10:20:18,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-09-21 10:20:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2020-09-21 10:20:18,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-21 10:20:18,903 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:18,903 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:18,903 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:20:18,903 INFO L427 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:18,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:18,904 INFO L82 PathProgramCache]: Analyzing trace with hash -168154988, now seen corresponding path program 8 times [2020-09-21 10:20:18,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:18,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1183856337] [2020-09-21 10:20:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:19,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:19,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1183856337] [2020-09-21 10:20:19,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:19,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2020-09-21 10:20:19,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93634239] [2020-09-21 10:20:19,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-09-21 10:20:19,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:19,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-09-21 10:20:19,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1213, Unknown=0, NotChecked=0, Total=1406 [2020-09-21 10:20:19,744 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 38 states. [2020-09-21 10:20:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:21,697 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2020-09-21 10:20:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-09-21 10:20:21,698 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 51 [2020-09-21 10:20:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:21,699 INFO L225 Difference]: With dead ends: 61 [2020-09-21 10:20:21,699 INFO L226 Difference]: Without dead ends: 58 [2020-09-21 10:20:21,702 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=943, Invalid=5377, Unknown=0, NotChecked=0, Total=6320 [2020-09-21 10:20:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-21 10:20:21,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2020-09-21 10:20:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-09-21 10:20:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2020-09-21 10:20:21,710 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2020-09-21 10:20:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:21,711 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2020-09-21 10:20:21,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-09-21 10:20:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2020-09-21 10:20:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-21 10:20:21,712 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:21,713 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:21,713 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:20:21,713 INFO L427 AbstractCegarLoop]: === Iteration 10 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:21,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:21,713 INFO L82 PathProgramCache]: Analyzing trace with hash 539879072, now seen corresponding path program 9 times [2020-09-21 10:20:21,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:21,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1988590456] [2020-09-21 10:20:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:22,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1988590456] [2020-09-21 10:20:22,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:22,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2020-09-21 10:20:22,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210785792] [2020-09-21 10:20:22,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2020-09-21 10:20:22,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:22,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-09-21 10:20:22,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1488, Unknown=0, NotChecked=0, Total=1722 [2020-09-21 10:20:22,832 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 42 states. [2020-09-21 10:20:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:25,399 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2020-09-21 10:20:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-09-21 10:20:25,401 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 56 [2020-09-21 10:20:25,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:25,405 INFO L225 Difference]: With dead ends: 66 [2020-09-21 10:20:25,405 INFO L226 Difference]: Without dead ends: 63 [2020-09-21 10:20:25,409 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1626 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1153, Invalid=6679, Unknown=0, NotChecked=0, Total=7832 [2020-09-21 10:20:25,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-21 10:20:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2020-09-21 10:20:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-09-21 10:20:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2020-09-21 10:20:25,430 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2020-09-21 10:20:25,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:25,432 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2020-09-21 10:20:25,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 42 states. [2020-09-21 10:20:25,432 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2020-09-21 10:20:25,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-21 10:20:25,434 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:25,434 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:25,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:20:25,434 INFO L427 AbstractCegarLoop]: === Iteration 11 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:25,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:25,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1424289772, now seen corresponding path program 10 times [2020-09-21 10:20:25,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:25,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1195137044] [2020-09-21 10:20:25,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 206 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:26,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1195137044] [2020-09-21 10:20:26,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:26,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2020-09-21 10:20:26,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524627913] [2020-09-21 10:20:26,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2020-09-21 10:20:26,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:26,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2020-09-21 10:20:26,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1985, Unknown=0, NotChecked=0, Total=2256 [2020-09-21 10:20:26,908 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 48 states. [2020-09-21 10:20:28,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:28,505 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2020-09-21 10:20:28,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-09-21 10:20:28,506 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 61 [2020-09-21 10:20:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:28,507 INFO L225 Difference]: With dead ends: 68 [2020-09-21 10:20:28,507 INFO L226 Difference]: Without dead ends: 0 [2020-09-21 10:20:28,511 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2471 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1076, Invalid=7296, Unknown=0, NotChecked=0, Total=8372 [2020-09-21 10:20:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-21 10:20:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-21 10:20:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-21 10:20:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-21 10:20:28,513 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2020-09-21 10:20:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:28,513 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-21 10:20:28,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 48 states. [2020-09-21 10:20:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-21 10:20:28,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-21 10:20:28,514 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:20:28,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-21 10:20:29,140 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 117 [2020-09-21 10:20:29,506 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 121 [2020-09-21 10:20:29,891 WARN L193 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2020-09-21 10:20:30,172 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2020-09-21 10:20:30,176 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-09-21 10:20:30,176 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-09-21 10:20:30,177 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-21 10:20:30,177 INFO L268 CegarLoopResult]: For program point fooEXIT(lines 9 18) no Hoare annotation was computed. [2020-09-21 10:20:30,177 INFO L264 CegarLoopResult]: At program point fooENTRY(lines 9 18) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|)) (.cse0 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (or (not (= .cse0 20)) (= 20 .cse1)) (or (and (<= .cse1 18) (<= 18 .cse1)) (not (<= 18 .cse0)) (not (<= .cse0 18))) (or (not (<= 14 .cse0)) (and (<= .cse1 14) (<= 14 .cse1)) (not (<= .cse0 14))) (or (not (<= .cse0 15)) (not (<= 15 .cse0)) (and (<= 15 .cse1) (<= .cse1 15))) (or (and (<= .cse1 17) (<= 17 .cse1)) (not (<= 17 .cse0)) (not (<= .cse0 17))) (or (not (<= 16 .cse0)) (and (<= 16 .cse1) (<= .cse1 16)) (not (<= .cse0 16))) (or (not (= .cse0 10)) (= 10 .cse1)) (or (not (<= .cse0 13)) (and (<= .cse1 13) (<= 13 .cse1)) (not (<= 13 .cse0))) (or (not (<= .cse0 11)) (and (<= .cse1 11) (<= 11 .cse1)) (not (<= 11 .cse0))) (or (not (<= 12 .cse0)) (and (<= .cse1 12) (<= 12 .cse1)) (not (<= .cse0 12))) (or (not (<= 19 .cse0)) (and (<= 19 .cse1) (<= .cse1 19)) (not (<= .cse0 19))))) [2020-09-21 10:20:30,178 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-09-21 10:20:30,178 INFO L268 CegarLoopResult]: For program point fooErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2020-09-21 10:20:30,178 INFO L268 CegarLoopResult]: For program point L12(lines 12 17) no Hoare annotation was computed. [2020-09-21 10:20:30,179 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|)) (.cse2 (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (.cse0 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (or (not (<= 18 .cse0)) (and (<= .cse1 18) (<= .cse2 18) (<= 18 .cse1) (<= 18 .cse2)) (not (<= .cse0 18))) (or (and (<= .cse2 12) (<= .cse1 12) (<= 12 .cse1) (<= 12 .cse2)) (not (<= 12 .cse0)) (not (<= .cse0 12))) (or (not (<= 14 .cse0)) (not (<= .cse0 14)) (and (<= .cse1 14) (<= .cse2 14) (<= 14 .cse1) (<= 14 .cse2))) (or (not (<= .cse0 11)) (not (<= 11 .cse0)) (and (<= .cse1 11) (<= 11 .cse1) (<= .cse2 11) (<= 11 .cse2))) (or (not (<= 17 .cse0)) (not (<= .cse0 17)) (and (<= .cse2 17) (<= .cse1 17) (<= 17 .cse1) (<= 17 .cse2))) (or (not (<= 19 .cse0)) (and (<= 19 .cse1) (<= 19 .cse2) (<= .cse2 19)) (not (<= .cse0 19))) (not (= .cse0 20)) (or (not (<= .cse0 15)) (and (<= 15 .cse1) (<= .cse1 15) (<= 15 .cse2) (<= .cse2 15)) (not (<= 15 .cse0))) (or (not (<= .cse0 13)) (and (<= .cse1 13) (<= .cse2 13) (<= 13 .cse2) (<= 13 .cse1)) (not (<= 13 .cse0))) (or (not (= .cse0 10)) (and (= .cse2 10) (= 10 .cse1))) (or (not (<= 16 .cse0)) (and (<= 16 .cse2) (<= 16 .cse1) (<= .cse1 16) (<= .cse2 16)) (not (<= .cse0 16))))) [2020-09-21 10:20:30,179 INFO L268 CegarLoopResult]: For program point L10(lines 10 17) no Hoare annotation was computed. [2020-09-21 10:20:30,179 INFO L268 CegarLoopResult]: For program point L10-1(lines 9 18) no Hoare annotation was computed. [2020-09-21 10:20:30,179 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-21 10:20:30,180 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-21 10:20:30,180 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-21 10:20:30,180 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-21 10:20:30,180 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 20 26) the Hoare annotation is: (= |old(#valid)| |#valid|) [2020-09-21 10:20:30,180 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 20 26) no Hoare annotation was computed. [2020-09-21 10:20:30,183 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10) [2020-09-21 10:20:30,184 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 20 26) no Hoare annotation was computed. [2020-09-21 10:20:30,184 INFO L268 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2020-09-21 10:20:30,184 INFO L268 CegarLoopResult]: For program point plusFINAL(lines 4 7) no Hoare annotation was computed. [2020-09-21 10:20:30,184 INFO L264 CegarLoopResult]: At program point plusENTRY(lines 4 7) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|)) (.cse1 (select (select |old(#memory_int)| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (or (and (<= 16 .cse0) (<= .cse0 16)) (not (<= 16 .cse1)) (not (<= .cse1 16))) (or (and (<= 12 .cse0) (<= .cse0 12)) (not (<= 12 .cse1)) (not (<= .cse1 12))) (or (not (<= 11 .cse1)) (not (<= .cse1 11)) (and (<= 11 .cse0) (<= .cse0 11))) (or (= .cse0 10) (not (= .cse1 10))) (or (not (<= .cse1 17)) (and (<= .cse0 17) (<= 17 .cse0)) (not (<= 17 .cse1))) (or (not (<= .cse1 14)) (and (<= .cse0 14) (<= 14 .cse0)) (not (<= 14 .cse1))) (or (not (<= .cse1 15)) (not (<= 15 .cse1)) (and (<= 15 .cse0) (<= .cse0 15))) (or (not (<= .cse1 13)) (and (<= 13 .cse0) (<= .cse0 13)) (not (<= 13 .cse1))) (or (not (<= 19 .cse1)) (and (<= .cse0 19) (<= 19 .cse0)) (not (<= .cse1 19))) (or (and (<= 18 .cse0) (<= .cse0 18)) (not (<= 18 .cse1)) (not (<= .cse1 18))))) [2020-09-21 10:20:30,185 INFO L268 CegarLoopResult]: For program point plusEXIT(lines 4 7) no Hoare annotation was computed. [2020-09-21 10:20:30,185 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))) (let ((.cse3 (<= 18 .cse2)) (.cse1 (select (select |#memory_int| plus_~p.base) plus_~p.offset)) (.cse0 (select (select |old(#memory_int)| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (or (not (<= 12 .cse0)) (not (<= .cse0 12)) (and (<= .cse1 13) (<= 13 .cse2) (<= .cse2 13) (<= 13 .cse1))) (or (and (<= 11 .cse2) (<= .cse2 11) (<= .cse1 11) (<= 11 .cse1)) (not (= .cse0 10))) (or (and (<= 16 .cse1) (<= 16 .cse2) (<= .cse2 16) (<= .cse1 16)) (not (<= .cse0 15)) (not (<= 15 .cse0))) (or (not (<= 16 .cse0)) (and (<= 17 .cse1) (<= .cse2 17) (<= 17 .cse2) (<= .cse1 17)) (not (<= .cse0 16))) (or (and (<= .cse2 14) (<= 14 .cse1) (<= 14 .cse2) (<= .cse1 14)) (not (<= .cse0 13)) (not (<= 13 .cse0))) (or (not (<= .cse0 17)) (and (<= .cse1 18) .cse3 (<= .cse2 18) (<= 18 .cse1)) (not (<= 17 .cse0))) (or (and .cse3 (<= 19 .cse1) (<= .cse1 19)) (not (<= 18 .cse0)) (not (<= .cse0 18))) (or (not (<= .cse0 14)) (and (<= 15 .cse2) (<= .cse1 15) (<= .cse2 15) (<= 15 .cse1)) (not (<= 14 .cse0))) (or (not (<= 11 .cse0)) (not (<= .cse0 11)) (and (<= .cse1 12) (<= 12 .cse2) (<= 12 .cse1) (<= .cse2 12))) (or (not (<= 19 .cse0)) (and .cse3 (= .cse1 20)) (not (<= .cse0 19)))))) [2020-09-21 10:20:30,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:20:30 BoogieIcfgContainer [2020-09-21 10:20:30,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:20:30,195 INFO L168 Benchmark]: Toolchain (without parser) took 22608.84 ms. Allocated memory was 137.9 MB in the beginning and 390.1 MB in the end (delta: 252.2 MB). Free memory was 100.8 MB in the beginning and 313.7 MB in the end (delta: -212.9 MB). Peak memory consumption was 252.6 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:30,196 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 10:20:30,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.62 ms. Allocated memory is still 137.9 MB. Free memory was 100.1 MB in the beginning and 90.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:30,197 INFO L168 Benchmark]: Boogie Preprocessor took 125.04 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 90.6 MB in the beginning and 179.7 MB in the end (delta: -89.1 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:30,198 INFO L168 Benchmark]: RCFGBuilder took 364.76 ms. Allocated memory is still 201.9 MB. Free memory was 179.7 MB in the beginning and 165.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:30,199 INFO L168 Benchmark]: TraceAbstraction took 21784.00 ms. Allocated memory was 201.9 MB in the beginning and 390.1 MB in the end (delta: 188.2 MB). Free memory was 164.5 MB in the beginning and 313.7 MB in the end (delta: -149.2 MB). Peak memory consumption was 252.4 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:30,203 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 322.62 ms. Allocated memory is still 137.9 MB. Free memory was 100.1 MB in the beginning and 90.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.04 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 90.6 MB in the beginning and 179.7 MB in the end (delta: -89.1 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 364.76 ms. Allocated memory is still 201.9 MB. Free memory was 179.7 MB in the beginning and 165.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21784.00 ms. Allocated memory was 201.9 MB in the beginning and 390.1 MB in the end (delta: 188.2 MB). Free memory was 164.5 MB in the beginning and 313.7 MB in the end (delta: -149.2 MB). Peak memory consumption was 252.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 19.9s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 143 SDtfs, 209 SDslu, 838 SDs, 0 SdLazy, 2680 SolverSat, 387 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 555 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8249 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 51 PreInvPairs, 51 NumberOfFragments, 1520 HoareAnnotationTreeSize, 51 FomulaSimplifications, 57008 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 379 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 385 ConstructedInterpolants, 0 QuantifiedInterpolants, 101130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 206/935 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...