/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:43:49,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:43:49,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:43:49,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:43:49,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:43:49,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:43:49,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:43:49,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:43:49,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:43:49,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:43:49,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:43:49,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:43:49,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:43:49,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:43:49,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:43:49,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:43:49,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:43:49,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:43:49,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:43:49,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:43:49,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:43:49,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:43:49,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:43:49,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:43:49,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:43:49,169 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:43:49,169 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:43:49,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:43:49,171 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:43:49,172 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:43:49,172 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:43:49,173 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:43:49,174 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:43:49,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:43:49,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:43:49,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:43:49,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:43:49,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:43:49,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:43:49,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:43:49,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:43:49,182 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:43:49,211 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:43:49,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:43:49,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:43:49,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:43:49,213 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:43:49,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:43:49,214 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:43:49,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:43:49,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:43:49,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:43:49,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:43:49,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:43:49,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:43:49,216 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:43:49,216 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:43:49,216 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:43:49,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:43:49,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:43:49,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:43:49,217 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:43:49,217 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:43:49,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:43:49,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:43:49,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:43:49,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:43:49,218 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:43:49,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:43:49,219 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:43:49,219 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:43:49,219 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:43:49,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:43:49,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:43:49,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:43:49,660 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:43:49,661 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:43:49,662 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2020-11-06 22:43:49,746 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ea49c27/c826d1d73a09486bb2684c1196b9c56b/FLAG8462b1c39 [2020-11-06 22:43:50,260 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:43:50,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2020-11-06 22:43:50,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ea49c27/c826d1d73a09486bb2684c1196b9c56b/FLAG8462b1c39 [2020-11-06 22:43:50,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ea49c27/c826d1d73a09486bb2684c1196b9c56b [2020-11-06 22:43:50,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:43:50,645 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:43:50,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:43:50,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:43:50,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:43:50,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:43:50" (1/1) ... [2020-11-06 22:43:50,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c44d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:50, skipping insertion in model container [2020-11-06 22:43:50,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:43:50" (1/1) ... [2020-11-06 22:43:50,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:43:50,702 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:43:50,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:43:50,970 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:43:51,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:43:51,019 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:43:51,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:51 WrapperNode [2020-11-06 22:43:51,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:43:51,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:43:51,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:43:51,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:43:51,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:51" (1/1) ... [2020-11-06 22:43:51,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:51" (1/1) ... [2020-11-06 22:43:51,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:51" (1/1) ... [2020-11-06 22:43:51,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:51" (1/1) ... [2020-11-06 22:43:51,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:51" (1/1) ... [2020-11-06 22:43:51,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:51" (1/1) ... [2020-11-06 22:43:51,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:51" (1/1) ... [2020-11-06 22:43:51,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:43:51,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:43:51,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:43:51,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:43:51,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:51" (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-06 22:43:51,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:43:51,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:43:51,170 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:43:51,170 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-06 22:43:51,171 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-11-06 22:43:51,171 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:43:51,171 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-06 22:43:51,171 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:43:51,171 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:43:51,171 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-06 22:43:51,172 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-06 22:43:51,172 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:43:51,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:43:51,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-06 22:43:51,172 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-11-06 22:43:51,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-06 22:43:51,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-06 22:43:51,173 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:43:51,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-06 22:43:51,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:43:51,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:43:51,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:43:51,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:43:51,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:43:51,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:43:51,513 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:43:51,513 INFO L298 CfgBuilder]: Removed 3 assume(true) statements. [2020-11-06 22:43:51,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:43:51 BoogieIcfgContainer [2020-11-06 22:43:51,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:43:51,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:43:51,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:43:51,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:43:51,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:43:50" (1/3) ... [2020-11-06 22:43:51,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3995b245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:43:51, skipping insertion in model container [2020-11-06 22:43:51,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:51" (2/3) ... [2020-11-06 22:43:51,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3995b245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:43:51, skipping insertion in model container [2020-11-06 22:43:51,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:43:51" (3/3) ... [2020-11-06 22:43:51,524 INFO L111 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2020-11-06 22:43:51,548 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:43:51,551 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:43:51,564 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:43:51,592 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:43:51,592 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:43:51,593 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:43:51,593 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:43:51,593 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:43:51,593 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:43:51,593 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:43:51,593 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:43:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-11-06 22:43:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-06 22:43:51,618 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:51,619 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] [2020-11-06 22:43:51,619 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:51,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:51,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1917384497, now seen corresponding path program 1 times [2020-11-06 22:43:51,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:51,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120833946] [2020-11-06 22:43:51,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:51,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:52,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:52,050 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-06 22:43:52,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120833946] [2020-11-06 22:43:52,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:43:52,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:43:52,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611472654] [2020-11-06 22:43:52,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:43:52,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:52,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:43:52,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:43:52,084 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2020-11-06 22:43:52,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:52,263 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2020-11-06 22:43:52,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:43:52,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-11-06 22:43:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:52,275 INFO L225 Difference]: With dead ends: 66 [2020-11-06 22:43:52,276 INFO L226 Difference]: Without dead ends: 33 [2020-11-06 22:43:52,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:43:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-11-06 22:43:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2020-11-06 22:43:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-11-06 22:43:52,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-11-06 22:43:52,363 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2020-11-06 22:43:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:52,363 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-11-06 22:43:52,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:43:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-11-06 22:43:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-06 22:43:52,365 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:52,365 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] [2020-11-06 22:43:52,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:43:52,366 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:52,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1115967253, now seen corresponding path program 1 times [2020-11-06 22:43:52,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:52,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214764599] [2020-11-06 22:43:52,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:52,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:52,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:52,496 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-06 22:43:52,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214764599] [2020-11-06 22:43:52,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:43:52,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-06 22:43:52,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702695301] [2020-11-06 22:43:52,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-06 22:43:52,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:52,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-06 22:43:52,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:43:52,501 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2020-11-06 22:43:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:52,723 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2020-11-06 22:43:52,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:43:52,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-11-06 22:43:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:52,727 INFO L225 Difference]: With dead ends: 55 [2020-11-06 22:43:52,727 INFO L226 Difference]: Without dead ends: 41 [2020-11-06 22:43:52,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:43:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-11-06 22:43:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2020-11-06 22:43:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-06 22:43:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-11-06 22:43:52,753 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2020-11-06 22:43:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:52,753 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-11-06 22:43:52,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-06 22:43:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-11-06 22:43:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-06 22:43:52,757 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:52,758 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-06 22:43:52,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:43:52,759 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:52,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:52,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1542699897, now seen corresponding path program 1 times [2020-11-06 22:43:52,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:52,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511491674] [2020-11-06 22:43:52,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:52,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:52,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:43:52,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511491674] [2020-11-06 22:43:52,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774119960] [2020-11-06 22:43:52,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:52,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-06 22:43:52,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:43:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:43:53,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:43:53,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2020-11-06 22:43:53,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458211137] [2020-11-06 22:43:53,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:43:53,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:53,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:43:53,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:43:53,034 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2020-11-06 22:43:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:53,049 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2020-11-06 22:43:53,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:43:53,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-11-06 22:43:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:53,051 INFO L225 Difference]: With dead ends: 51 [2020-11-06 22:43:53,051 INFO L226 Difference]: Without dead ends: 31 [2020-11-06 22:43:53,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:43:53,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-11-06 22:43:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-11-06 22:43:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-06 22:43:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-11-06 22:43:53,058 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 25 [2020-11-06 22:43:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:53,058 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-11-06 22:43:53,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:43:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-11-06 22:43:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-06 22:43:53,059 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:53,059 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-06 22:43:53,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-11-06 22:43:53,274 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:53,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:53,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1800865335, now seen corresponding path program 1 times [2020-11-06 22:43:53,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:53,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007257898] [2020-11-06 22:43:53,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:53,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:53,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:43:53,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007257898] [2020-11-06 22:43:53,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907986808] [2020-11-06 22:43:53,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:53,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-06 22:43:53,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:43:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:43:53,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:43:53,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2020-11-06 22:43:53,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325333461] [2020-11-06 22:43:53,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:43:53,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:53,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:43:53,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:43:53,512 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2020-11-06 22:43:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:53,548 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2020-11-06 22:43:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:43:53,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-11-06 22:43:53,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:53,550 INFO L225 Difference]: With dead ends: 54 [2020-11-06 22:43:53,550 INFO L226 Difference]: Without dead ends: 33 [2020-11-06 22:43:53,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:43:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-11-06 22:43:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-11-06 22:43:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-06 22:43:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-11-06 22:43:53,559 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2020-11-06 22:43:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:53,559 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-11-06 22:43:53,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:43:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-11-06 22:43:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-06 22:43:53,560 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:53,561 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:43:53,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:53,776 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:53,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:53,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1385738581, now seen corresponding path program 1 times [2020-11-06 22:43:53,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:53,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283083509] [2020-11-06 22:43:53,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:53,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:53,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:53,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:43:53,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283083509] [2020-11-06 22:43:53,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846101914] [2020-11-06 22:43:53,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:53,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-06 22:43:53,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:43:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:43:54,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:43:54,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2020-11-06 22:43:54,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296232522] [2020-11-06 22:43:54,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:43:54,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:54,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:43:54,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:43:54,007 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 9 states. [2020-11-06 22:43:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:54,263 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2020-11-06 22:43:54,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:43:54,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-11-06 22:43:54,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:54,264 INFO L225 Difference]: With dead ends: 71 [2020-11-06 22:43:54,265 INFO L226 Difference]: Without dead ends: 50 [2020-11-06 22:43:54,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:43:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-06 22:43:54,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2020-11-06 22:43:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-06 22:43:54,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2020-11-06 22:43:54,274 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 27 [2020-11-06 22:43:54,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:54,274 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2020-11-06 22:43:54,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:43:54,274 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-11-06 22:43:54,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-06 22:43:54,275 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:54,276 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-06 22:43:54,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:54,479 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:54,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:54,480 INFO L82 PathProgramCache]: Analyzing trace with hash 414127001, now seen corresponding path program 2 times [2020-11-06 22:43:54,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:54,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475422181] [2020-11-06 22:43:54,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:54,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:54,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:43:54,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475422181] [2020-11-06 22:43:54,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578790017] [2020-11-06 22:43:54,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:54,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-06 22:43:54,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:43:54,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-06 22:43:54,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:43:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:43:54,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:43:54,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2020-11-06 22:43:54,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519455741] [2020-11-06 22:43:54,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:43:54,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:54,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:43:54,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:43:54,699 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 8 states. [2020-11-06 22:43:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:54,891 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2020-11-06 22:43:54,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:43:54,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-11-06 22:43:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:54,893 INFO L225 Difference]: With dead ends: 71 [2020-11-06 22:43:54,893 INFO L226 Difference]: Without dead ends: 57 [2020-11-06 22:43:54,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:43:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-06 22:43:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2020-11-06 22:43:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-06 22:43:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-11-06 22:43:54,902 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 32 [2020-11-06 22:43:54,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:54,902 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-11-06 22:43:54,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:43:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-11-06 22:43:54,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-06 22:43:54,903 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:54,903 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:43:55,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:55,118 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1178714931, now seen corresponding path program 3 times [2020-11-06 22:43:55,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:55,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82855649] [2020-11-06 22:43:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:55,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:55,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:43:55,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82855649] [2020-11-06 22:43:55,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300163227] [2020-11-06 22:43:55,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:55,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-06 22:43:55,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:43:55,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-06 22:43:55,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:43:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-06 22:43:55,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:43:55,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2020-11-06 22:43:55,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283407847] [2020-11-06 22:43:55,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:43:55,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:55,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:43:55,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:43:55,400 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 12 states. [2020-11-06 22:43:55,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:55,841 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2020-11-06 22:43:55,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:43:55,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2020-11-06 22:43:55,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:55,843 INFO L225 Difference]: With dead ends: 95 [2020-11-06 22:43:55,843 INFO L226 Difference]: Without dead ends: 68 [2020-11-06 22:43:55,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-11-06 22:43:55,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-11-06 22:43:55,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 45. [2020-11-06 22:43:55,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-06 22:43:55,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-11-06 22:43:55,852 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 35 [2020-11-06 22:43:55,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:55,852 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-11-06 22:43:55,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:43:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-11-06 22:43:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-06 22:43:55,854 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:55,854 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:43:56,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-06 22:43:56,069 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:56,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:56,070 INFO L82 PathProgramCache]: Analyzing trace with hash -280196357, now seen corresponding path program 4 times [2020-11-06 22:43:56,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:56,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578000556] [2020-11-06 22:43:56,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:56,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:56,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-06 22:43:56,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578000556] [2020-11-06 22:43:56,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207848389] [2020-11-06 22:43:56,217 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:56,315 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-06 22:43:56,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:43:56,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-06 22:43:56,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:43:56,429 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-11-06 22:43:56,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:43:56,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2020-11-06 22:43:56,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586510006] [2020-11-06 22:43:56,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-06 22:43:56,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:56,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-06 22:43:56,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:43:56,432 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 14 states. [2020-11-06 22:43:56,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:56,811 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2020-11-06 22:43:56,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-06 22:43:56,812 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2020-11-06 22:43:56,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:56,813 INFO L225 Difference]: With dead ends: 108 [2020-11-06 22:43:56,814 INFO L226 Difference]: Without dead ends: 78 [2020-11-06 22:43:56,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2020-11-06 22:43:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-06 22:43:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2020-11-06 22:43:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-06 22:43:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2020-11-06 22:43:56,822 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 40 [2020-11-06 22:43:56,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:56,823 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2020-11-06 22:43:56,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-06 22:43:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2020-11-06 22:43:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-06 22:43:56,824 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:56,824 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:43:57,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:57,040 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:57,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:57,041 INFO L82 PathProgramCache]: Analyzing trace with hash 655218735, now seen corresponding path program 5 times [2020-11-06 22:43:57,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:57,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767782581] [2020-11-06 22:43:57,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:57,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:57,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-06 22:43:57,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767782581] [2020-11-06 22:43:57,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426563942] [2020-11-06 22:43:57,193 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:57,312 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-11-06 22:43:57,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:43:57,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-06 22:43:57,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:43:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-06 22:43:57,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:43:57,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2020-11-06 22:43:57,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851358623] [2020-11-06 22:43:57,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:43:57,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:57,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:43:57,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:43:57,349 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 11 states. [2020-11-06 22:43:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:57,684 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2020-11-06 22:43:57,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:43:57,686 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2020-11-06 22:43:57,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:57,687 INFO L225 Difference]: With dead ends: 99 [2020-11-06 22:43:57,688 INFO L226 Difference]: Without dead ends: 85 [2020-11-06 22:43:57,689 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:43:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-06 22:43:57,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2020-11-06 22:43:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-06 22:43:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2020-11-06 22:43:57,709 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 45 [2020-11-06 22:43:57,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:57,709 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2020-11-06 22:43:57,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:43:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2020-11-06 22:43:57,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-06 22:43:57,712 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:57,712 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:43:57,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:57,915 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:57,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:57,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1937723683, now seen corresponding path program 6 times [2020-11-06 22:43:57,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:57,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293556101] [2020-11-06 22:43:57,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:58,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:58,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:58,073 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-06 22:43:58,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293556101] [2020-11-06 22:43:58,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586162553] [2020-11-06 22:43:58,074 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:58,184 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2020-11-06 22:43:58,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:43:58,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core [2020-11-06 22:43:58,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:43:58,290 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-11-06 22:43:58,290 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:43:58,308 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:43:58,309 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:43:58,310 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2020-11-06 22:43:58,595 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:43:58,596 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2020-11-06 22:43:58,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:43:58,602 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-06 22:43:58,615 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:43:58,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:43:58,622 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:43:58,622 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:15 [2020-11-06 22:43:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-11-06 22:43:58,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:43:58,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2020-11-06 22:43:58,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733602271] [2020-11-06 22:43:58,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-06 22:43:58,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:58,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-06 22:43:58,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:43:58,747 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 19 states. [2020-11-06 22:43:59,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:59,471 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2020-11-06 22:43:59,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-06 22:43:59,471 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2020-11-06 22:43:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:59,472 INFO L225 Difference]: With dead ends: 60 [2020-11-06 22:43:59,472 INFO L226 Difference]: Without dead ends: 0 [2020-11-06 22:43:59,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=237, Invalid=885, Unknown=0, NotChecked=0, Total=1122 [2020-11-06 22:43:59,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-06 22:43:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-06 22:43:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-06 22:43:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-06 22:43:59,475 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-11-06 22:43:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:59,475 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-06 22:43:59,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-06 22:43:59,480 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-06 22:43:59,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-06 22:43:59,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-11-06 22:43:59,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-06 22:43:59,844 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2020-11-06 22:44:00,022 INFO L266 CegarLoopResult]: For program point reach_errorEXIT(line 14) no Hoare annotation was computed. [2020-11-06 22:44:00,022 INFO L266 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-11-06 22:44:00,022 INFO L266 CegarLoopResult]: For program point L14-2(line 14) no Hoare annotation was computed. [2020-11-06 22:44:00,022 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 14) the Hoare annotation is: true [2020-11-06 22:44:00,023 INFO L266 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2020-11-06 22:44:00,023 INFO L266 CegarLoopResult]: For program point L23-2(lines 23 26) no Hoare annotation was computed. [2020-11-06 22:44:00,023 INFO L262 CegarLoopResult]: At program point L23-3(lines 23 26) the Hoare annotation is: (let ((.cse0 (= init_~a.offset |init_#in~a.offset|)) (.cse1 (= init_~a.base |init_#in~a.base|)) (.cse2 (= |init_#in~size| init_~size))) (or (and (exists ((v_init_~i~0_13 Int)) (and (< v_init_~i~0_13 init_~size) (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ (* v_init_~i~0_13 4) |init_#in~a.offset|)) 0)) (<= init_~i~0 (+ v_init_~i~0_13 1)))) .cse0 .cse1 .cse2) (and .cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) .cse1 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|) (<= init_~i~0 0) .cse2))) [2020-11-06 22:44:00,023 INFO L266 CegarLoopResult]: For program point L23-4(lines 20 27) no Hoare annotation was computed. [2020-11-06 22:44:00,023 INFO L262 CegarLoopResult]: At program point initENTRY(lines 20 27) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2020-11-06 22:44:00,024 INFO L266 CegarLoopResult]: For program point initEXIT(lines 20 27) no Hoare annotation was computed. [2020-11-06 22:44:00,024 INFO L266 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:44:00,024 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |old(#t~string1.offset)| |#t~string1.offset|) (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-06 22:44:00,024 INFO L266 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:44:00,024 INFO L266 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:44:00,024 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-06 22:44:00,024 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-06 22:44:00,024 INFO L266 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:44:00,024 INFO L266 CegarLoopResult]: For program point L35-2(lines 35 41) no Hoare annotation was computed. [2020-11-06 22:44:00,025 INFO L262 CegarLoopResult]: At program point L35-3(lines 35 41) the Hoare annotation is: (or (<= 1 main_~flag~0) (and (< main_~i~1 100000) (exists ((v_init_~i~0_13 Int)) (and (<= 99999 v_init_~i~0_13) (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_13 4) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_13 100000))))) [2020-11-06 22:44:00,025 INFO L266 CegarLoopResult]: For program point L35-4(lines 35 41) no Hoare annotation was computed. [2020-11-06 22:44:00,025 INFO L266 CegarLoopResult]: For program point mainEXIT(lines 28 48) no Hoare annotation was computed. [2020-11-06 22:44:00,025 INFO L266 CegarLoopResult]: For program point mainFINAL(lines 28 48) no Hoare annotation was computed. [2020-11-06 22:44:00,025 INFO L266 CegarLoopResult]: For program point L44(lines 44 45) no Hoare annotation was computed. [2020-11-06 22:44:00,025 INFO L266 CegarLoopResult]: For program point L42-2(lines 42 46) no Hoare annotation was computed. [2020-11-06 22:44:00,025 INFO L262 CegarLoopResult]: At program point L42-3(lines 42 46) the Hoare annotation is: (<= 1 main_~flag~0) [2020-11-06 22:44:00,025 INFO L266 CegarLoopResult]: For program point L42-4(lines 42 46) no Hoare annotation was computed. [2020-11-06 22:44:00,025 INFO L269 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-11-06 22:44:00,026 INFO L266 CegarLoopResult]: For program point L34-1(line 34) no Hoare annotation was computed. [2020-11-06 22:44:00,026 INFO L262 CegarLoopResult]: At program point mainENTRY(lines 28 48) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2020-11-06 22:44:00,026 INFO L262 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: false [2020-11-06 22:44:00,026 INFO L266 CegarLoopResult]: For program point L45-1(line 45) no Hoare annotation was computed. [2020-11-06 22:44:00,026 INFO L266 CegarLoopResult]: For program point L37(lines 37 40) no Hoare annotation was computed. [2020-11-06 22:44:00,026 INFO L266 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-11-06 22:44:00,026 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(line 15) the Hoare annotation is: true [2020-11-06 22:44:00,026 INFO L269 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-11-06 22:44:00,027 INFO L266 CegarLoopResult]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-11-06 22:44:00,027 INFO L266 CegarLoopResult]: For program point L15-4(line 15) no Hoare annotation was computed. [2020-11-06 22:44:00,027 INFO L266 CegarLoopResult]: For program point __VERIFIER_assertEXIT(line 15) no Hoare annotation was computed. [2020-11-06 22:44:00,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,048 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:00,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,050 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-06 22:44:00,051 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-06 22:44:00,051 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:00,051 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:00,053 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,053 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,053 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,054 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-06 22:44:00,054 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-06 22:44:00,054 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:44:00,054 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:44:00,054 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,054 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,061 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:00,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,062 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-06 22:44:00,062 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-06 22:44:00,062 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:00,062 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:00,063 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,063 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,063 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,063 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-06 22:44:00,063 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-06 22:44:00,064 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:44:00,064 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:44:00,064 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,064 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,066 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:00,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,067 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:00,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,068 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:44:00 BoogieIcfgContainer [2020-11-06 22:44:00,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:44:00,073 INFO L168 Benchmark]: Toolchain (without parser) took 9432.68 ms. Allocated memory was 157.3 MB in the beginning and 194.0 MB in the end (delta: 36.7 MB). Free memory was 112.2 MB in the beginning and 109.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 40.7 MB. Max. memory is 8.0 GB. [2020-11-06 22:44:00,074 INFO L168 Benchmark]: CDTParser took 1.46 ms. Allocated memory is still 157.3 MB. Free memory was 129.2 MB in the beginning and 129.0 MB in the end (delta: 209.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:44:00,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.85 ms. Allocated memory is still 157.3 MB. Free memory was 111.6 MB in the beginning and 101.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-06 22:44:00,078 INFO L168 Benchmark]: Boogie Preprocessor took 59.67 ms. Allocated memory is still 157.3 MB. Free memory was 101.7 MB in the beginning and 140.1 MB in the end (delta: -38.5 MB). Peak memory consumption was 6.9 MB. Max. memory is 8.0 GB. [2020-11-06 22:44:00,087 INFO L168 Benchmark]: RCFGBuilder took 433.42 ms. Allocated memory is still 157.3 MB. Free memory was 140.1 MB in the beginning and 122.8 MB in the end (delta: 17.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:44:00,087 INFO L168 Benchmark]: TraceAbstraction took 8553.30 ms. Allocated memory was 157.3 MB in the beginning and 194.0 MB in the end (delta: 36.7 MB). Free memory was 122.3 MB in the beginning and 109.4 MB in the end (delta: 12.9 MB). Peak memory consumption was 50.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:44:00,093 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.46 ms. Allocated memory is still 157.3 MB. Free memory was 129.2 MB in the beginning and 129.0 MB in the end (delta: 209.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 370.85 ms. Allocated memory is still 157.3 MB. Free memory was 111.6 MB in the beginning and 101.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 59.67 ms. Allocated memory is still 157.3 MB. Free memory was 101.7 MB in the beginning and 140.1 MB in the end (delta: -38.5 MB). Peak memory consumption was 6.9 MB. Max. memory is 8.0 GB. * RCFGBuilder took 433.42 ms. Allocated memory is still 157.3 MB. Free memory was 140.1 MB in the beginning and 122.8 MB in the end (delta: 17.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8553.30 ms. Allocated memory was 157.3 MB in the beginning and 194.0 MB in the end (delta: 36.7 MB). Free memory was 122.3 MB in the beginning and 109.4 MB in the end (delta: 12.9 MB). Peak memory consumption was 50.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant [2020-11-06 22:44:00,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:00,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-06 22:44:00,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-06 22:44:00,111 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:00,111 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:00,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-06 22:44:00,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-06 22:44:00,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:44:00,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:44:00,114 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,114 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:00,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-06 22:44:00,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-06 22:44:00,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:00,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:00,123 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,124 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,124 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,124 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-06 22:44:00,125 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-06 22:44:00,125 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:44:00,125 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:44:00,125 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,125 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((\exists v_init_~i~0_13 : int :: (v_init_~i~0_13 < size && !(#memory_$Pointer$[a][v_init_~i~0_13 * 4 + a] == 0)) && i <= v_init_~i~0_13 + 1) && a == a) && a == a) && \old(size) == size) || ((((((((a == a && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(unknown-#length-unknown) == unknown-#length-unknown) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && a == a) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && i <= 0) && \old(size) == size) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 <= flag - InvariantResult [Line: 35]: Loop Invariant [2020-11-06 22:44:00,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,126 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:00,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,127 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:00,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,127 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:00,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:00,128 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: 1 <= flag || (i < 100000 && (\exists v_init_~i~0_13 : int :: (99999 <= v_init_~i~0_13 && !(#memory_$Pointer$[a][v_init_~i~0_13 * 4 + a] == 0)) && v_init_~i~0_13 < 100000)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.0s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 277 SDtfs, 300 SDslu, 702 SDs, 0 SdLazy, 957 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 127 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 40 PreInvPairs, 55 NumberOfFragments, 156 HoareAnnotationTreeSize, 40 FomulaSimplifications, 114 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 258 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 598 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 580 ConstructedInterpolants, 20 QuantifiedInterpolants, 66875 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1447 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 151/356 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...