/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-simple/nested_2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:41:42,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:41:42,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:41:42,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:41:42,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:41:42,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:41:42,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:41:42,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:41:42,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:41:42,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:41:42,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:41:42,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:41:42,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:41:42,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:41:42,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:41:42,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:41:42,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:41:42,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:41:42,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:41:42,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:41:42,346 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:41:42,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:41:42,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:41:42,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:41:42,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:41:42,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:41:42,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:41:42,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:41:42,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:41:42,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:41:42,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:41:42,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:41:42,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:41:42,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:41:42,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:41:42,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:41:42,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:41:42,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:41:42,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:41:42,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:41:42,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:41:42,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:41:42,365 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 [2022-04-27 11:41:42,401 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:41:42,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:41:42,401 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:41:42,401 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:41:42,402 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:41:42,402 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:41:42,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:41:42,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:41:42,405 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:41:42,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:41:42,406 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:41:42,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:41:42,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:41:42,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:41:42,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:41:42,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:41:42,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:41:42,408 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:41:42,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:41:42,408 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:41:42,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:41:42,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:41:42,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:41:42,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:41:42,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:41:42,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:41:42,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:41:42,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:41:42,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:41:42,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:41:42,410 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:41:42,410 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:41:42,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:41:42,411 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 11:41:42,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:41:42,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:41:42,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:41:42,656 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:41:42,657 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:41:42,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_2.c [2022-04-27 11:41:42,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bcd489b3/14e1a5bb42a2400d8903858b2dc224c8/FLAG06f930444 [2022-04-27 11:41:43,052 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:41:43,052 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_2.c [2022-04-27 11:41:43,057 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bcd489b3/14e1a5bb42a2400d8903858b2dc224c8/FLAG06f930444 [2022-04-27 11:41:43,496 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bcd489b3/14e1a5bb42a2400d8903858b2dc224c8 [2022-04-27 11:41:43,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:41:43,500 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:41:43,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:41:43,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:41:43,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:41:43,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:41:43" (1/1) ... [2022-04-27 11:41:43,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a52eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:41:43, skipping insertion in model container [2022-04-27 11:41:43,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:41:43" (1/1) ... [2022-04-27 11:41:43,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:41:43,523 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:41:43,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_2.c[730,743] [2022-04-27 11:41:43,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:41:43,672 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:41:43,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_2.c[730,743] [2022-04-27 11:41:43,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:41:43,697 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:41:43,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:41:43 WrapperNode [2022-04-27 11:41:43,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:41:43,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:41:43,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:41:43,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:41:43,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:41:43" (1/1) ... [2022-04-27 11:41:43,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:41:43" (1/1) ... [2022-04-27 11:41:43,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:41:43" (1/1) ... [2022-04-27 11:41:43,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:41:43" (1/1) ... [2022-04-27 11:41:43,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:41:43" (1/1) ... [2022-04-27 11:41:43,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:41:43" (1/1) ... [2022-04-27 11:41:43,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:41:43" (1/1) ... [2022-04-27 11:41:43,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:41:43,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:41:43,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:41:43,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:41:43,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:41:43" (1/1) ... [2022-04-27 11:41:43,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:41:43,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:41:43,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 11:41:43,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 11:41:43,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:41:43,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:41:43,791 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:41:43,792 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:41:43,794 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:41:43,794 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:41:43,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:41:43,795 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:41:43,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:41:43,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:41:43,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:41:43,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:41:43,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:41:43,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:41:43,853 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:41:43,854 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:41:43,938 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:41:43,944 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:41:43,945 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 11:41:43,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:41:43 BoogieIcfgContainer [2022-04-27 11:41:43,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:41:43,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:41:43,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:41:43,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:41:43,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:41:43" (1/3) ... [2022-04-27 11:41:43,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62606173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:41:43, skipping insertion in model container [2022-04-27 11:41:43,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:41:43" (2/3) ... [2022-04-27 11:41:43,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62606173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:41:43, skipping insertion in model container [2022-04-27 11:41:43,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:41:43" (3/3) ... [2022-04-27 11:41:43,955 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_2.c [2022-04-27 11:41:43,976 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:41:43,977 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:41:44,021 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:41:44,028 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4aa141b7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@39fd5c87 [2022-04-27 11:41:44,028 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:41:44,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:41:44,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-27 11:41:44,047 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:41:44,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:41:44,048 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:41:44,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:41:44,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1747983725, now seen corresponding path program 1 times [2022-04-27 11:41:44,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:41:44,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332959265] [2022-04-27 11:41:44,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:41:44,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:41:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:41:44,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:41:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:41:44,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-27 11:41:44,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 11:41:44,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #44#return; {21#true} is VALID [2022-04-27 11:41:44,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:41:44,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-27 11:41:44,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 11:41:44,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #44#return; {21#true} is VALID [2022-04-27 11:41:44,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret6 := main(); {21#true} is VALID [2022-04-27 11:41:44,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {26#(= main_~a~0 0)} is VALID [2022-04-27 11:41:44,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#(= main_~a~0 0)} assume !(~a~0 < 6); {22#false} is VALID [2022-04-27 11:41:44,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} assume !(6 == ~a~0 && 6 == ~b~0); {22#false} is VALID [2022-04-27 11:41:44,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-27 11:41:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:41:44,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:41:44,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332959265] [2022-04-27 11:41:44,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332959265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:41:44,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:41:44,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:41:44,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625511776] [2022-04-27 11:41:44,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:41:44,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-27 11:41:44,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:41:44,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:41:44,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:41:44,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:41:44,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:41:44,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:41:44,278 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:44,460 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-27 11:41:44,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:41:44,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-27 11:41:44,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:41:44,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-27 11:41:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-27 11:41:44,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-04-27 11:41:44,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:41:44,575 INFO L225 Difference]: With dead ends: 34 [2022-04-27 11:41:44,575 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 11:41:44,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:41:44,585 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:41:44,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 26 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:41:44,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 11:41:44,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2022-04-27 11:41:44,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:41:44,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,624 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,624 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:44,640 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 11:41:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:41:44,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:41:44,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:41:44,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:41:44,642 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:41:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:44,648 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 11:41:44,648 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:41:44,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:41:44,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:41:44,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:41:44,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:41:44,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 11:41:44,652 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-04-27 11:41:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:41:44,652 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 11:41:44,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,653 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 11:41:44,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:41:44,653 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:41:44,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:41:44,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:41:44,654 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:41:44,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:41:44,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1955520686, now seen corresponding path program 1 times [2022-04-27 11:41:44,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:41:44,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001928537] [2022-04-27 11:41:44,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:41:44,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:41:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:41:44,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:41:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:41:44,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {131#true} is VALID [2022-04-27 11:41:44,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} assume true; {131#true} is VALID [2022-04-27 11:41:44,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131#true} {131#true} #44#return; {131#true} is VALID [2022-04-27 11:41:44,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {131#true} call ULTIMATE.init(); {137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:41:44,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {131#true} is VALID [2022-04-27 11:41:44,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#true} assume true; {131#true} is VALID [2022-04-27 11:41:44,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131#true} {131#true} #44#return; {131#true} is VALID [2022-04-27 11:41:44,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {131#true} call #t~ret6 := main(); {131#true} is VALID [2022-04-27 11:41:44,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {131#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {131#true} is VALID [2022-04-27 11:41:44,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {131#true} assume !!(~a~0 < 6);~b~0 := 0; {136#(= main_~b~0 0)} is VALID [2022-04-27 11:41:44,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {136#(= main_~b~0 0)} assume !(~b~0 < 6); {132#false} is VALID [2022-04-27 11:41:44,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {132#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {132#false} is VALID [2022-04-27 11:41:44,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {132#false} assume !(~a~0 < 6); {132#false} is VALID [2022-04-27 11:41:44,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {132#false} assume !(6 == ~a~0 && 6 == ~b~0); {132#false} is VALID [2022-04-27 11:41:44,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {132#false} assume !false; {132#false} is VALID [2022-04-27 11:41:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:41:44,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:41:44,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001928537] [2022-04-27 11:41:44,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001928537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:41:44,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:41:44,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:41:44,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486425320] [2022-04-27 11:41:44,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:41:44,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 11:41:44,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:41:44,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:41:44,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:41:44,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:41:44,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:41:44,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:41:44,757 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:44,830 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-27 11:41:44,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:41:44,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 11:41:44,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:41:44,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-04-27 11:41:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-04-27 11:41:44,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 25 transitions. [2022-04-27 11:41:44,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:41:44,868 INFO L225 Difference]: With dead ends: 23 [2022-04-27 11:41:44,868 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 11:41:44,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:41:44,874 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:41:44,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 19 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:41:44,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 11:41:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-27 11:41:44,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:41:44,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,882 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,883 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:44,884 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-27 11:41:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 11:41:44,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:41:44,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:41:44,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 11:41:44,886 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 11:41:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:44,889 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-27 11:41:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 11:41:44,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:41:44,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:41:44,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:41:44,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:41:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 11:41:44,892 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-27 11:41:44,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:41:44,892 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 11:41:44,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:44,892 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 11:41:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:41:44,893 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:41:44,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:41:44,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:41:44,893 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:41:44,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:41:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash -686991696, now seen corresponding path program 1 times [2022-04-27 11:41:44,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:41:44,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881717577] [2022-04-27 11:41:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:41:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:41:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:41:44,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:41:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:41:44,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {230#true} is VALID [2022-04-27 11:41:44,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} assume true; {230#true} is VALID [2022-04-27 11:41:44,945 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {230#true} {230#true} #44#return; {230#true} is VALID [2022-04-27 11:41:44,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {230#true} call ULTIMATE.init(); {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:41:44,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {230#true} is VALID [2022-04-27 11:41:44,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {230#true} assume true; {230#true} is VALID [2022-04-27 11:41:44,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {230#true} {230#true} #44#return; {230#true} is VALID [2022-04-27 11:41:44,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {230#true} call #t~ret6 := main(); {230#true} is VALID [2022-04-27 11:41:44,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {230#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {230#true} is VALID [2022-04-27 11:41:44,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {230#true} assume !!(~a~0 < 6);~b~0 := 0; {235#(= main_~b~0 0)} is VALID [2022-04-27 11:41:44,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#(= main_~b~0 0)} assume !!(~b~0 < 6); {235#(= main_~b~0 0)} is VALID [2022-04-27 11:41:44,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {236#(<= main_~b~0 1)} is VALID [2022-04-27 11:41:44,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {236#(<= main_~b~0 1)} assume !(~b~0 < 6); {231#false} is VALID [2022-04-27 11:41:44,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {231#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {231#false} is VALID [2022-04-27 11:41:44,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {231#false} assume !(~a~0 < 6); {231#false} is VALID [2022-04-27 11:41:44,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {231#false} assume !(6 == ~a~0 && 6 == ~b~0); {231#false} is VALID [2022-04-27 11:41:44,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {231#false} assume !false; {231#false} is VALID [2022-04-27 11:41:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:41:44,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:41:44,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881717577] [2022-04-27 11:41:44,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881717577] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:41:44,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99193031] [2022-04-27 11:41:44,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:41:44,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:41:44,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:41:44,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:41:44,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 11:41:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:41:45,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 11:41:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:41:45,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:41:45,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {230#true} call ULTIMATE.init(); {230#true} is VALID [2022-04-27 11:41:45,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {230#true} is VALID [2022-04-27 11:41:45,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {230#true} assume true; {230#true} is VALID [2022-04-27 11:41:45,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {230#true} {230#true} #44#return; {230#true} is VALID [2022-04-27 11:41:45,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {230#true} call #t~ret6 := main(); {230#true} is VALID [2022-04-27 11:41:45,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {230#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {230#true} is VALID [2022-04-27 11:41:45,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {230#true} assume !!(~a~0 < 6);~b~0 := 0; {259#(<= main_~b~0 0)} is VALID [2022-04-27 11:41:45,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {259#(<= main_~b~0 0)} assume !!(~b~0 < 6); {259#(<= main_~b~0 0)} is VALID [2022-04-27 11:41:45,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {259#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {236#(<= main_~b~0 1)} is VALID [2022-04-27 11:41:45,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {236#(<= main_~b~0 1)} assume !(~b~0 < 6); {231#false} is VALID [2022-04-27 11:41:45,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {231#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {231#false} is VALID [2022-04-27 11:41:45,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {231#false} assume !(~a~0 < 6); {231#false} is VALID [2022-04-27 11:41:45,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {231#false} assume !(6 == ~a~0 && 6 == ~b~0); {231#false} is VALID [2022-04-27 11:41:45,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {231#false} assume !false; {231#false} is VALID [2022-04-27 11:41:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:41:45,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:41:45,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {231#false} assume !false; {231#false} is VALID [2022-04-27 11:41:45,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {231#false} assume !(6 == ~a~0 && 6 == ~b~0); {231#false} is VALID [2022-04-27 11:41:45,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {231#false} assume !(~a~0 < 6); {231#false} is VALID [2022-04-27 11:41:45,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {231#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {231#false} is VALID [2022-04-27 11:41:45,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#(< main_~b~0 6)} assume !(~b~0 < 6); {231#false} is VALID [2022-04-27 11:41:45,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {297#(< main_~b~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {293#(< main_~b~0 6)} is VALID [2022-04-27 11:41:45,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {297#(< main_~b~0 5)} assume !!(~b~0 < 6); {297#(< main_~b~0 5)} is VALID [2022-04-27 11:41:45,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {230#true} assume !!(~a~0 < 6);~b~0 := 0; {297#(< main_~b~0 5)} is VALID [2022-04-27 11:41:45,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {230#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {230#true} is VALID [2022-04-27 11:41:45,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {230#true} call #t~ret6 := main(); {230#true} is VALID [2022-04-27 11:41:45,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {230#true} {230#true} #44#return; {230#true} is VALID [2022-04-27 11:41:45,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {230#true} assume true; {230#true} is VALID [2022-04-27 11:41:45,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {230#true} is VALID [2022-04-27 11:41:45,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {230#true} call ULTIMATE.init(); {230#true} is VALID [2022-04-27 11:41:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:41:45,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99193031] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:41:45,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:41:45,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 11:41:45,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904364917] [2022-04-27 11:41:45,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:41:45,233 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:41:45,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:41:45,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:45,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:41:45,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:41:45,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:41:45,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:41:45,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:41:45,257 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:45,390 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-27 11:41:45,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:41:45,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:41:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:41:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-27 11:41:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-27 11:41:45,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-27 11:41:45,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:41:45,426 INFO L225 Difference]: With dead ends: 29 [2022-04-27 11:41:45,426 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 11:41:45,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:41:45,429 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:41:45,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:41:45,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 11:41:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-27 11:41:45,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:41:45,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:45,439 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:45,440 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:45,441 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 11:41:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-27 11:41:45,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:41:45,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:41:45,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 11:41:45,442 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 11:41:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:45,443 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 11:41:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-27 11:41:45,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:41:45,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:41:45,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:41:45,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:41:45,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-27 11:41:45,445 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-04-27 11:41:45,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:41:45,445 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-27 11:41:45,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-27 11:41:45,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:41:45,446 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:41:45,446 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:41:45,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:41:45,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:41:45,670 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:41:45,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:41:45,670 INFO L85 PathProgramCache]: Analyzing trace with hash -533774390, now seen corresponding path program 2 times [2022-04-27 11:41:45,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:41:45,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162878150] [2022-04-27 11:41:45,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:41:45,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:41:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:41:45,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:41:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:41:45,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {449#true} is VALID [2022-04-27 11:41:45,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-27 11:41:45,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {449#true} {449#true} #44#return; {449#true} is VALID [2022-04-27 11:41:45,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:41:45,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {449#true} is VALID [2022-04-27 11:41:45,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-27 11:41:45,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {449#true} {449#true} #44#return; {449#true} is VALID [2022-04-27 11:41:45,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {449#true} call #t~ret6 := main(); {449#true} is VALID [2022-04-27 11:41:45,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {449#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {454#(= main_~a~0 0)} is VALID [2022-04-27 11:41:45,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {454#(= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {454#(= main_~a~0 0)} is VALID [2022-04-27 11:41:45,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {454#(= main_~a~0 0)} assume !!(~b~0 < 6); {454#(= main_~a~0 0)} is VALID [2022-04-27 11:41:45,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {454#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {454#(= main_~a~0 0)} is VALID [2022-04-27 11:41:45,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {454#(= main_~a~0 0)} assume !!(~b~0 < 6); {454#(= main_~a~0 0)} is VALID [2022-04-27 11:41:45,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {454#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {454#(= main_~a~0 0)} is VALID [2022-04-27 11:41:45,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {454#(= main_~a~0 0)} assume !!(~b~0 < 6); {454#(= main_~a~0 0)} is VALID [2022-04-27 11:41:45,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {454#(= main_~a~0 0)} is VALID [2022-04-27 11:41:45,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#(= main_~a~0 0)} assume !!(~b~0 < 6); {454#(= main_~a~0 0)} is VALID [2022-04-27 11:41:45,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {454#(= main_~a~0 0)} is VALID [2022-04-27 11:41:45,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#(= main_~a~0 0)} assume !(~b~0 < 6); {454#(= main_~a~0 0)} is VALID [2022-04-27 11:41:45,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {455#(<= main_~a~0 1)} is VALID [2022-04-27 11:41:45,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {455#(<= main_~a~0 1)} assume !(~a~0 < 6); {450#false} is VALID [2022-04-27 11:41:45,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {450#false} assume !(6 == ~a~0 && 6 == ~b~0); {450#false} is VALID [2022-04-27 11:41:45,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-04-27 11:41:45,743 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 11:41:45,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:41:45,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162878150] [2022-04-27 11:41:45,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162878150] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:41:45,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233642823] [2022-04-27 11:41:45,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:41:45,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:41:45,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:41:45,748 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:41:45,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 11:41:45,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:41:45,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:41:45,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 11:41:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:41:45,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:41:45,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {449#true} is VALID [2022-04-27 11:41:45,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {449#true} is VALID [2022-04-27 11:41:45,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-27 11:41:45,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {449#true} {449#true} #44#return; {449#true} is VALID [2022-04-27 11:41:45,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {449#true} call #t~ret6 := main(); {449#true} is VALID [2022-04-27 11:41:45,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {449#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {475#(<= main_~a~0 0)} is VALID [2022-04-27 11:41:45,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {475#(<= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {475#(<= main_~a~0 0)} is VALID [2022-04-27 11:41:45,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {475#(<= main_~a~0 0)} assume !!(~b~0 < 6); {475#(<= main_~a~0 0)} is VALID [2022-04-27 11:41:45,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {475#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {475#(<= main_~a~0 0)} is VALID [2022-04-27 11:41:45,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {475#(<= main_~a~0 0)} assume !!(~b~0 < 6); {475#(<= main_~a~0 0)} is VALID [2022-04-27 11:41:45,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {475#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {475#(<= main_~a~0 0)} is VALID [2022-04-27 11:41:45,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {475#(<= main_~a~0 0)} assume !!(~b~0 < 6); {475#(<= main_~a~0 0)} is VALID [2022-04-27 11:41:45,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {475#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {475#(<= main_~a~0 0)} is VALID [2022-04-27 11:41:45,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {475#(<= main_~a~0 0)} assume !!(~b~0 < 6); {475#(<= main_~a~0 0)} is VALID [2022-04-27 11:41:45,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {475#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {475#(<= main_~a~0 0)} is VALID [2022-04-27 11:41:45,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {475#(<= main_~a~0 0)} assume !(~b~0 < 6); {475#(<= main_~a~0 0)} is VALID [2022-04-27 11:41:45,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {475#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {455#(<= main_~a~0 1)} is VALID [2022-04-27 11:41:45,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {455#(<= main_~a~0 1)} assume !(~a~0 < 6); {450#false} is VALID [2022-04-27 11:41:45,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {450#false} assume !(6 == ~a~0 && 6 == ~b~0); {450#false} is VALID [2022-04-27 11:41:45,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-04-27 11:41:45,927 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 11:41:45,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:41:46,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-04-27 11:41:46,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {450#false} assume !(6 == ~a~0 && 6 == ~b~0); {450#false} is VALID [2022-04-27 11:41:46,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {524#(< main_~a~0 6)} assume !(~a~0 < 6); {450#false} is VALID [2022-04-27 11:41:46,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {528#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {524#(< main_~a~0 6)} is VALID [2022-04-27 11:41:46,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {528#(< main_~a~0 5)} assume !(~b~0 < 6); {528#(< main_~a~0 5)} is VALID [2022-04-27 11:41:46,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {528#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {528#(< main_~a~0 5)} is VALID [2022-04-27 11:41:46,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {528#(< main_~a~0 5)} assume !!(~b~0 < 6); {528#(< main_~a~0 5)} is VALID [2022-04-27 11:41:46,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {528#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {528#(< main_~a~0 5)} is VALID [2022-04-27 11:41:46,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {528#(< main_~a~0 5)} assume !!(~b~0 < 6); {528#(< main_~a~0 5)} is VALID [2022-04-27 11:41:46,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {528#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {528#(< main_~a~0 5)} is VALID [2022-04-27 11:41:46,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {528#(< main_~a~0 5)} assume !!(~b~0 < 6); {528#(< main_~a~0 5)} is VALID [2022-04-27 11:41:46,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {528#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {528#(< main_~a~0 5)} is VALID [2022-04-27 11:41:46,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {528#(< main_~a~0 5)} assume !!(~b~0 < 6); {528#(< main_~a~0 5)} is VALID [2022-04-27 11:41:46,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {528#(< main_~a~0 5)} assume !!(~a~0 < 6);~b~0 := 0; {528#(< main_~a~0 5)} is VALID [2022-04-27 11:41:46,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {449#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {528#(< main_~a~0 5)} is VALID [2022-04-27 11:41:46,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {449#true} call #t~ret6 := main(); {449#true} is VALID [2022-04-27 11:41:46,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {449#true} {449#true} #44#return; {449#true} is VALID [2022-04-27 11:41:46,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-27 11:41:46,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {449#true} is VALID [2022-04-27 11:41:46,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {449#true} is VALID [2022-04-27 11:41:46,073 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 11:41:46,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233642823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:41:46,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:41:46,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 11:41:46,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897436703] [2022-04-27 11:41:46,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:41:46,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:41:46,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:41:46,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:46,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:41:46,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:41:46,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:41:46,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:41:46,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:41:46,099 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:46,269 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-27 11:41:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:41:46,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:41:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:41:46,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-27 11:41:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-27 11:41:46,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2022-04-27 11:41:46,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:41:46,310 INFO L225 Difference]: With dead ends: 57 [2022-04-27 11:41:46,310 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 11:41:46,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:41:46,311 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:41:46,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 29 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:41:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 11:41:46,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 11:41:46,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:41:46,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:46,334 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:46,334 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:46,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:46,337 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-27 11:41:46,337 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-27 11:41:46,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:41:46,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:41:46,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-27 11:41:46,338 INFO L87 Difference]: Start difference. First operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-27 11:41:46,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:46,340 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-27 11:41:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-27 11:41:46,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:41:46,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:41:46,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:41:46,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:41:46,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-27 11:41:46,343 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 20 [2022-04-27 11:41:46,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:41:46,344 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-27 11:41:46,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-27 11:41:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 11:41:46,345 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:41:46,345 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:41:46,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 11:41:46,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 11:41:46,564 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:41:46,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:41:46,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1857370579, now seen corresponding path program 3 times [2022-04-27 11:41:46,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:41:46,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709751184] [2022-04-27 11:41:46,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:41:46,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:41:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:41:46,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:41:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:41:46,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {874#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {864#true} is VALID [2022-04-27 11:41:46,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {864#true} assume true; {864#true} is VALID [2022-04-27 11:41:46,683 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {864#true} {864#true} #44#return; {864#true} is VALID [2022-04-27 11:41:46,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {864#true} call ULTIMATE.init(); {874#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:41:46,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {874#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {864#true} is VALID [2022-04-27 11:41:46,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {864#true} assume true; {864#true} is VALID [2022-04-27 11:41:46,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {864#true} {864#true} #44#return; {864#true} is VALID [2022-04-27 11:41:46,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {864#true} call #t~ret6 := main(); {864#true} is VALID [2022-04-27 11:41:46,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {864#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {864#true} is VALID [2022-04-27 11:41:46,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {864#true} assume !!(~a~0 < 6);~b~0 := 0; {869#(= main_~b~0 0)} is VALID [2022-04-27 11:41:46,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {869#(= main_~b~0 0)} assume !!(~b~0 < 6); {869#(= main_~b~0 0)} is VALID [2022-04-27 11:41:46,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {869#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {870#(<= main_~b~0 1)} is VALID [2022-04-27 11:41:46,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {870#(<= main_~b~0 1)} assume !!(~b~0 < 6); {870#(<= main_~b~0 1)} is VALID [2022-04-27 11:41:46,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {870#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {871#(<= main_~b~0 2)} is VALID [2022-04-27 11:41:46,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {871#(<= main_~b~0 2)} assume !!(~b~0 < 6); {871#(<= main_~b~0 2)} is VALID [2022-04-27 11:41:46,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {871#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {872#(<= main_~b~0 3)} is VALID [2022-04-27 11:41:46,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {872#(<= main_~b~0 3)} assume !!(~b~0 < 6); {872#(<= main_~b~0 3)} is VALID [2022-04-27 11:41:46,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {872#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {873#(<= main_~b~0 4)} is VALID [2022-04-27 11:41:46,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {873#(<= main_~b~0 4)} assume !(~b~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {865#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {865#false} is VALID [2022-04-27 11:41:46,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {865#false} assume !!(~a~0 < 6);~b~0 := 0; {865#false} is VALID [2022-04-27 11:41:46,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {865#false} assume !!(~b~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {865#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {865#false} is VALID [2022-04-27 11:41:46,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {865#false} assume !!(~b~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {865#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {865#false} is VALID [2022-04-27 11:41:46,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {865#false} assume !!(~b~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {865#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {865#false} is VALID [2022-04-27 11:41:46,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {865#false} assume !!(~b~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {865#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {865#false} is VALID [2022-04-27 11:41:46,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {865#false} assume !(~b~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {865#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {865#false} is VALID [2022-04-27 11:41:46,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {865#false} assume !!(~a~0 < 6);~b~0 := 0; {865#false} is VALID [2022-04-27 11:41:46,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {865#false} assume !!(~b~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {865#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {865#false} is VALID [2022-04-27 11:41:46,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {865#false} assume !!(~b~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {865#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {865#false} is VALID [2022-04-27 11:41:46,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {865#false} assume !!(~b~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {865#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {865#false} is VALID [2022-04-27 11:41:46,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {865#false} assume !!(~b~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {865#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {865#false} is VALID [2022-04-27 11:41:46,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {865#false} assume !(~b~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {865#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {865#false} is VALID [2022-04-27 11:41:46,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {865#false} assume !!(~a~0 < 6);~b~0 := 0; {865#false} is VALID [2022-04-27 11:41:46,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {865#false} assume !!(~b~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {865#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {865#false} is VALID [2022-04-27 11:41:46,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {865#false} assume !!(~b~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,696 INFO L290 TraceCheckUtils]: 43: Hoare triple {865#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {865#false} is VALID [2022-04-27 11:41:46,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {865#false} assume !!(~b~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,697 INFO L290 TraceCheckUtils]: 45: Hoare triple {865#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {865#false} is VALID [2022-04-27 11:41:46,697 INFO L290 TraceCheckUtils]: 46: Hoare triple {865#false} assume !!(~b~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,697 INFO L290 TraceCheckUtils]: 47: Hoare triple {865#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {865#false} is VALID [2022-04-27 11:41:46,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {865#false} assume !(~b~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {865#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {865#false} is VALID [2022-04-27 11:41:46,697 INFO L290 TraceCheckUtils]: 50: Hoare triple {865#false} assume !(~a~0 < 6); {865#false} is VALID [2022-04-27 11:41:46,697 INFO L290 TraceCheckUtils]: 51: Hoare triple {865#false} assume !(6 == ~a~0 && 6 == ~b~0); {865#false} is VALID [2022-04-27 11:41:46,697 INFO L290 TraceCheckUtils]: 52: Hoare triple {865#false} assume !false; {865#false} is VALID [2022-04-27 11:41:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 127 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-04-27 11:41:46,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:41:46,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709751184] [2022-04-27 11:41:46,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709751184] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:41:46,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183045548] [2022-04-27 11:41:46,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:41:46,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:41:46,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:41:46,700 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:41:46,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 11:41:46,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 11:41:46,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:41:46,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:41:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:41:46,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:41:47,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {864#true} call ULTIMATE.init(); {864#true} is VALID [2022-04-27 11:41:47,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {864#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {864#true} is VALID [2022-04-27 11:41:47,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {864#true} assume true; {864#true} is VALID [2022-04-27 11:41:47,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {864#true} {864#true} #44#return; {864#true} is VALID [2022-04-27 11:41:47,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {864#true} call #t~ret6 := main(); {864#true} is VALID [2022-04-27 11:41:47,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {864#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {864#true} is VALID [2022-04-27 11:41:47,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {864#true} assume !!(~a~0 < 6);~b~0 := 0; {864#true} is VALID [2022-04-27 11:41:47,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {864#true} assume !!(~b~0 < 6); {864#true} is VALID [2022-04-27 11:41:47,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {864#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {864#true} is VALID [2022-04-27 11:41:47,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {864#true} assume !!(~b~0 < 6); {864#true} is VALID [2022-04-27 11:41:47,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {864#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {864#true} is VALID [2022-04-27 11:41:47,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {864#true} assume !!(~b~0 < 6); {864#true} is VALID [2022-04-27 11:41:47,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {864#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {864#true} is VALID [2022-04-27 11:41:47,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {864#true} assume !!(~b~0 < 6); {864#true} is VALID [2022-04-27 11:41:47,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {864#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {864#true} is VALID [2022-04-27 11:41:47,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {864#true} assume !(~b~0 < 6); {864#true} is VALID [2022-04-27 11:41:47,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {864#true} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {864#true} is VALID [2022-04-27 11:41:47,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {864#true} assume !!(~a~0 < 6);~b~0 := 0; {864#true} is VALID [2022-04-27 11:41:47,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {864#true} assume !!(~b~0 < 6); {864#true} is VALID [2022-04-27 11:41:47,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {864#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {864#true} is VALID [2022-04-27 11:41:47,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {864#true} assume !!(~b~0 < 6); {864#true} is VALID [2022-04-27 11:41:47,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {864#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {864#true} is VALID [2022-04-27 11:41:47,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {864#true} assume !!(~b~0 < 6); {864#true} is VALID [2022-04-27 11:41:47,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {864#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {864#true} is VALID [2022-04-27 11:41:47,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {864#true} assume !!(~b~0 < 6); {864#true} is VALID [2022-04-27 11:41:47,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {864#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {864#true} is VALID [2022-04-27 11:41:47,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {864#true} assume !(~b~0 < 6); {864#true} is VALID [2022-04-27 11:41:47,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {864#true} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {864#true} is VALID [2022-04-27 11:41:47,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {864#true} assume !!(~a~0 < 6);~b~0 := 0; {864#true} is VALID [2022-04-27 11:41:47,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {864#true} assume !!(~b~0 < 6); {864#true} is VALID [2022-04-27 11:41:47,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {864#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {864#true} is VALID [2022-04-27 11:41:47,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {864#true} assume !!(~b~0 < 6); {864#true} is VALID [2022-04-27 11:41:47,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {864#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {864#true} is VALID [2022-04-27 11:41:47,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {864#true} assume !!(~b~0 < 6); {864#true} is VALID [2022-04-27 11:41:47,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {864#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {864#true} is VALID [2022-04-27 11:41:47,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {864#true} assume !!(~b~0 < 6); {864#true} is VALID [2022-04-27 11:41:47,144 INFO L290 TraceCheckUtils]: 36: Hoare triple {864#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {864#true} is VALID [2022-04-27 11:41:47,144 INFO L290 TraceCheckUtils]: 37: Hoare triple {864#true} assume !(~b~0 < 6); {864#true} is VALID [2022-04-27 11:41:47,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {864#true} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {864#true} is VALID [2022-04-27 11:41:47,145 INFO L290 TraceCheckUtils]: 39: Hoare triple {864#true} assume !!(~a~0 < 6);~b~0 := 0; {995#(< main_~a~0 6)} is VALID [2022-04-27 11:41:47,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {995#(< main_~a~0 6)} assume !!(~b~0 < 6); {995#(< main_~a~0 6)} is VALID [2022-04-27 11:41:47,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {995#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {995#(< main_~a~0 6)} is VALID [2022-04-27 11:41:47,146 INFO L290 TraceCheckUtils]: 42: Hoare triple {995#(< main_~a~0 6)} assume !!(~b~0 < 6); {995#(< main_~a~0 6)} is VALID [2022-04-27 11:41:47,146 INFO L290 TraceCheckUtils]: 43: Hoare triple {995#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {995#(< main_~a~0 6)} is VALID [2022-04-27 11:41:47,146 INFO L290 TraceCheckUtils]: 44: Hoare triple {995#(< main_~a~0 6)} assume !!(~b~0 < 6); {995#(< main_~a~0 6)} is VALID [2022-04-27 11:41:47,147 INFO L290 TraceCheckUtils]: 45: Hoare triple {995#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {995#(< main_~a~0 6)} is VALID [2022-04-27 11:41:47,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {995#(< main_~a~0 6)} assume !!(~b~0 < 6); {1017#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-27 11:41:47,148 INFO L290 TraceCheckUtils]: 47: Hoare triple {1017#(and (< main_~b~0 6) (< main_~a~0 6))} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1021#(and (< main_~b~0 7) (< main_~a~0 6))} is VALID [2022-04-27 11:41:47,148 INFO L290 TraceCheckUtils]: 48: Hoare triple {1021#(and (< main_~b~0 7) (< main_~a~0 6))} assume !(~b~0 < 6); {1025#(and (< main_~b~0 7) (< main_~a~0 6) (not (< main_~b~0 6)))} is VALID [2022-04-27 11:41:47,153 INFO L290 TraceCheckUtils]: 49: Hoare triple {1025#(and (< main_~b~0 7) (< main_~a~0 6) (not (< main_~b~0 6)))} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1029#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)))} is VALID [2022-04-27 11:41:47,154 INFO L290 TraceCheckUtils]: 50: Hoare triple {1029#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)))} assume !(~a~0 < 6); {1033#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)) (not (< main_~a~0 6)))} is VALID [2022-04-27 11:41:47,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {1033#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)) (not (< main_~a~0 6)))} assume !(6 == ~a~0 && 6 == ~b~0); {865#false} is VALID [2022-04-27 11:41:47,155 INFO L290 TraceCheckUtils]: 52: Hoare triple {865#false} assume !false; {865#false} is VALID [2022-04-27 11:41:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-04-27 11:41:47,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:41:47,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183045548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:41:47,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:41:47,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-04-27 11:41:47,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332957664] [2022-04-27 11:41:47,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:41:47,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-27 11:41:47,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:41:47,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:47,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:41:47,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:41:47,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:41:47,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:41:47,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:41:47,172 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:47,280 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-27 11:41:47,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:41:47,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-27 11:41:47,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:41:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2022-04-27 11:41:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2022-04-27 11:41:47,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 16 transitions. [2022-04-27 11:41:47,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:41:47,296 INFO L225 Difference]: With dead ends: 54 [2022-04-27 11:41:47,296 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:41:47,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:41:47,297 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:41:47,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 21 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:41:47,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:41:47,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:41:47,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:41:47,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:41:47,298 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:41:47,298 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:41:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:47,298 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:41:47,298 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:41:47,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:41:47,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:41:47,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:41:47,299 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:41:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:47,299 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:41:47,299 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:41:47,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:41:47,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:41:47,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:41:47,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:41:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:41:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:41:47,299 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2022-04-27 11:41:47,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:41:47,300 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:41:47,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:41:47,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:41:47,302 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:41:47,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 11:41:47,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:41:47,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:41:47,685 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-27 11:41:47,685 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-27 11:41:47,685 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-27 11:41:47,685 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:41:47,686 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 11:41:47,686 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:41:47,686 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:41:47,686 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:41:47,686 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:41:47,686 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:41:47,686 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 15 29) no Hoare annotation was computed. [2022-04-27 11:41:47,686 INFO L899 garLoopResultBuilder]: For program point L25-1(lines 25 27) no Hoare annotation was computed. [2022-04-27 11:41:47,686 INFO L899 garLoopResultBuilder]: For program point L21-2(lines 21 23) no Hoare annotation was computed. [2022-04-27 11:41:47,686 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 23) the Hoare annotation is: (and (< main_~b~0 7) (< main_~a~0 6)) [2022-04-27 11:41:47,686 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 15 29) no Hoare annotation was computed. [2022-04-27 11:41:47,686 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 26) no Hoare annotation was computed. [2022-04-27 11:41:47,686 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 15 29) the Hoare annotation is: true [2022-04-27 11:41:47,687 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-27 11:41:47,687 INFO L899 garLoopResultBuilder]: For program point L20-2(lines 20 24) no Hoare annotation was computed. [2022-04-27 11:41:47,687 INFO L895 garLoopResultBuilder]: At program point L20-3(lines 20 24) the Hoare annotation is: (and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6))) [2022-04-27 11:41:47,687 INFO L899 garLoopResultBuilder]: For program point L20-4(lines 15 29) no Hoare annotation was computed. [2022-04-27 11:41:47,690 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2022-04-27 11:41:47,692 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:41:47,695 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:41:47,695 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:41:47,697 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 11:41:47,697 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:41:47,697 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:41:47,697 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-04-27 11:41:47,697 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-04-27 11:41:47,698 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:41:47,698 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:41:47,698 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-04-27 11:41:47,698 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-04-27 11:41:47,698 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-04-27 11:41:47,698 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-04-27 11:41:47,698 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-27 11:41:47,698 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 11:41:47,698 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 11:41:47,698 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 11:41:47,698 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-04-27 11:41:47,699 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-27 11:41:47,699 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:41:47,699 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:41:47,699 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:41:47,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:41:47 BoogieIcfgContainer [2022-04-27 11:41:47,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:41:47,707 INFO L158 Benchmark]: Toolchain (without parser) took 4206.67ms. Allocated memory was 192.9MB in the beginning and 243.3MB in the end (delta: 50.3MB). Free memory was 134.9MB in the beginning and 169.5MB in the end (delta: -34.6MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2022-04-27 11:41:47,707 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 192.9MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:41:47,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.54ms. Allocated memory was 192.9MB in the beginning and 243.3MB in the end (delta: 50.3MB). Free memory was 134.7MB in the beginning and 213.7MB in the end (delta: -79.0MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-27 11:41:47,708 INFO L158 Benchmark]: Boogie Preprocessor took 29.74ms. Allocated memory is still 243.3MB. Free memory was 213.7MB in the beginning and 212.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:41:47,708 INFO L158 Benchmark]: RCFGBuilder took 217.94ms. Allocated memory is still 243.3MB. Free memory was 212.2MB in the beginning and 202.3MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 11:41:47,709 INFO L158 Benchmark]: TraceAbstraction took 3757.33ms. Allocated memory is still 243.3MB. Free memory was 201.7MB in the beginning and 169.5MB in the end (delta: 32.3MB). Peak memory consumption was 33.3MB. Max. memory is 8.0GB. [2022-04-27 11:41:47,710 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43ms. Allocated memory is still 192.9MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.54ms. Allocated memory was 192.9MB in the beginning and 243.3MB in the end (delta: 50.3MB). Free memory was 134.7MB in the beginning and 213.7MB in the end (delta: -79.0MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.74ms. Allocated memory is still 243.3MB. Free memory was 213.7MB in the beginning and 212.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 217.94ms. Allocated memory is still 243.3MB. Free memory was 212.2MB in the beginning and 202.3MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 3757.33ms. Allocated memory is still 243.3MB. Free memory was 201.7MB in the beginning and 169.5MB in the end (delta: 32.3MB). Peak memory consumption was 33.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 26]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 59 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=4, InterpolantAutomatonStates: 29, 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, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 31 NumberOfFragments, 28 HoareAnnotationTreeSize, 6 FomulaSimplifications, 109 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 175 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 195 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 421 SizeOfPredicates, 2 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 688/710 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: b < 7 && a < 6 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (a < 7 && b < 7) && !(b < 6) RESULT: Ultimate proved your program to be correct! [2022-04-27 11:41:47,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...