/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-new/nested-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:39:30,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:39:30,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:39:30,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:39:30,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:39:30,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:39:30,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:39:30,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:39:30,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:39:30,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:39:30,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:39:30,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:39:30,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:39:30,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:39:30,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:39:30,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:39:30,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:39:30,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:39:30,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:39:30,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:39:30,671 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:39:30,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:39:30,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:39:30,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:39:30,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:39:30,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:39:30,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:39:30,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:39:30,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:39:30,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:39:30,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:39:30,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:39:30,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:39:30,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:39:30,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:39:30,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:39:30,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:39:30,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:39:30,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:39:30,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:39:30,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:39:30,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:39:30,691 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:39:30,698 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:39:30,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:39:30,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:39:30,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:39:30,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:39:30,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:39:30,700 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:39:30,700 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:39:30,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:39:30,700 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:39:30,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:39:30,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:39:30,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:39:30,701 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:39:30,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:39:30,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:39:30,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:39:30,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:39:30,701 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:39:30,702 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:39:30,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:39:30,702 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:39:30,702 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:39:30,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:39:30,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:39:30,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:39:30,925 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:39:30,926 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:39:30,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/nested-1.i [2022-04-15 12:39:30,975 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6851eff/14e559fab68243d8b2f338712f8a0c3a/FLAG6ea689d4b [2022-04-15 12:39:31,412 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:39:31,413 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/nested-1.i [2022-04-15 12:39:31,419 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6851eff/14e559fab68243d8b2f338712f8a0c3a/FLAG6ea689d4b [2022-04-15 12:39:31,439 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6851eff/14e559fab68243d8b2f338712f8a0c3a [2022-04-15 12:39:31,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:39:31,443 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:39:31,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:39:31,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:39:31,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:39:31,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:39:31" (1/1) ... [2022-04-15 12:39:31,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24d13cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:31, skipping insertion in model container [2022-04-15 12:39:31,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:39:31" (1/1) ... [2022-04-15 12:39:31,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:39:31,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:39:31,615 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-new/nested-1.i[891,904] [2022-04-15 12:39:31,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:39:31,646 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:39:31,658 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-new/nested-1.i[891,904] [2022-04-15 12:39:31,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:39:31,674 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:39:31,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:31 WrapperNode [2022-04-15 12:39:31,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:39:31,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:39:31,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:39:31,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:39:31,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:31" (1/1) ... [2022-04-15 12:39:31,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:31" (1/1) ... [2022-04-15 12:39:31,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:31" (1/1) ... [2022-04-15 12:39:31,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:31" (1/1) ... [2022-04-15 12:39:31,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:31" (1/1) ... [2022-04-15 12:39:31,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:31" (1/1) ... [2022-04-15 12:39:31,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:31" (1/1) ... [2022-04-15 12:39:31,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:39:31,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:39:31,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:39:31,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:39:31,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:31" (1/1) ... [2022-04-15 12:39:31,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:39:31,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:39:31,753 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-15 12:39:31,763 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-15 12:39:31,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:39:31,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:39:31,797 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:39:31,798 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:39:31,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:39:31,799 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:39:31,799 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:39:31,799 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:39:31,799 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:39:31,800 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:39:31,800 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:39:31,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:39:31,800 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:39:31,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:39:31,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:39:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:39:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:39:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:39:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:39:31,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:39:31,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:39:31,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:39:31,895 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:39:31,897 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:39:32,123 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:39:32,130 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:39:32,139 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 12:39:32,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:39:32 BoogieIcfgContainer [2022-04-15 12:39:32,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:39:32,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:39:32,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:39:32,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:39:32,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:39:31" (1/3) ... [2022-04-15 12:39:32,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12db341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:39:32, skipping insertion in model container [2022-04-15 12:39:32,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:31" (2/3) ... [2022-04-15 12:39:32,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12db341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:39:32, skipping insertion in model container [2022-04-15 12:39:32,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:39:32" (3/3) ... [2022-04-15 12:39:32,151 INFO L111 eAbstractionObserver]: Analyzing ICFG nested-1.i [2022-04-15 12:39:32,155 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:39:32,156 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:39:32,211 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:39:32,219 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-15 12:39:32,219 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:39:32,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:39:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:39:32,254 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:32,254 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:32,255 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:32,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:32,259 INFO L85 PathProgramCache]: Analyzing trace with hash 486387592, now seen corresponding path program 1 times [2022-04-15 12:39:32,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:32,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1644146648] [2022-04-15 12:39:32,277 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:39:32,277 INFO L85 PathProgramCache]: Analyzing trace with hash 486387592, now seen corresponding path program 2 times [2022-04-15 12:39:32,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:32,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743561688] [2022-04-15 12:39:32,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:32,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:32,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:39:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:32,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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(9, 2); {27#true} is VALID [2022-04-15 12:39:32,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 12:39:32,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #71#return; {27#true} is VALID [2022-04-15 12:39:32,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:39:32,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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(9, 2); {27#true} is VALID [2022-04-15 12:39:32,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 12:39:32,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #71#return; {27#true} is VALID [2022-04-15 12:39:32,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret6 := main(); {27#true} is VALID [2022-04-15 12:39:32,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {27#true} is VALID [2022-04-15 12:39:32,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {32#(<= 10 main_~n~0)} is VALID [2022-04-15 12:39:32,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {33#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-15 12:39:32,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#(and (<= 10 main_~n~0) (= main_~i~0 0))} assume !(~i~0 < ~n~0); {28#false} is VALID [2022-04-15 12:39:32,574 INFO L272 TraceCheckUtils]: 9: Hoare triple {28#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {28#false} is VALID [2022-04-15 12:39:32,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-15 12:39:32,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-15 12:39:32,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 12:39:32,575 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-15 12:39:32,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:39:32,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743561688] [2022-04-15 12:39:32,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743561688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:32,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:32,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:39:32,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:39:32,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1644146648] [2022-04-15 12:39:32,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1644146648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:32,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:32,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:39:32,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257482434] [2022-04-15 12:39:32,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:39:32,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 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 13 [2022-04-15 12:39:32,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:39:32,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 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-15 12:39:32,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:32,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:39:32,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:32,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:39:32,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:39:32,640 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 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-15 12:39:32,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:32,915 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-15 12:39:32,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:39:32,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 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 13 [2022-04-15 12:39:32,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:39:32,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 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-15 12:39:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-15 12:39:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 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-15 12:39:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-15 12:39:32,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-04-15 12:39:33,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:33,021 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:39:33,021 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:39:33,023 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:39:33,028 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:39:33,031 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 40 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:39:33,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:39:33,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-04-15 12:39:33,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:39:33,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 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-15 12:39:33,073 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 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-15 12:39:33,074 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 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-15 12:39:33,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:33,077 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 12:39:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:39:33,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:33,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:33,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 12:39:33,078 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 12:39:33,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:33,079 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 12:39:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:39:33,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:33,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:33,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:39:33,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:39:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 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-15 12:39:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-15 12:39:33,082 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-04-15 12:39:33,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:39:33,083 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-15 12:39:33,083 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 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-15 12:39:33,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-15 12:39:33,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-15 12:39:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:39:33,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:33,110 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:33,110 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:39:33,111 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:33,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:33,111 INFO L85 PathProgramCache]: Analyzing trace with hash 123963385, now seen corresponding path program 1 times [2022-04-15 12:39:33,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:33,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1122669568] [2022-04-15 12:39:33,247 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:39:33,249 INFO L85 PathProgramCache]: Analyzing trace with hash -779046942, now seen corresponding path program 1 times [2022-04-15 12:39:33,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:33,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066019037] [2022-04-15 12:39:33,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:33,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:39:33,270 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:39:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:39:33,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:39:33,296 INFO L85 PathProgramCache]: Analyzing trace with hash 123963385, now seen corresponding path program 2 times [2022-04-15 12:39:33,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:33,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763775488] [2022-04-15 12:39:33,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:33,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:33,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:39:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:33,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(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(9, 2); {211#true} is VALID [2022-04-15 12:39:33,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#true} assume true; {211#true} is VALID [2022-04-15 12:39:33,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {211#true} {211#true} #71#return; {211#true} is VALID [2022-04-15 12:39:33,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {211#true} call ULTIMATE.init(); {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:39:33,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(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(9, 2); {211#true} is VALID [2022-04-15 12:39:33,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#true} assume true; {211#true} is VALID [2022-04-15 12:39:33,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {211#true} {211#true} #71#return; {211#true} is VALID [2022-04-15 12:39:33,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {211#true} call #t~ret6 := main(); {211#true} is VALID [2022-04-15 12:39:33,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {211#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {211#true} is VALID [2022-04-15 12:39:33,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {211#true} is VALID [2022-04-15 12:39:33,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#true} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {216#(<= 10 main_~m~0)} is VALID [2022-04-15 12:39:33,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {216#(<= 10 main_~m~0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {217#(and (<= 10 main_~m~0) (= main_~j~0 0))} is VALID [2022-04-15 12:39:33,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {217#(and (<= 10 main_~m~0) (= main_~j~0 0))} assume !(~j~0 < ~m~0); {212#false} is VALID [2022-04-15 12:39:33,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {212#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {212#false} is VALID [2022-04-15 12:39:33,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#false} assume !(~i~0 < ~n~0); {212#false} is VALID [2022-04-15 12:39:33,358 INFO L272 TraceCheckUtils]: 12: Hoare triple {212#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {212#false} is VALID [2022-04-15 12:39:33,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {212#false} ~cond := #in~cond; {212#false} is VALID [2022-04-15 12:39:33,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {212#false} assume 0 == ~cond; {212#false} is VALID [2022-04-15 12:39:33,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-04-15 12:39:33,359 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-15 12:39:33,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:39:33,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763775488] [2022-04-15 12:39:33,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763775488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:33,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:33,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:39:33,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:39:33,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1122669568] [2022-04-15 12:39:33,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1122669568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:33,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:33,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:39:33,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530129646] [2022-04-15 12:39:33,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:39:33,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 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 16 [2022-04-15 12:39:33,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:39:33,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 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-15 12:39:33,376 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-15 12:39:33,376 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:39:33,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:33,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:39:33,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:39:33,377 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 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-15 12:39:33,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:33,470 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 12:39:33,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:39:33,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 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 16 [2022-04-15 12:39:33,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:39:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 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-15 12:39:33,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 12:39:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 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-15 12:39:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 12:39:33,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-15 12:39:33,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:33,513 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:39:33,513 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 12:39:33,514 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:39:33,515 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:39:33,515 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 22 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:39:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 12:39:33,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-15 12:39:33,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:39:33,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 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-15 12:39:33,534 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 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-15 12:39:33,534 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 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-15 12:39:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:33,535 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-15 12:39:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-15 12:39:33,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:33,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:33,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:39:33,576 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:39:33,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:33,584 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-15 12:39:33,584 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-15 12:39:33,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:33,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:33,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:39:33,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:39:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 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-15 12:39:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-15 12:39:33,586 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2022-04-15 12:39:33,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:39:33,587 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-15 12:39:33,587 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 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-15 12:39:33,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-15 12:39:33,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 12:39:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:39:33,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:33,611 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:33,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2022-04-15 12:39:33,611 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:33,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1005518441, now seen corresponding path program 1 times [2022-04-15 12:39:33,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:33,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2012605498] [2022-04-15 12:39:34,285 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:39:34,288 INFO L85 PathProgramCache]: Analyzing trace with hash -719941598, now seen corresponding path program 1 times [2022-04-15 12:39:34,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:34,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905933332] [2022-04-15 12:39:34,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:34,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:34,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:39:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:34,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {368#(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(9, 2); {361#true} is VALID [2022-04-15 12:39:34,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-15 12:39:34,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {361#true} {361#true} #71#return; {361#true} is VALID [2022-04-15 12:39:34,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {368#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:39:34,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#(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(9, 2); {361#true} is VALID [2022-04-15 12:39:34,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-15 12:39:34,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #71#return; {361#true} is VALID [2022-04-15 12:39:34,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret6 := main(); {361#true} is VALID [2022-04-15 12:39:34,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {361#true} is VALID [2022-04-15 12:39:34,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {361#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {366#(<= 10 main_~n~0)} is VALID [2022-04-15 12:39:34,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {366#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {367#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-15 12:39:34,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {367#(and (<= 10 main_~n~0) (= main_~i~0 0))} [77] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_In_2 v_main_~i~0_Out_4))) (or (and (< v_main_~i~0_Out_4 (+ v_main_~n~0_In_2 1)) (= |v_main_#t~post3_Out_4| 0) (= v_main_~k~0_Out_4 1) (= |v_main_#t~post5_Out_4| 0) (= |v_main_#t~post4_Out_4| 0) (= v_main_~i~0_Out_4 0) (<= v_main_~m~0_In_2 v_main_~j~0_Out_6) .cse0 (< v_main_~j~0_Out_6 (+ v_main_~m~0_In_2 1)) (= v_main_~n~0_In_2 0) (= v_main_~j~0_Out_6 1)) (and (= v_main_~n~0_In_2 v_main_~n~0_In_2) (= v_main_~m~0_In_2 v_main_~m~0_In_2) .cse0))) InVars {main_~i~0=v_main_~i~0_In_2, main_~n~0=v_main_~n~0_In_2, main_~m~0=v_main_~m~0_In_2} OutVars{main_~m~0=v_main_~m~0_In_2, main_~k~0=v_main_~k~0_Out_4, main_~j~0=v_main_~j~0_Out_6, main_~i~0=v_main_~i~0_Out_4, main_#t~post4=|v_main_#t~post4_Out_4|, main_#t~post5=|v_main_#t~post5_Out_4|, main_#t~post3=|v_main_#t~post3_Out_4|, main_~n~0=v_main_~n~0_In_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {367#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-15 12:39:34,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {367#(and (<= 10 main_~n~0) (= main_~i~0 0))} [76] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {362#false} is VALID [2022-04-15 12:39:34,357 INFO L272 TraceCheckUtils]: 10: Hoare triple {362#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {362#false} is VALID [2022-04-15 12:39:34,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {362#false} ~cond := #in~cond; {362#false} is VALID [2022-04-15 12:39:34,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {362#false} assume 0 == ~cond; {362#false} is VALID [2022-04-15 12:39:34,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-04-15 12:39:34,358 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-15 12:39:34,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:39:34,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905933332] [2022-04-15 12:39:34,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905933332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:34,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:34,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:39:34,491 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:39:34,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2012605498] [2022-04-15 12:39:34,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2012605498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:34,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:34,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:39:34,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797908080] [2022-04-15 12:39:34,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:39:34,493 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (3), 3 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 18 [2022-04-15 12:39:34,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:39:34,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (3), 3 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-15 12:39:34,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:34,508 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:39:34,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:34,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:39:34,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:39:34,510 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (3), 3 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-15 12:39:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:34,819 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-15 12:39:34,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:39:34,819 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (3), 3 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 18 [2022-04-15 12:39:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:39:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (3), 3 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-15 12:39:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-04-15 12:39:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (3), 3 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-15 12:39:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-04-15 12:39:34,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 35 transitions. [2022-04-15 12:39:34,854 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-15 12:39:34,856 INFO L225 Difference]: With dead ends: 33 [2022-04-15 12:39:34,856 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 12:39:34,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:39:34,857 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:39:34,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 29 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:39:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 12:39:34,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-04-15 12:39:34,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:39:34,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 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-15 12:39:34,878 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 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-15 12:39:34,879 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 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-15 12:39:34,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:34,880 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-15 12:39:34,880 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-15 12:39:34,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:34,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:34,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:39:34,881 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:39:34,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:34,882 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-15 12:39:34,883 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-15 12:39:34,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:34,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:34,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:39:34,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:39:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 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-15 12:39:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 12:39:34,885 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 18 [2022-04-15 12:39:34,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:39:34,885 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 12:39:34,885 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (3), 3 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-15 12:39:34,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-15 12:39:34,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:34,917 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 12:39:34,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:39:34,917 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:34,918 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:34,918 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:39:34,918 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:34,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:34,918 INFO L85 PathProgramCache]: Analyzing trace with hash 189172661, now seen corresponding path program 2 times [2022-04-15 12:39:34,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:34,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1015536702] [2022-04-15 12:39:35,655 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:39:35,657 INFO L85 PathProgramCache]: Analyzing trace with hash -660836254, now seen corresponding path program 1 times [2022-04-15 12:39:35,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:35,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485986553] [2022-04-15 12:39:35,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:35,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:35,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:39:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:35,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {567#(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(9, 2); {560#true} is VALID [2022-04-15 12:39:35,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {560#true} assume true; {560#true} is VALID [2022-04-15 12:39:35,717 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {560#true} {560#true} #71#return; {560#true} is VALID [2022-04-15 12:39:35,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {560#true} call ULTIMATE.init(); {567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:39:35,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#(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(9, 2); {560#true} is VALID [2022-04-15 12:39:35,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {560#true} assume true; {560#true} is VALID [2022-04-15 12:39:35,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {560#true} {560#true} #71#return; {560#true} is VALID [2022-04-15 12:39:35,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {560#true} call #t~ret6 := main(); {560#true} is VALID [2022-04-15 12:39:35,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {560#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {560#true} is VALID [2022-04-15 12:39:35,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {560#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {565#(<= 10 main_~n~0)} is VALID [2022-04-15 12:39:35,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {565#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {566#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-15 12:39:35,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {566#(and (<= 10 main_~n~0) (= main_~i~0 0))} [79] L31-3-->L31-4_primed: Formula: (or (and (= v_main_~n~0_In_3 v_main_~n~0_In_3) (= v_main_~m~0_In_3 v_main_~m~0_In_3) (= v_main_~i~0_In_3 v_main_~i~0_Out_6)) (let ((.cse0 (* v_main_~i~0_Out_6 4))) (and (< v_main_~i~0_Out_6 (+ v_main_~n~0_In_3 1)) (= (* v_main_~n~0_In_3 4) 0) (= (* 2 v_main_~k~0_Out_8) 4) (< v_main_~j~0_Out_10 (+ v_main_~m~0_In_3 1)) (= (* |v_main_#t~post4_Out_8| 4) 0) (= (* |v_main_#t~post5_Out_8| 4) 0) (= .cse0 0) (= v_main_~j~0_Out_10 2) (= (* |v_main_#t~post3_Out_6| 4) 0) (= .cse0 (* v_main_~i~0_In_3 4)) (<= v_main_~m~0_In_3 v_main_~j~0_Out_10)))) InVars {main_~i~0=v_main_~i~0_In_3, main_~n~0=v_main_~n~0_In_3, main_~m~0=v_main_~m~0_In_3} OutVars{main_~m~0=v_main_~m~0_In_3, main_~k~0=v_main_~k~0_Out_8, main_~j~0=v_main_~j~0_Out_10, main_~i~0=v_main_~i~0_Out_6, main_#t~post4=|v_main_#t~post4_Out_8|, main_#t~post5=|v_main_#t~post5_Out_8|, main_#t~post3=|v_main_#t~post3_Out_6|, main_~n~0=v_main_~n~0_In_3} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {566#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-15 12:39:35,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {566#(and (<= 10 main_~n~0) (= main_~i~0 0))} [78] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {561#false} is VALID [2022-04-15 12:39:35,721 INFO L272 TraceCheckUtils]: 10: Hoare triple {561#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {561#false} is VALID [2022-04-15 12:39:35,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {561#false} ~cond := #in~cond; {561#false} is VALID [2022-04-15 12:39:35,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {561#false} assume 0 == ~cond; {561#false} is VALID [2022-04-15 12:39:35,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {561#false} assume !false; {561#false} is VALID [2022-04-15 12:39:35,722 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-15 12:39:35,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:39:35,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485986553] [2022-04-15 12:39:35,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485986553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:35,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:35,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:39:35,936 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:39:35,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1015536702] [2022-04-15 12:39:35,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1015536702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:35,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:35,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:39:35,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401563274] [2022-04-15 12:39:35,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:39:35,939 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 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-15 12:39:35,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:39:35,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 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-15 12:39:35,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:35,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:39:35,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:35,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:39:35,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:39:35,962 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 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-15 12:39:36,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:36,403 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-15 12:39:36,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:39:36,404 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 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-15 12:39:36,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:39:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 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-15 12:39:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. [2022-04-15 12:39:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 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-15 12:39:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. [2022-04-15 12:39:36,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 39 transitions. [2022-04-15 12:39:36,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:36,453 INFO L225 Difference]: With dead ends: 37 [2022-04-15 12:39:36,454 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 12:39:36,454 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:39:36,455 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:39:36,455 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 34 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:39:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 12:39:36,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2022-04-15 12:39:36,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:39:36,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 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-15 12:39:36,487 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 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-15 12:39:36,487 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 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-15 12:39:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:36,489 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 12:39:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-15 12:39:36,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:36,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:36,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 12:39:36,490 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 12:39:36,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:36,491 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 12:39:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-15 12:39:36,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:36,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:36,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:39:36,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:39:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 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-15 12:39:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-15 12:39:36,493 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2022-04-15 12:39:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:39:36,494 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-15 12:39:36,494 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 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-15 12:39:36,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-15 12:39:36,525 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-15 12:39:36,525 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 12:39:36,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:39:36,526 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:36,526 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:36,526 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 12:39:36,526 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:36,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:36,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1531053651, now seen corresponding path program 3 times [2022-04-15 12:39:36,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:36,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1212766478] [2022-04-15 12:39:37,164 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:39:37,167 INFO L85 PathProgramCache]: Analyzing trace with hash -601730910, now seen corresponding path program 1 times [2022-04-15 12:39:37,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:37,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113457138] [2022-04-15 12:39:37,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:37,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:37,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:39:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:37,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {793#(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(9, 2); {785#true} is VALID [2022-04-15 12:39:37,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {785#true} assume true; {785#true} is VALID [2022-04-15 12:39:37,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {785#true} {785#true} #71#return; {785#true} is VALID [2022-04-15 12:39:37,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {785#true} call ULTIMATE.init(); {793#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:39:37,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {793#(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(9, 2); {785#true} is VALID [2022-04-15 12:39:37,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {785#true} assume true; {785#true} is VALID [2022-04-15 12:39:37,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {785#true} {785#true} #71#return; {785#true} is VALID [2022-04-15 12:39:37,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {785#true} call #t~ret6 := main(); {785#true} is VALID [2022-04-15 12:39:37,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {785#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {785#true} is VALID [2022-04-15 12:39:37,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {785#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {790#(<= 10 main_~n~0)} is VALID [2022-04-15 12:39:37,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {791#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-15 12:39:37,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {791#(and (<= 10 main_~n~0) (= main_~i~0 0))} [81] L31-3-->L31-4_primed: Formula: (or (let ((.cse0 (* v_main_~i~0_Out_8 9))) (and (< 0 v_main_~m~0_In_4) (<= v_main_~m~0_In_4 v_main_~j~0_Out_14) (< v_main_~i~0_Out_8 (+ v_main_~n~0_In_4 1)) (< v_main_~j~0_Out_14 (+ v_main_~m~0_In_4 1)) (= (* v_main_~n~0_In_4 9) 0) (= (* |v_main_#t~post3_Out_8| 9) 0) (= v_main_~j~0_Out_14 3) (= (* 9 |v_main_#t~post4_Out_12|) 0) (= (* |v_main_#t~post5_Out_12| 9) 0) (= (* v_main_~i~0_In_4 9) .cse0) (= .cse0 0) (= (* v_main_~k~0_Out_12 3) 9))) (and (= v_main_~n~0_In_4 v_main_~n~0_In_4) (= v_main_~i~0_In_4 v_main_~i~0_Out_8) (= v_main_~m~0_In_4 v_main_~m~0_In_4))) InVars {main_~i~0=v_main_~i~0_In_4, main_~n~0=v_main_~n~0_In_4, main_~m~0=v_main_~m~0_In_4} OutVars{main_~m~0=v_main_~m~0_In_4, main_~k~0=v_main_~k~0_Out_12, main_~j~0=v_main_~j~0_Out_14, main_~i~0=v_main_~i~0_Out_8, main_#t~post4=|v_main_#t~post4_Out_12|, main_#t~post5=|v_main_#t~post5_Out_12|, main_#t~post3=|v_main_#t~post3_Out_8|, main_~n~0=v_main_~n~0_In_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {792#(<= (+ main_~i~0 10) main_~n~0)} is VALID [2022-04-15 12:39:37,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {792#(<= (+ main_~i~0 10) main_~n~0)} [80] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {786#false} is VALID [2022-04-15 12:39:37,225 INFO L272 TraceCheckUtils]: 10: Hoare triple {786#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {786#false} is VALID [2022-04-15 12:39:37,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {786#false} ~cond := #in~cond; {786#false} is VALID [2022-04-15 12:39:37,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {786#false} assume 0 == ~cond; {786#false} is VALID [2022-04-15 12:39:37,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {786#false} assume !false; {786#false} is VALID [2022-04-15 12:39:37,226 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-15 12:39:37,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:39:37,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113457138] [2022-04-15 12:39:37,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113457138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:37,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:37,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:39:37,435 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:39:37,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1212766478] [2022-04-15 12:39:37,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1212766478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:37,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:37,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:39:37,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306566419] [2022-04-15 12:39:37,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:39:37,437 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (3), 3 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 22 [2022-04-15 12:39:37,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:39:37,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (3), 3 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-15 12:39:37,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:37,457 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:39:37,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:37,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:39:37,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:39:37,458 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (3), 3 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-15 12:39:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:37,909 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-15 12:39:37,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:39:37,909 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (3), 3 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 22 [2022-04-15 12:39:37,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:39:37,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (3), 3 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-15 12:39:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 43 transitions. [2022-04-15 12:39:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (3), 3 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-15 12:39:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 43 transitions. [2022-04-15 12:39:37,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 43 transitions. [2022-04-15 12:39:37,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:37,957 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:39:37,957 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:39:37,958 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:39:37,958 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:39:37,959 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 19 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:39:37,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:39:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-04-15 12:39:37,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:39:37,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 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-15 12:39:37,995 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 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-15 12:39:37,996 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 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-15 12:39:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:37,997 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-15 12:39:37,997 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-15 12:39:37,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:37,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:37,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 12:39:37,998 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 12:39:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:37,999 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-15 12:39:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-15 12:39:38,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:38,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:38,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:39:38,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:39:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 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-15 12:39:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-15 12:39:38,001 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 22 [2022-04-15 12:39:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:39:38,001 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-15 12:39:38,002 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (3), 3 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-15 12:39:38,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-15 12:39:38,045 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-15 12:39:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-15 12:39:38,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:39:38,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:38,046 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:38,046 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 12:39:38,046 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:38,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:38,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1747345176, now seen corresponding path program 4 times [2022-04-15 12:39:38,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:38,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1272856748] [2022-04-15 12:39:38,749 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:39:38,751 INFO L85 PathProgramCache]: Analyzing trace with hash -542625566, now seen corresponding path program 1 times [2022-04-15 12:39:38,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:38,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290386412] [2022-04-15 12:39:38,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:38,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:38,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:39:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:38,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {1040#(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(9, 2); {1033#true} is VALID [2022-04-15 12:39:38,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {1033#true} assume true; {1033#true} is VALID [2022-04-15 12:39:38,832 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1033#true} {1033#true} #71#return; {1033#true} is VALID [2022-04-15 12:39:38,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {1033#true} call ULTIMATE.init(); {1040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:39:38,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {1040#(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(9, 2); {1033#true} is VALID [2022-04-15 12:39:38,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2022-04-15 12:39:38,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1033#true} #71#return; {1033#true} is VALID [2022-04-15 12:39:38,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {1033#true} call #t~ret6 := main(); {1033#true} is VALID [2022-04-15 12:39:38,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {1033#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {1033#true} is VALID [2022-04-15 12:39:38,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {1033#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {1038#(<= 10 main_~n~0)} is VALID [2022-04-15 12:39:38,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {1038#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {1039#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-15 12:39:38,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {1039#(and (<= 10 main_~n~0) (= main_~i~0 0))} [83] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_In_6 v_main_~i~0_Out_12))) (or (and .cse0 (= v_main_~n~0_In_5 v_main_~n~0_In_5) (= v_main_~m~0_In_6 v_main_~m~0_In_6)) (and (= |v_main_#t~post5_Out_16| 0) (= v_main_~n~0_In_5 0) .cse0 (<= v_main_~m~0_In_6 v_main_~j~0_Out_18) (= |v_main_#t~post4_Out_16| 0) (< v_main_~i~0_Out_12 (+ v_main_~n~0_In_5 1)) (= v_main_~k~0_Out_16 1) (= |v_main_#t~post3_Out_12| 0) (= v_main_~j~0_Out_18 1) (< v_main_~j~0_Out_18 (+ v_main_~m~0_In_6 1)) (= v_main_~i~0_Out_12 0)))) InVars {main_~i~0=v_main_~i~0_In_6, main_~n~0=v_main_~n~0_In_5, main_~m~0=v_main_~m~0_In_6} OutVars{main_~m~0=v_main_~m~0_In_6, main_~k~0=v_main_~k~0_Out_16, main_~j~0=v_main_~j~0_Out_18, main_~i~0=v_main_~i~0_Out_12, main_#t~post4=|v_main_#t~post4_Out_16|, main_#t~post5=|v_main_#t~post5_Out_16|, main_#t~post3=|v_main_#t~post3_Out_12|, main_~n~0=v_main_~n~0_In_5} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {1039#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-15 12:39:38,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {1039#(and (<= 10 main_~n~0) (= main_~i~0 0))} [82] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1034#false} is VALID [2022-04-15 12:39:38,837 INFO L272 TraceCheckUtils]: 10: Hoare triple {1034#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {1034#false} is VALID [2022-04-15 12:39:38,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {1034#false} ~cond := #in~cond; {1034#false} is VALID [2022-04-15 12:39:38,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {1034#false} assume 0 == ~cond; {1034#false} is VALID [2022-04-15 12:39:38,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {1034#false} assume !false; {1034#false} is VALID [2022-04-15 12:39:38,838 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-15 12:39:38,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:39:38,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290386412] [2022-04-15 12:39:38,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290386412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:38,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:38,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:39:39,048 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:39:39,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1272856748] [2022-04-15 12:39:39,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1272856748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:39,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:39,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:39:39,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072871643] [2022-04-15 12:39:39,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:39:39,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 3 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 23 [2022-04-15 12:39:39,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:39:39,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 3 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-15 12:39:39,069 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-15 12:39:39,069 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:39:39,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:39,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:39:39,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:39:39,070 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 3 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-15 12:39:39,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:39,464 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-15 12:39:39,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:39:39,465 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 3 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 23 [2022-04-15 12:39:39,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:39:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 3 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-15 12:39:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2022-04-15 12:39:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 3 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-15 12:39:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2022-04-15 12:39:39,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 47 transitions. [2022-04-15 12:39:39,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:39,508 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:39:39,508 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 12:39:39,509 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:39:39,509 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:39:39,510 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 34 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:39:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 12:39:39,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2022-04-15 12:39:39,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:39:39,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 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-15 12:39:39,560 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 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-15 12:39:39,560 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 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-15 12:39:39,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:39,561 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-15 12:39:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-15 12:39:39,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:39,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:39,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 12:39:39,562 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 12:39:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:39,563 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-15 12:39:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-15 12:39:39,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:39,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:39,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:39:39,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:39:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 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-15 12:39:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-15 12:39:39,565 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 23 [2022-04-15 12:39:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:39:39,565 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-15 12:39:39,565 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 3 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-15 12:39:39,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2022-04-15 12:39:39,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:39,614 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 12:39:39,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:39:39,615 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:39,615 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:39,616 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 12:39:39,616 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:39,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:39,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1706471055, now seen corresponding path program 5 times [2022-04-15 12:39:39,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:39,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1566609251] [2022-04-15 12:39:40,194 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:39:40,198 INFO L85 PathProgramCache]: Analyzing trace with hash -483520222, now seen corresponding path program 1 times [2022-04-15 12:39:40,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:40,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212751740] [2022-04-15 12:39:40,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:40,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:40,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:39:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:40,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {1313#(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(9, 2); {1306#true} is VALID [2022-04-15 12:39:40,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 12:39:40,299 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1306#true} {1306#true} #71#return; {1306#true} is VALID [2022-04-15 12:39:40,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:39:40,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {1313#(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(9, 2); {1306#true} is VALID [2022-04-15 12:39:40,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 12:39:40,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #71#return; {1306#true} is VALID [2022-04-15 12:39:40,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret6 := main(); {1306#true} is VALID [2022-04-15 12:39:40,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {1306#true} is VALID [2022-04-15 12:39:40,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {1306#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {1311#(<= 10 main_~n~0)} is VALID [2022-04-15 12:39:40,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {1311#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {1312#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-15 12:39:40,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {1312#(and (<= 10 main_~n~0) (= main_~i~0 0))} [85] L31-3-->L31-4_primed: Formula: (or (and (= v_main_~n~0_In_6 v_main_~n~0_In_6) (= v_main_~m~0_In_7 v_main_~m~0_In_7) (= v_main_~i~0_In_7 v_main_~i~0_Out_14)) (let ((.cse0 (* v_main_~i~0_Out_14 16))) (and (= (* v_main_~k~0_Out_20 4) 16) (= 0 (* 16 |v_main_#t~post4_Out_20|)) (= (* 16 |v_main_#t~post3_Out_14|) 0) (< 2 v_main_~m~0_In_7) (< v_main_~i~0_Out_14 (+ v_main_~n~0_In_6 1)) (= (* v_main_~n~0_In_6 16) 0) (<= v_main_~m~0_In_7 v_main_~j~0_Out_22) (= (* |v_main_#t~post5_Out_20| 16) 0) (< v_main_~j~0_Out_22 (+ v_main_~m~0_In_7 1)) (= v_main_~j~0_Out_22 4) (= (* v_main_~i~0_In_7 16) .cse0) (= .cse0 0)))) InVars {main_~i~0=v_main_~i~0_In_7, main_~n~0=v_main_~n~0_In_6, main_~m~0=v_main_~m~0_In_7} OutVars{main_~m~0=v_main_~m~0_In_7, main_~k~0=v_main_~k~0_Out_20, main_~j~0=v_main_~j~0_Out_22, main_~i~0=v_main_~i~0_Out_14, main_#t~post4=|v_main_#t~post4_Out_20|, main_#t~post5=|v_main_#t~post5_Out_20|, main_#t~post3=|v_main_#t~post3_Out_14|, main_~n~0=v_main_~n~0_In_6} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {1312#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-15 12:39:40,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {1312#(and (<= 10 main_~n~0) (= main_~i~0 0))} [84] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1307#false} is VALID [2022-04-15 12:39:40,305 INFO L272 TraceCheckUtils]: 10: Hoare triple {1307#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {1307#false} is VALID [2022-04-15 12:39:40,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-15 12:39:40,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-15 12:39:40,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-15 12:39:40,308 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-15 12:39:40,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:39:40,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212751740] [2022-04-15 12:39:40,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212751740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:40,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:40,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:39:40,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:39:40,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1566609251] [2022-04-15 12:39:40,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1566609251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:40,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:40,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:39:40,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426339426] [2022-04-15 12:39:40,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:39:40,602 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (3), 3 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 24 [2022-04-15 12:39:40,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:39:40,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (3), 3 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-15 12:39:40,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:40,621 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:39:40,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:40,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:39:40,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:39:40,622 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (3), 3 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-15 12:39:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:41,195 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-15 12:39:41,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:39:41,196 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (3), 3 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 24 [2022-04-15 12:39:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:39:41,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (3), 3 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-15 12:39:41,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 47 transitions. [2022-04-15 12:39:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (3), 3 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-15 12:39:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 47 transitions. [2022-04-15 12:39:41,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 47 transitions. [2022-04-15 12:39:41,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:41,252 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:39:41,253 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 12:39:41,254 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:39:41,257 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:39:41,257 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 19 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:39:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 12:39:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2022-04-15 12:39:41,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:39:41,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 35 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 3 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-15 12:39:41,320 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 35 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 3 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-15 12:39:41,321 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 35 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 3 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-15 12:39:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:41,322 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-15 12:39:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-15 12:39:41,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:41,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:41,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 12:39:41,323 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 12:39:41,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:41,324 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-15 12:39:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-15 12:39:41,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:41,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:41,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:39:41,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:39:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 3 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-15 12:39:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-04-15 12:39:41,326 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 24 [2022-04-15 12:39:41,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:39:41,326 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-04-15 12:39:41,326 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (3), 3 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-15 12:39:41,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 40 transitions. [2022-04-15 12:39:41,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-15 12:39:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:39:41,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:41,375 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:41,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 12:39:41,375 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:41,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:41,376 INFO L85 PathProgramCache]: Analyzing trace with hash 968604042, now seen corresponding path program 6 times [2022-04-15 12:39:41,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:41,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1997553852] [2022-04-15 12:39:42,357 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.pushout(QvasrAbstractionJoin.java:181) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.join(QvasrAbstractionJoin.java:116) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.summarizeLoop(QvasrSummarizer.java:130) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrLoopSummarization.getQvasrAcceleration(QvasrLoopSummarization.java:87) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorQvasr.accelerateLoop(AcceleratorQvasr.java:91) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 12:39:42,360 INFO L158 Benchmark]: Toolchain (without parser) took 10917.67ms. Allocated memory was 174.1MB in the beginning and 251.7MB in the end (delta: 77.6MB). Free memory was 122.0MB in the beginning and 210.4MB in the end (delta: -88.5MB). Peak memory consumption was 114.8MB. Max. memory is 8.0GB. [2022-04-15 12:39:42,361 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 174.1MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:39:42,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.31ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 121.7MB in the beginning and 187.8MB in the end (delta: -66.1MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-04-15 12:39:42,361 INFO L158 Benchmark]: Boogie Preprocessor took 40.83ms. Allocated memory is still 209.7MB. Free memory was 187.8MB in the beginning and 186.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 12:39:42,361 INFO L158 Benchmark]: RCFGBuilder took 426.92ms. Allocated memory is still 209.7MB. Free memory was 186.2MB in the beginning and 173.1MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 12:39:42,361 INFO L158 Benchmark]: TraceAbstraction took 10214.42ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 172.6MB in the beginning and 210.4MB in the end (delta: -37.8MB). Peak memory consumption was 130.3MB. Max. memory is 8.0GB. [2022-04-15 12:39:42,363 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.17ms. Allocated memory is still 174.1MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.31ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 121.7MB in the beginning and 187.8MB in the end (delta: -66.1MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.83ms. Allocated memory is still 209.7MB. Free memory was 187.8MB in the beginning and 186.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 426.92ms. Allocated memory is still 209.7MB. Free memory was 186.2MB in the beginning and 173.1MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 10214.42ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 172.6MB in the beginning and 210.4MB in the end (delta: -37.8MB). Peak memory consumption was 130.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0: de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:39:42,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...