/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/verifythis/elimination_max.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:38:01,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:38:01,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:38:01,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:38:01,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:38:01,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:38:01,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:38:01,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:38:01,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:38:01,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:38:01,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:38:01,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:38:01,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:38:01,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:38:01,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:38:01,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:38:01,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:38:01,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:38:01,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:38:01,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:38:01,390 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:38:01,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:38:01,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:38:01,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:38:01,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:38:01,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:38:01,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:38:01,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:38:01,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:38:01,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:38:01,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:38:01,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:38:01,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:38:01,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:38:01,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:38:01,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:38:01,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:38:01,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:38:01,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:38:01,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:38:01,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:38:01,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:38:01,412 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:38:01,419 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:38:01,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:38:01,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:38:01,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:38:01,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:38:01,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:38:01,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:38:01,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:38:01,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:38:01,422 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:38:01,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:38:01,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:38:01,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:38:01,422 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:38:01,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:38:01,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:38:01,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:38:01,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:38:01,423 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:38:01,423 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:38:01,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:38:01,423 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:38:01,424 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-08 10:38:01,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:38:01,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:38:01,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:38:01,651 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:38:01,652 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:38:01,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max.c [2022-04-08 10:38:01,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b723dae25/101cc2b766784cf3b076d996f9faa8e8/FLAGcf8a420b6 [2022-04-08 10:38:02,007 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:38:02,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max.c [2022-04-08 10:38:02,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b723dae25/101cc2b766784cf3b076d996f9faa8e8/FLAGcf8a420b6 [2022-04-08 10:38:02,431 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b723dae25/101cc2b766784cf3b076d996f9faa8e8 [2022-04-08 10:38:02,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:38:02,437 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:38:02,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:38:02,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:38:02,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:38:02,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:38:02" (1/1) ... [2022-04-08 10:38:02,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50cc77d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:38:02, skipping insertion in model container [2022-04-08 10:38:02,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:38:02" (1/1) ... [2022-04-08 10:38:02,446 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:38:02,456 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:38:02,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max.c[485,498] [2022-04-08 10:38:02,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:38:02,589 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:38:02,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max.c[485,498] [2022-04-08 10:38:02,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:38:02,612 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:38:02,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:38:02 WrapperNode [2022-04-08 10:38:02,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:38:02,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:38:02,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:38:02,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:38:02,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:38:02" (1/1) ... [2022-04-08 10:38:02,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:38:02" (1/1) ... [2022-04-08 10:38:02,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:38:02" (1/1) ... [2022-04-08 10:38:02,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:38:02" (1/1) ... [2022-04-08 10:38:02,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:38:02" (1/1) ... [2022-04-08 10:38:02,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:38:02" (1/1) ... [2022-04-08 10:38:02,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:38:02" (1/1) ... [2022-04-08 10:38:02,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:38:02,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:38:02,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:38:02,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:38:02,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:38:02" (1/1) ... [2022-04-08 10:38:02,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:38:02,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:38:02,656 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-08 10:38:02,657 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-08 10:38:02,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:38:02,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:38:02,682 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:38:02,682 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:38:02,682 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:38:02,683 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:38:02,683 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 10:38:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 10:38:02,684 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-08 10:38:02,684 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:38:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:38:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:38:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:38:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:38:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:38:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 10:38:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:38:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 10:38:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 10:38:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:38:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:38:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:38:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:38:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:38:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:38:02,737 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:38:02,738 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:38:02,937 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:38:02,942 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:38:02,942 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 10:38:02,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:38:02 BoogieIcfgContainer [2022-04-08 10:38:02,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:38:02,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:38:02,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:38:02,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:38:02,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:38:02" (1/3) ... [2022-04-08 10:38:02,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f659a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:38:02, skipping insertion in model container [2022-04-08 10:38:02,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:38:02" (2/3) ... [2022-04-08 10:38:02,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f659a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:38:02, skipping insertion in model container [2022-04-08 10:38:02,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:38:02" (3/3) ... [2022-04-08 10:38:02,958 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2022-04-08 10:38:02,963 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:38:02,963 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:38:02,990 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:38:02,994 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-08 10:38:02,994 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:38:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 10:38:03,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:38:03,024 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:38:03,024 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:38:03,025 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:38:03,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:38:03,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1951153279, now seen corresponding path program 1 times [2022-04-08 10:38:03,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:38:03,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [326813870] [2022-04-08 10:38:03,041 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:38:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1951153279, now seen corresponding path program 2 times [2022-04-08 10:38:03,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:38:03,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806781421] [2022-04-08 10:38:03,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:38:03,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:38:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:03,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:38:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:03,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(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(18, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-08 10:38:03,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 10:38:03,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #83#return; {42#true} is VALID [2022-04-08 10:38:03,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 10:38:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:03,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 10:38:03,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 10:38:03,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 10:38:03,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #73#return; {43#false} is VALID [2022-04-08 10:38:03,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 10:38:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:03,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {59#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {42#true} is VALID [2022-04-08 10:38:03,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 10:38:03,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {43#false} #75#return; {43#false} is VALID [2022-04-08 10:38:03,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-08 10:38:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:03,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 10:38:03,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 10:38:03,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 10:38:03,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #77#return; {43#false} is VALID [2022-04-08 10:38:03,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:38:03,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(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(18, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-08 10:38:03,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 10:38:03,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #83#return; {42#true} is VALID [2022-04-08 10:38:03,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret17 := main(); {42#true} is VALID [2022-04-08 10:38:03,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~n~0 := #t~nondet5;havoc #t~nondet5; {42#true} is VALID [2022-04-08 10:38:03,257 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {42#true} is VALID [2022-04-08 10:38:03,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 10:38:03,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 10:38:03,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 10:38:03,259 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #73#return; {43#false} is VALID [2022-04-08 10:38:03,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4 * ~n~0); {43#false} is VALID [2022-04-08 10:38:03,259 INFO L272 TraceCheckUtils]: 12: Hoare triple {43#false} call #Ultimate.meminit(#t~malloc6.base, #t~malloc6.offset, ~n~0, 4, 4 * ~n~0); {59#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-08 10:38:03,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {42#true} is VALID [2022-04-08 10:38:03,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 10:38:03,260 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#true} {43#false} #75#return; {43#false} is VALID [2022-04-08 10:38:03,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} ~a~0.base, ~a~0.offset := #t~malloc6.base, #t~malloc6.offset;~x~0 := 0;~y~0 := ~n~0 - 1; {43#false} is VALID [2022-04-08 10:38:03,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !(~x~0 < ~y~0); {43#false} is VALID [2022-04-08 10:38:03,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#false} havoc ~i~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~i~0 := #t~nondet11;havoc #t~nondet11; {43#false} is VALID [2022-04-08 10:38:03,260 INFO L272 TraceCheckUtils]: 19: Hoare triple {43#false} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n~0 then 1 else 0)); {42#true} is VALID [2022-04-08 10:38:03,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 10:38:03,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 10:38:03,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 10:38:03,262 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43#false} {43#false} #77#return; {43#false} is VALID [2022-04-08 10:38:03,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#false} call #t~mem12 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~a~0.base, ~a~0.offset + 4 * ~x~0, 4); {43#false} is VALID [2022-04-08 10:38:03,263 INFO L272 TraceCheckUtils]: 25: Hoare triple {43#false} call __VERIFIER_assert((if #t~mem12 <= #t~mem13 then 1 else 0)); {43#false} is VALID [2022-04-08 10:38:03,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-08 10:38:03,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-08 10:38:03,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-08 10:38:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:38:03,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:38:03,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806781421] [2022-04-08 10:38:03,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806781421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:38:03,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:38:03,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:38:03,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:38:03,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [326813870] [2022-04-08 10:38:03,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [326813870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:38:03,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:38:03,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:38:03,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629992038] [2022-04-08 10:38:03,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:38:03,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 10:38:03,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:38:03,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:38:03,319 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-08 10:38:03,319 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:38:03,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:38:03,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:38:03,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 10:38:03,342 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:38:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:38:03,576 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-08 10:38:03,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:38:03,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 10:38:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:38:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:38:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-04-08 10:38:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:38:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-04-08 10:38:03,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 90 transitions. [2022-04-08 10:38:03,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:38:03,681 INFO L225 Difference]: With dead ends: 71 [2022-04-08 10:38:03,681 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 10:38:03,684 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:38:03,687 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 36 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:38:03,687 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 38 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:38:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 10:38:03,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 10:38:03,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:38:03,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:38:03,713 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:38:03,714 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:38:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:38:03,731 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 10:38:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 10:38:03,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:38:03,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:38:03,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-08 10:38:03,732 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-08 10:38:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:38:03,739 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 10:38:03,740 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 10:38:03,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:38:03,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:38:03,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:38:03,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:38:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:38:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-08 10:38:03,749 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 29 [2022-04-08 10:38:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:38:03,749 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-08 10:38:03,750 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:38:03,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-08 10:38:03,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:38:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 10:38:03,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:38:03,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:38:03,814 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:38:03,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:38:03,815 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:38:03,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:38:03,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1957169217, now seen corresponding path program 1 times [2022-04-08 10:38:03,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:38:03,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1267064444] [2022-04-08 10:38:03,817 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:38:03,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1957169217, now seen corresponding path program 2 times [2022-04-08 10:38:03,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:38:03,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97876410] [2022-04-08 10:38:03,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:38:03,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:38:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:03,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:38:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:03,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#(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(18, 2);call #Ultimate.allocInit(12, 3); {343#true} is VALID [2022-04-08 10:38:03,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#true} assume true; {343#true} is VALID [2022-04-08 10:38:03,986 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {343#true} {343#true} #83#return; {343#true} is VALID [2022-04-08 10:38:03,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 10:38:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:03,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {343#true} ~cond := #in~cond; {343#true} is VALID [2022-04-08 10:38:03,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#true} assume !(0 == ~cond); {343#true} is VALID [2022-04-08 10:38:04,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {343#true} assume true; {343#true} is VALID [2022-04-08 10:38:04,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {343#true} {343#true} #73#return; {343#true} is VALID [2022-04-08 10:38:04,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 10:38:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:04,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {366#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {367#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-08 10:38:04,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {367#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-08 10:38:04,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {367#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {343#true} #75#return; {355#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} is VALID [2022-04-08 10:38:04,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-08 10:38:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:04,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {343#true} ~cond := #in~cond; {343#true} is VALID [2022-04-08 10:38:04,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#true} assume !(0 == ~cond); {343#true} is VALID [2022-04-08 10:38:04,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {343#true} assume true; {343#true} is VALID [2022-04-08 10:38:04,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {343#true} {357#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} #77#return; {357#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-08 10:38:04,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {343#true} call ULTIMATE.init(); {365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:38:04,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#(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(18, 2);call #Ultimate.allocInit(12, 3); {343#true} is VALID [2022-04-08 10:38:04,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {343#true} assume true; {343#true} is VALID [2022-04-08 10:38:04,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {343#true} {343#true} #83#return; {343#true} is VALID [2022-04-08 10:38:04,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {343#true} call #t~ret17 := main(); {343#true} is VALID [2022-04-08 10:38:04,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {343#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~n~0 := #t~nondet5;havoc #t~nondet5; {343#true} is VALID [2022-04-08 10:38:04,066 INFO L272 TraceCheckUtils]: 6: Hoare triple {343#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {343#true} is VALID [2022-04-08 10:38:04,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {343#true} ~cond := #in~cond; {343#true} is VALID [2022-04-08 10:38:04,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {343#true} assume !(0 == ~cond); {343#true} is VALID [2022-04-08 10:38:04,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {343#true} assume true; {343#true} is VALID [2022-04-08 10:38:04,066 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {343#true} {343#true} #73#return; {343#true} is VALID [2022-04-08 10:38:04,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {343#true} call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4 * ~n~0); {343#true} is VALID [2022-04-08 10:38:04,068 INFO L272 TraceCheckUtils]: 12: Hoare triple {343#true} call #Ultimate.meminit(#t~malloc6.base, #t~malloc6.offset, ~n~0, 4, 4 * ~n~0); {366#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-08 10:38:04,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {366#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {367#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-08 10:38:04,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {367#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {367#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-08 10:38:04,070 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {367#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {343#true} #75#return; {355#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} is VALID [2022-04-08 10:38:04,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {355#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} ~a~0.base, ~a~0.offset := #t~malloc6.base, #t~malloc6.offset;~x~0 := 0;~y~0 := ~n~0 - 1; {356#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-08 10:38:04,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {356#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} assume !(~x~0 < ~y~0); {356#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-08 10:38:04,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {356#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} havoc ~i~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~i~0 := #t~nondet11;havoc #t~nondet11; {357#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-08 10:38:04,073 INFO L272 TraceCheckUtils]: 19: Hoare triple {357#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n~0 then 1 else 0)); {343#true} is VALID [2022-04-08 10:38:04,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {343#true} ~cond := #in~cond; {343#true} is VALID [2022-04-08 10:38:04,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {343#true} assume !(0 == ~cond); {343#true} is VALID [2022-04-08 10:38:04,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {343#true} assume true; {343#true} is VALID [2022-04-08 10:38:04,074 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {343#true} {357#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} #77#return; {357#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-08 10:38:04,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {357#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} call #t~mem12 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~a~0.base, ~a~0.offset + 4 * ~x~0, 4); {362#(and (= |main_#t~mem12| 0) (= |main_#t~mem13| 0))} is VALID [2022-04-08 10:38:04,076 INFO L272 TraceCheckUtils]: 25: Hoare triple {362#(and (= |main_#t~mem12| 0) (= |main_#t~mem13| 0))} call __VERIFIER_assert((if #t~mem12 <= #t~mem13 then 1 else 0)); {363#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:38:04,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {363#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {364#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:38:04,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {364#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {344#false} is VALID [2022-04-08 10:38:04,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {344#false} assume !false; {344#false} is VALID [2022-04-08 10:38:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:38:04,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:38:04,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97876410] [2022-04-08 10:38:04,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97876410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:38:04,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:38:04,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:38:04,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:38:04,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1267064444] [2022-04-08 10:38:04,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1267064444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:38:04,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:38:04,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:38:04,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121077021] [2022-04-08 10:38:04,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:38:04,082 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 10:38:04,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:38:04,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:38:04,104 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-08 10:38:04,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:38:04,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:38:04,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:38:04,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:38:04,107 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:38:04,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:38:04,750 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-08 10:38:04,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:38:04,750 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 10:38:04,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:38:04,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:38:04,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2022-04-08 10:38:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:38:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2022-04-08 10:38:04,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 43 transitions. [2022-04-08 10:38:04,790 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-08 10:38:04,792 INFO L225 Difference]: With dead ends: 40 [2022-04-08 10:38:04,792 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 10:38:04,792 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:38:04,793 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 66 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:38:04,793 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 39 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:38:04,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 10:38:04,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 10:38:04,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:38:04,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:38:04,799 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:38:04,799 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:38:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:38:04,801 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 10:38:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 10:38:04,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:38:04,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:38:04,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-08 10:38:04,802 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-08 10:38:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:38:04,804 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 10:38:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 10:38:04,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:38:04,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:38:04,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:38:04,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:38:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:38:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-08 10:38:04,806 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 29 [2022-04-08 10:38:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:38:04,806 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-08 10:38:04,806 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:38:04,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-08 10:38:04,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:38:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 10:38:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:38:04,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:38:04,845 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:38:04,845 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 10:38:04,846 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:38:04,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:38:04,846 INFO L85 PathProgramCache]: Analyzing trace with hash -718145150, now seen corresponding path program 1 times [2022-04-08 10:38:04,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:38:04,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [774489873] [2022-04-08 10:38:04,847 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:38:04,847 INFO L85 PathProgramCache]: Analyzing trace with hash -718145150, now seen corresponding path program 2 times [2022-04-08 10:38:04,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:38:04,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623101109] [2022-04-08 10:38:04,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:38:04,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:38:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:04,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:38:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:04,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {646#(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(18, 2);call #Ultimate.allocInit(12, 3); {619#true} is VALID [2022-04-08 10:38:04,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-08 10:38:04,988 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {619#true} {619#true} #83#return; {619#true} is VALID [2022-04-08 10:38:04,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 10:38:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:04,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {619#true} ~cond := #in~cond; {619#true} is VALID [2022-04-08 10:38:04,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#true} assume !(0 == ~cond); {619#true} is VALID [2022-04-08 10:38:04,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-08 10:38:04,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {619#true} #73#return; {619#true} is VALID [2022-04-08 10:38:05,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 10:38:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:05,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {647#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {648#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-08 10:38:05,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {648#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {648#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-08 10:38:05,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {648#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {619#true} #75#return; {631#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} is VALID [2022-04-08 10:38:05,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-08 10:38:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:05,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {619#true} ~cond := #in~cond; {619#true} is VALID [2022-04-08 10:38:05,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#true} assume !(0 == ~cond); {619#true} is VALID [2022-04-08 10:38:05,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-08 10:38:05,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {632#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} #77#return; {632#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-08 10:38:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-08 10:38:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:05,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {619#true} ~cond := #in~cond; {619#true} is VALID [2022-04-08 10:38:05,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#true} assume !(0 == ~cond); {619#true} is VALID [2022-04-08 10:38:05,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-08 10:38:05,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {637#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= |main_#t~mem13| 0))} #79#return; {632#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-08 10:38:05,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {619#true} call ULTIMATE.init(); {646#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:38:05,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {646#(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(18, 2);call #Ultimate.allocInit(12, 3); {619#true} is VALID [2022-04-08 10:38:05,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-08 10:38:05,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {619#true} #83#return; {619#true} is VALID [2022-04-08 10:38:05,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {619#true} call #t~ret17 := main(); {619#true} is VALID [2022-04-08 10:38:05,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {619#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~n~0 := #t~nondet5;havoc #t~nondet5; {619#true} is VALID [2022-04-08 10:38:05,058 INFO L272 TraceCheckUtils]: 6: Hoare triple {619#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {619#true} is VALID [2022-04-08 10:38:05,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {619#true} ~cond := #in~cond; {619#true} is VALID [2022-04-08 10:38:05,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {619#true} assume !(0 == ~cond); {619#true} is VALID [2022-04-08 10:38:05,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-08 10:38:05,058 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {619#true} {619#true} #73#return; {619#true} is VALID [2022-04-08 10:38:05,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {619#true} call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4 * ~n~0); {619#true} is VALID [2022-04-08 10:38:05,060 INFO L272 TraceCheckUtils]: 12: Hoare triple {619#true} call #Ultimate.meminit(#t~malloc6.base, #t~malloc6.offset, ~n~0, 4, 4 * ~n~0); {647#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-08 10:38:05,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {647#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {648#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-08 10:38:05,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {648#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {648#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-08 10:38:05,063 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {648#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {619#true} #75#return; {631#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} is VALID [2022-04-08 10:38:05,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {631#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} ~a~0.base, ~a~0.offset := #t~malloc6.base, #t~malloc6.offset;~x~0 := 0;~y~0 := ~n~0 - 1; {632#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-08 10:38:05,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {632#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} assume !(~x~0 < ~y~0); {632#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-08 10:38:05,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {632#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} havoc ~i~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~i~0 := #t~nondet11;havoc #t~nondet11; {632#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-08 10:38:05,079 INFO L272 TraceCheckUtils]: 19: Hoare triple {632#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n~0 then 1 else 0)); {619#true} is VALID [2022-04-08 10:38:05,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {619#true} ~cond := #in~cond; {619#true} is VALID [2022-04-08 10:38:05,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {619#true} assume !(0 == ~cond); {619#true} is VALID [2022-04-08 10:38:05,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-08 10:38:05,081 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {619#true} {632#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} #77#return; {632#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-08 10:38:05,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {632#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} call #t~mem12 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~a~0.base, ~a~0.offset + 4 * ~x~0, 4); {637#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= |main_#t~mem13| 0))} is VALID [2022-04-08 10:38:05,081 INFO L272 TraceCheckUtils]: 25: Hoare triple {637#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= |main_#t~mem13| 0))} call __VERIFIER_assert((if #t~mem12 <= #t~mem13 then 1 else 0)); {619#true} is VALID [2022-04-08 10:38:05,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {619#true} ~cond := #in~cond; {619#true} is VALID [2022-04-08 10:38:05,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {619#true} assume !(0 == ~cond); {619#true} is VALID [2022-04-08 10:38:05,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-08 10:38:05,083 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {619#true} {637#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= |main_#t~mem13| 0))} #79#return; {632#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-08 10:38:05,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {632#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} havoc #t~mem12;havoc #t~mem13;~i~0 := 0; {642#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0) (<= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4)))))} is VALID [2022-04-08 10:38:05,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {642#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0) (<= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4)))))} assume !!(~i~0 < ~n~0);call #t~mem15 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call #t~mem16 := read~int(~a~0.base, ~a~0.offset + 4 * ~x~0, 4); {643#(and (= |main_#t~mem15| 0) (<= 0 |main_#t~mem16|))} is VALID [2022-04-08 10:38:05,084 INFO L272 TraceCheckUtils]: 32: Hoare triple {643#(and (= |main_#t~mem15| 0) (<= 0 |main_#t~mem16|))} call __VERIFIER_assert((if #t~mem15 <= #t~mem16 then 1 else 0)); {644#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:38:05,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {644#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {645#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:38:05,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {645#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {620#false} is VALID [2022-04-08 10:38:05,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {620#false} assume !false; {620#false} is VALID [2022-04-08 10:38:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:38:05,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:38:05,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623101109] [2022-04-08 10:38:05,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623101109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:38:05,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:38:05,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:38:05,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:38:05,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [774489873] [2022-04-08 10:38:05,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [774489873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:38:05,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:38:05,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:38:05,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376790381] [2022-04-08 10:38:05,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:38:05,090 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-08 10:38:05,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:38:05,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 10:38:05,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:38:05,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:38:05,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:38:05,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:38:05,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:38:05,118 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 10:38:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:38:05,743 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 10:38:05,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:38:05,743 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-08 10:38:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:38:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 10:38:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2022-04-08 10:38:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 10:38:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2022-04-08 10:38:05,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2022-04-08 10:38:05,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:38:05,782 INFO L225 Difference]: With dead ends: 38 [2022-04-08 10:38:05,782 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 10:38:05,783 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:38:05,783 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 54 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:38:05,784 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 40 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:38:05,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 10:38:05,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 10:38:05,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:38:05,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 10:38:05,784 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 10:38:05,785 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 10:38:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:38:05,785 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:38:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:38:05,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:38:05,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:38:05,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 10:38:05,785 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 10:38:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:38:05,785 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:38:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:38:05,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:38:05,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:38:05,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:38:05,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:38:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 10:38:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 10:38:05,786 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-04-08 10:38:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:38:05,786 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 10:38:05,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 10:38:05,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 10:38:05,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:38:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:38:05,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:38:05,788 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 10:38:05,788 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 10:38:05,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 10:38:05,916 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-08 10:38:05,916 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-08 10:38:05,916 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-08 10:38:05,916 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-04-08 10:38:05,916 INFO L885 garLoopResultBuilder]: At program point L8(line 8) the Hoare annotation is: true [2022-04-08 10:38:05,916 INFO L885 garLoopResultBuilder]: At program point L8-2(lines 7 9) the Hoare annotation is: true [2022-04-08 10:38:05,916 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 7 9) the Hoare annotation is: true [2022-04-08 10:38:05,917 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 25 37) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)))) [2022-04-08 10:38:05,917 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 16 51) the Hoare annotation is: true [2022-04-08 10:38:05,917 INFO L878 garLoopResultBuilder]: At program point L25-2(lines 25 37) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)))) [2022-04-08 10:38:05,917 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-08 10:38:05,917 INFO L878 garLoopResultBuilder]: At program point L19-1(line 19) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-08 10:38:05,917 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= |main_#t~mem15| 0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)) (<= 0 |main_#t~mem16|))) [2022-04-08 10:38:05,917 INFO L878 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= |main_#t~mem15| 0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)) (<= 0 |main_#t~mem16|))) [2022-04-08 10:38:05,917 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 16 51) the Hoare annotation is: true [2022-04-08 10:38:05,917 INFO L878 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)))) [2022-04-08 10:38:05,917 INFO L878 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)))) [2022-04-08 10:38:05,917 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 16 51) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-08 10:38:05,917 INFO L878 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-08 10:38:05,917 INFO L878 garLoopResultBuilder]: At program point L20-1(line 20) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|)) [2022-04-08 10:38:05,918 INFO L878 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem12| 0) (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)) (= |main_#t~mem13| 0))) [2022-04-08 10:38:05,918 INFO L878 garLoopResultBuilder]: At program point L45-2(lines 45 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)))) [2022-04-08 10:38:05,918 INFO L878 garLoopResultBuilder]: At program point L43-1(line 43) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem12| 0) (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)) (= |main_#t~mem13| 0))) [2022-04-08 10:38:05,918 INFO L878 garLoopResultBuilder]: At program point L45-3(lines 45 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)))) [2022-04-08 10:38:05,918 INFO L885 garLoopResultBuilder]: At program point L45-4(lines 45 47) the Hoare annotation is: true [2022-04-08 10:38:05,918 INFO L878 garLoopResultBuilder]: At program point L35(lines 35 36) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)))) [2022-04-08 10:38:05,918 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:38:05,918 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 10:38:05,918 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:38:05,918 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:38:05,918 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 10:38:05,918 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 10:38:05,918 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:38:05,918 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2022-04-08 10:38:05,919 INFO L878 garLoopResultBuilder]: At program point L11(line 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 10:38:05,919 INFO L878 garLoopResultBuilder]: At program point L11-1(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 10:38:05,919 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 10:38:05,919 INFO L878 garLoopResultBuilder]: At program point L11-3(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 10:38:05,919 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 10:38:05,919 INFO L878 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-08 10:38:05,919 INFO L878 garLoopResultBuilder]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2022-04-08 10:38:05,919 INFO L878 garLoopResultBuilder]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2022-04-08 10:38:05,921 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-08 10:38:05,922 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 10:38:05,924 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 10:38:05,926 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 10:38:05,936 INFO L163 areAnnotationChecker]: CFG has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 10:38:05,939 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:262) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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-08 10:38:05,942 INFO L158 Benchmark]: Toolchain (without parser) took 3504.87ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 151.4MB in the beginning and 149.8MB in the end (delta: 1.6MB). Peak memory consumption was 43.6MB. Max. memory is 8.0GB. [2022-04-08 10:38:05,942 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 200.3MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 10:38:05,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.53ms. Allocated memory is still 200.3MB. Free memory was 151.1MB in the beginning and 175.6MB in the end (delta: -24.5MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-08 10:38:05,942 INFO L158 Benchmark]: Boogie Preprocessor took 21.50ms. Allocated memory is still 200.3MB. Free memory was 175.1MB in the beginning and 173.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 10:38:05,943 INFO L158 Benchmark]: RCFGBuilder took 308.85ms. Allocated memory is still 200.3MB. Free memory was 173.6MB in the beginning and 159.9MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-08 10:38:05,943 INFO L158 Benchmark]: TraceAbstraction took 2996.37ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 159.4MB in the beginning and 149.8MB in the end (delta: 9.6MB). Peak memory consumption was 51.5MB. Max. memory is 8.0GB. [2022-04-08 10:38:05,944 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.14ms. Allocated memory is still 200.3MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.53ms. Allocated memory is still 200.3MB. Free memory was 151.1MB in the beginning and 175.6MB in the end (delta: -24.5MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.50ms. Allocated memory is still 200.3MB. Free memory was 175.1MB in the beginning and 173.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 308.85ms. Allocated memory is still 200.3MB. Free memory was 173.6MB in the beginning and 159.9MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2996.37ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 159.4MB in the beginning and 149.8MB in the end (delta: 9.6MB). Peak memory consumption was 51.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 159 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 117 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 518 IncrementalHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 87 mSDtfsCounter, 518 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 68 PreInvPairs, 95 NumberOfFragments, 251 HoareAnnotationTreeSize, 68 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 39 FomulaSimplificationsInter, 15 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 10:38:05,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...