/usr/bin/java -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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/for_bounded_loop1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 20:34:15,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 20:34:15,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 20:34:15,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 20:34:15,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 20:34:15,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 20:34:15,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 20:34:15,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 20:34:15,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 20:34:15,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 20:34:15,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 20:34:15,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 20:34:15,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 20:34:15,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 20:34:15,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 20:34:15,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 20:34:15,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 20:34:15,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 20:34:15,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 20:34:15,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 20:34:15,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 20:34:15,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 20:34:15,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 20:34:15,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 20:34:15,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 20:34:15,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 20:34:15,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 20:34:15,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 20:34:15,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 20:34:15,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 20:34:15,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 20:34:15,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 20:34:15,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 20:34:15,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 20:34:15,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 20:34:15,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 20:34:15,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 20:34:15,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 20:34:15,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 20:34:15,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 20:34:15,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 20:34:15,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 20:34:15,100 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 20:34:15,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 20:34:15,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 20:34:15,101 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 20:34:15,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 20:34:15,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 20:34:15,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 20:34:15,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 20:34:15,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 20:34:15,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 20:34:15,102 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 20:34:15,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 20:34:15,102 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 20:34:15,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 20:34:15,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 20:34:15,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 20:34:15,102 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 20:34:15,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 20:34:15,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:34:15,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 20:34:15,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 20:34:15,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 20:34:15,103 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 20:34:15,103 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-01-31 20:34:15,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 20:34:15,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 20:34:15,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 20:34:15,285 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 20:34:15,286 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 20:34:15,287 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/for_bounded_loop1.c [2022-01-31 20:34:15,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5f5e2600/3278669dba614ff891b83169e0c54401/FLAG0173fec0c [2022-01-31 20:34:15,665 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 20:34:15,665 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c [2022-01-31 20:34:15,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5f5e2600/3278669dba614ff891b83169e0c54401/FLAG0173fec0c [2022-01-31 20:34:15,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5f5e2600/3278669dba614ff891b83169e0c54401 [2022-01-31 20:34:15,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 20:34:15,688 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 20:34:15,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 20:34:15,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 20:34:15,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 20:34:15,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:34:15" (1/1) ... [2022-01-31 20:34:15,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7799aeca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:34:15, skipping insertion in model container [2022-01-31 20:34:15,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:34:15" (1/1) ... [2022-01-31 20:34:15,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 20:34:15,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 20:34:15,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c[416,429] [2022-01-31 20:34:15,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:34:15,875 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 20:34:15,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c[416,429] [2022-01-31 20:34:15,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:34:15,897 INFO L208 MainTranslator]: Completed translation [2022-01-31 20:34:15,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:34:15 WrapperNode [2022-01-31 20:34:15,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 20:34:15,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 20:34:15,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 20:34:15,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 20:34:15,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:34:15" (1/1) ... [2022-01-31 20:34:15,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:34:15" (1/1) ... [2022-01-31 20:34:15,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:34:15" (1/1) ... [2022-01-31 20:34:15,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:34:15" (1/1) ... [2022-01-31 20:34:15,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:34:15" (1/1) ... [2022-01-31 20:34:15,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:34:15" (1/1) ... [2022-01-31 20:34:15,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:34:15" (1/1) ... [2022-01-31 20:34:15,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 20:34:15,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 20:34:15,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 20:34:15,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 20:34:15,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:34:15" (1/1) ... [2022-01-31 20:34:15,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:34:15,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 20:34:15,952 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-01-31 20:34:15,970 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-01-31 20:34:15,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 20:34:15,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 20:34:15,980 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 20:34:15,980 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 20:34:15,980 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 20:34:15,980 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 20:34:15,980 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 20:34:15,980 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 20:34:15,981 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 20:34:15,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 20:34:15,981 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 20:34:15,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 20:34:15,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 20:34:15,982 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 20:34:15,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 20:34:15,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 20:34:15,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 20:34:15,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 20:34:15,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 20:34:15,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 20:34:16,029 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 20:34:16,030 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 20:34:16,155 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 20:34:16,159 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 20:34:16,159 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 20:34:16,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:34:16 BoogieIcfgContainer [2022-01-31 20:34:16,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 20:34:16,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 20:34:16,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 20:34:16,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 20:34:16,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:34:15" (1/3) ... [2022-01-31 20:34:16,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35792b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:34:16, skipping insertion in model container [2022-01-31 20:34:16,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:34:15" (2/3) ... [2022-01-31 20:34:16,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35792b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:34:16, skipping insertion in model container [2022-01-31 20:34:16,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:34:16" (3/3) ... [2022-01-31 20:34:16,178 INFO L111 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.c [2022-01-31 20:34:16,181 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 20:34:16,182 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 20:34:16,236 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 20:34:16,247 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, 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, mLoopAccelerationTechnique=JORDAN [2022-01-31 20:34:16,247 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 20:34:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 16 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 20:34:16,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-31 20:34:16,268 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:34:16,268 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:34:16,269 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:34:16,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:34:16,275 INFO L85 PathProgramCache]: Analyzing trace with hash 669529748, now seen corresponding path program 1 times [2022-01-31 20:34:16,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:34:16,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1201074938] [2022-01-31 20:34:16,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:34:16,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:34:16,330 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:34:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:34:16,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:34:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:34:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:34:16,432 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:34:16,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1201074938] [2022-01-31 20:34:16,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1201074938] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:34:16,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:34:16,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 20:34:16,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263974519] [2022-01-31 20:34:16,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:34:16,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 20:34:16,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:34:16,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 20:34:16,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 20:34:16,460 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 16 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:34:16,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:34:16,502 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-01-31 20:34:16,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 20:34:16,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-01-31 20:34:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:34:16,514 INFO L225 Difference]: With dead ends: 41 [2022-01-31 20:34:16,514 INFO L226 Difference]: Without dead ends: 20 [2022-01-31 20:34:16,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 20:34:16,518 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 20:34:16,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 20:34:16,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-01-31 20:34:16,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-01-31 20:34:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:34:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-01-31 20:34:16,541 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2022-01-31 20:34:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:34:16,542 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-01-31 20:34:16,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:34:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-01-31 20:34:16,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-31 20:34:16,543 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:34:16,543 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:34:16,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 20:34:16,543 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:34:16,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:34:16,544 INFO L85 PathProgramCache]: Analyzing trace with hash 657523975, now seen corresponding path program 1 times [2022-01-31 20:34:16,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:34:16,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [434407166] [2022-01-31 20:34:16,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:34:16,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:34:16,550 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:34:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:34:16,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:34:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:34:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:34:16,635 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:34:16,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [434407166] [2022-01-31 20:34:16,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [434407166] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:34:16,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:34:16,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 20:34:16,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636236474] [2022-01-31 20:34:16,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:34:16,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 20:34:16,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:34:16,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 20:34:16,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 20:34:16,639 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:34:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:34:16,706 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-01-31 20:34:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 20:34:16,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-01-31 20:34:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:34:16,720 INFO L225 Difference]: With dead ends: 33 [2022-01-31 20:34:16,721 INFO L226 Difference]: Without dead ends: 26 [2022-01-31 20:34:16,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-31 20:34:16,722 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 20:34:16,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 25 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 20:34:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-31 20:34:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-01-31 20:34:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:34:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-01-31 20:34:16,733 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-01-31 20:34:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:34:16,733 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-01-31 20:34:16,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:34:16,734 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-01-31 20:34:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-31 20:34:16,734 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:34:16,734 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:34:16,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 20:34:16,736 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:34:16,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:34:16,739 INFO L85 PathProgramCache]: Analyzing trace with hash 659251853, now seen corresponding path program 1 times [2022-01-31 20:34:16,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:34:16,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1122062798] [2022-01-31 20:34:16,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:34:16,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:34:16,743 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:34:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:34:16,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:34:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:34:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:34:16,856 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:34:16,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1122062798] [2022-01-31 20:34:16,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1122062798] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:34:16,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:34:16,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:34:16,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207271689] [2022-01-31 20:34:16,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:34:16,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:34:16,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:34:16,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:34:16,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:34:16,860 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:34:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:34:16,984 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-01-31 20:34:16,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:34:16,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-01-31 20:34:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:34:16,987 INFO L225 Difference]: With dead ends: 30 [2022-01-31 20:34:16,987 INFO L226 Difference]: Without dead ends: 28 [2022-01-31 20:34:16,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 20:34:17,004 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:34:17,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 33 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:34:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-31 20:34:17,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-01-31 20:34:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 20:34:17,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-01-31 20:34:17,011 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 12 [2022-01-31 20:34:17,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:34:17,012 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-01-31 20:34:17,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:34:17,012 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-01-31 20:34:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 20:34:17,012 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:34:17,012 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:34:17,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 20:34:17,013 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:34:17,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:34:17,013 INFO L85 PathProgramCache]: Analyzing trace with hash -932371294, now seen corresponding path program 1 times [2022-01-31 20:34:17,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:34:17,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1538780994] [2022-01-31 20:34:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:34:17,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:34:17,015 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:34:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:34:17,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:34:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:34:17,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 20:34:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:34:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:34:17,103 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:34:17,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1538780994] [2022-01-31 20:34:17,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1538780994] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:34:17,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:34:17,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 20:34:17,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192675627] [2022-01-31 20:34:17,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:34:17,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 20:34:17,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:34:17,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 20:34:17,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-31 20:34:17,104 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:34:17,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:34:17,217 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-01-31 20:34:17,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 20:34:17,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-01-31 20:34:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:34:17,219 INFO L225 Difference]: With dead ends: 38 [2022-01-31 20:34:17,219 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 20:34:17,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-01-31 20:34:17,226 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:34:17,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 43 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:34:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 20:34:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-01-31 20:34:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 20:34:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-01-31 20:34:17,237 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 19 [2022-01-31 20:34:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:34:17,237 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-01-31 20:34:17,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:34:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-01-31 20:34:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 20:34:17,238 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:34:17,238 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:34:17,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 20:34:17,238 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:34:17,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:34:17,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1861509246, now seen corresponding path program 1 times [2022-01-31 20:34:17,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:34:17,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2104855664] [2022-01-31 20:34:17,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:34:17,436 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:34:17,437 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:34:17,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:34:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:34:17,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:34:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:34:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:34:18,005 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:34:18,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2104855664] [2022-01-31 20:34:18,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2104855664] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:34:18,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:34:18,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 20:34:18,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413893885] [2022-01-31 20:34:18,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:34:18,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 20:34:18,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:34:18,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 20:34:18,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-01-31 20:34:18,007 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 12 states have internal predecessors, (18), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:34:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:34:18,141 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-01-31 20:34:18,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 20:34:18,142 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 12 states have internal predecessors, (18), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-01-31 20:34:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:34:18,143 INFO L225 Difference]: With dead ends: 43 [2022-01-31 20:34:18,144 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 20:34:18,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2022-01-31 20:34:18,144 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 20:34:18,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 93 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 69 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2022-01-31 20:34:18,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 20:34:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-01-31 20:34:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 20:34:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-01-31 20:34:18,152 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 26 [2022-01-31 20:34:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:34:18,152 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-01-31 20:34:18,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 12 states have internal predecessors, (18), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:34:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-01-31 20:34:18,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 20:34:18,153 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:34:18,153 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:34:18,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 20:34:18,154 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:34:18,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:34:18,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1863237124, now seen corresponding path program 1 times [2022-01-31 20:34:18,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:34:18,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2081408491] [2022-01-31 20:34:18,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:34:18,251 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:34:18,252 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:34:18,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:34:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:34:18,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:34:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:34:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:34:18,515 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:34:18,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2081408491] [2022-01-31 20:34:18,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2081408491] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:34:18,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:34:18,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 20:34:18,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927858148] [2022-01-31 20:34:18,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:34:18,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 20:34:18,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:34:18,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 20:34:18,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-01-31 20:34:18,517 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:34:18,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:34:18,701 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-01-31 20:34:18,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 20:34:18,701 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-01-31 20:34:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:34:18,702 INFO L225 Difference]: With dead ends: 45 [2022-01-31 20:34:18,702 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 20:34:18,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2022-01-31 20:34:18,703 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:34:18,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 91 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 91 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2022-01-31 20:34:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 20:34:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-01-31 20:34:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 20:34:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-01-31 20:34:18,719 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 26 [2022-01-31 20:34:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:34:18,719 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-01-31 20:34:18,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:34:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-01-31 20:34:18,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 20:34:18,720 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:34:18,720 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:34:18,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 20:34:18,720 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:34:18,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:34:18,721 INFO L85 PathProgramCache]: Analyzing trace with hash 691724213, now seen corresponding path program 2 times [2022-01-31 20:34:18,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:34:18,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1862639214] [2022-01-31 20:34:18,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:34:18,837 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:34:18,838 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:34:18,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:34:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:34:18,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:34:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:34:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:34:19,556 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:34:19,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1862639214] [2022-01-31 20:34:19,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1862639214] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:34:19,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:34:19,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 20:34:19,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837032131] [2022-01-31 20:34:19,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:34:19,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 20:34:19,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:34:19,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 20:34:19,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2022-01-31 20:34:19,558 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 20 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 20:34:19,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:34:19,668 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-01-31 20:34:19,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 20:34:19,668 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 40 [2022-01-31 20:34:19,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:34:19,669 INFO L225 Difference]: With dead ends: 41 [2022-01-31 20:34:19,669 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 20:34:19,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2022-01-31 20:34:19,669 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 20:34:19,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 102 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 12 Invalid, 0 Unknown, 61 Unchecked, 0.0s Time] [2022-01-31 20:34:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 20:34:19,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 20:34:19,670 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-01-31 20:34:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 20:34:19,670 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2022-01-31 20:34:19,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:34:19,670 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 20:34:19,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 20:34:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 20:34:19,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 20:34:19,672 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 20:34:19,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 20:34:19,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 20:34:20,287 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-01-31 20:34:20,287 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-01-31 20:34:20,287 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-01-31 20:34:20,287 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-01-31 20:34:20,288 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-01-31 20:34:20,288 INFO L858 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-01-31 20:34:20,288 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-01-31 20:34:20,288 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 18 32) the Hoare annotation is: true [2022-01-31 20:34:20,288 INFO L854 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse0 (+ main_~x~0 1))) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 2147483647) (< main_~y~0 .cse0) (or (<= 1 main_~x~0) (<= .cse0 0)) (<= 0 (+ main_~y~0 2147483648)))) [2022-01-31 20:34:20,288 INFO L854 garLoopResultBuilder]: At program point L29-1(lines 22 30) the Hoare annotation is: (exists ((v_main_~x~0_21 Int) (v_main_~y~0_BEFORE_RETURN_2 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_2 Int)) (let ((.cse1 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0)) (.cse2 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1))) (and (let ((.cse0 (= main_~x~0 0))) (or (and .cse0 .cse1) (and .cse2 (not .cse0)))) (< v_main_~y~0_BEFORE_RETURN_2 (+ v_main_~x~0_21 1)) (<= 0 (+ v_main_~y~0_BEFORE_RETURN_2 2147483648)) (<= v_main_~y~0_BEFORE_RETURN_2 2147483647) (let ((.cse3 (= v_main_~x~0_21 0))) (or (and .cse3 .cse1) (and .cse2 (not .cse3)))) (not (= v_main_~y~0_BEFORE_RETURN_2 0)) (<= v_main_~x~0_21 v_main_~y~0_BEFORE_RETURN_2)))) [2022-01-31 20:34:20,288 INFO L854 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= main_~x~0 0) (<= main_~y~0 2147483647) (<= 0 (+ main_~y~0 2147483648)) (< 0 (+ main_~x~0 1))) [2022-01-31 20:34:20,288 INFO L854 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (let ((.cse0 (< main_~i~0 main_~n~0))) (or (and .cse0 (exists ((v_main_~y~0_BEFORE_RETURN_6 Int) (v_main_~x~0_41 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_6 Int)) (let ((.cse2 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_6 1)) (.cse3 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_6 0))) (and (not (= v_main_~y~0_BEFORE_RETURN_6 0)) (<= v_main_~x~0_41 v_main_~y~0_BEFORE_RETURN_6) (let ((.cse1 (= 0 (+ main_~y~0 main_~x~0)))) (or (and (not .cse1) .cse2) (and .cse1 .cse3))) (<= 0 (+ v_main_~y~0_BEFORE_RETURN_6 2147483648)) (< v_main_~y~0_BEFORE_RETURN_6 (+ v_main_~x~0_41 1)) (let ((.cse4 (= v_main_~x~0_41 0))) (or (and (not .cse4) .cse2) (and .cse3 .cse4))) (<= v_main_~y~0_BEFORE_RETURN_6 2147483647)))) (<= main_~x~0 0) (< 0 (+ main_~x~0 1))) (and .cse0 (or (< 0 main_~i~0) (= main_~i~0 0)) (= 0 (+ main_~y~0 main_~x~0)) (= main_~y~0 0)))) [2022-01-31 20:34:20,288 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 18 32) the Hoare annotation is: true [2022-01-31 20:34:20,288 INFO L854 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: (and (<= main_~x~0 0) (< 0 (+ main_~x~0 1))) [2022-01-31 20:34:20,288 INFO L854 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (and (= main_~x~0 0) (= main_~y~0 0)) [2022-01-31 20:34:20,289 INFO L854 garLoopResultBuilder]: At program point L22-2(lines 22 30) the Hoare annotation is: (or (and (< main_~i~0 main_~n~0) (= main_~i~0 0) (= main_~y~0 0)) (exists ((v_main_~x~0_21 Int) (v_main_~y~0_BEFORE_RETURN_2 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_2 Int)) (let ((.cse1 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0)) (.cse2 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1))) (and (let ((.cse0 (= main_~x~0 0))) (or (and .cse0 .cse1) (and .cse2 (not .cse0)))) (< v_main_~y~0_BEFORE_RETURN_2 (+ v_main_~x~0_21 1)) (<= 0 (+ v_main_~y~0_BEFORE_RETURN_2 2147483648)) (<= v_main_~y~0_BEFORE_RETURN_2 2147483647) (let ((.cse3 (= v_main_~x~0_21 0))) (or (and .cse3 .cse1) (and .cse2 (not .cse3)))) (not (= v_main_~y~0_BEFORE_RETURN_2 0)) (<= v_main_~x~0_21 v_main_~y~0_BEFORE_RETURN_2))))) [2022-01-31 20:34:20,289 INFO L854 garLoopResultBuilder]: At program point L22-3(lines 22 30) the Hoare annotation is: false [2022-01-31 20:34:20,289 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 18 32) the Hoare annotation is: true [2022-01-31 20:34:20,289 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 20:34:20,289 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 20:34:20,289 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 20:34:20,289 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 20:34:20,289 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 20:34:20,289 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 20:34:20,289 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 20:34:20,289 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 14) the Hoare annotation is: true [2022-01-31 20:34:20,289 INFO L854 garLoopResultBuilder]: At program point L11(line 11) the Hoare annotation is: (let ((.cse0 (not (< main_~i~0 main_~n~0)))) (and (or .cse0 (forall ((v_main_~x~0_19 Int)) (or (let ((.cse1 (= v_main_~x~0_19 0))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse1) (or (not (= |__VERIFIER_assert_#in~cond| 1)) (not .cse1)))) (let ((.cse2 (not (= main_~y~0 0))) (.cse3 (not (= (+ v_main_~x~0_19 main_~y~0) 0)))) (and (or .cse2 (not (< 0 main_~i~0)) .cse3) (or .cse2 .cse3 (not (= main_~i~0 0)))))))) (or (not (<= main_~y~0 2147483647)) (= main_~y~0 0) (not (<= 0 (+ main_~y~0 2147483648))) (forall ((v_main_~x~0_41 Int)) (or (not (< main_~y~0 (+ v_main_~x~0_41 1))) (let ((.cse4 (= v_main_~x~0_41 0))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) (not .cse4)) (or (not (= |__VERIFIER_assert_#in~cond| 1)) .cse4))) (not (<= v_main_~x~0_41 main_~y~0))))) (or (forall ((v_main_~y~0_BEFORE_RETURN_6 Int) (v_main_~x~0_43 Int) (v_main_~x~0_41 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_6 Int)) (let ((.cse7 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_6 0))) (.cse8 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_6 1)))) (or (let ((.cse5 (= v_main_~x~0_43 0))) (and (or (not (= |__VERIFIER_assert_#in~cond| 1)) (not .cse5)) (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse5))) (not (< v_main_~y~0_BEFORE_RETURN_6 (+ v_main_~x~0_41 1))) (= v_main_~y~0_BEFORE_RETURN_6 0) (not (<= v_main_~y~0_BEFORE_RETURN_6 2147483647)) (let ((.cse6 (= (+ v_main_~x~0_43 main_~y~0) 0))) (and (or (not .cse6) .cse7) (or .cse6 .cse8))) (not (<= 0 (+ v_main_~y~0_BEFORE_RETURN_6 2147483648))) (let ((.cse9 (= v_main_~x~0_41 0))) (and (or (not .cse9) .cse7) (or .cse8 .cse9))) (not (<= v_main_~x~0_41 v_main_~y~0_BEFORE_RETURN_6))))) .cse0 (= |__VERIFIER_assert_#in~cond| 0)))) [2022-01-31 20:34:20,290 INFO L854 garLoopResultBuilder]: At program point L10(lines 10 12) the Hoare annotation is: (let ((.cse5 (not (< main_~i~0 main_~n~0))) (.cse6 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (and (or (forall ((v_main_~y~0_BEFORE_RETURN_6 Int) (v_main_~x~0_43 Int) (v_main_~x~0_41 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_6 Int)) (let ((.cse2 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_6 0))) (.cse3 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_6 1)))) (or (let ((.cse0 (= v_main_~x~0_43 0))) (and (or (not (= |__VERIFIER_assert_#in~cond| 1)) (not .cse0)) (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse0))) (not (< v_main_~y~0_BEFORE_RETURN_6 (+ v_main_~x~0_41 1))) (= v_main_~y~0_BEFORE_RETURN_6 0) (not (<= v_main_~y~0_BEFORE_RETURN_6 2147483647)) (let ((.cse1 (= (+ v_main_~x~0_43 main_~y~0) 0))) (and (or (not .cse1) .cse2) (or .cse1 .cse3))) (not (<= 0 (+ v_main_~y~0_BEFORE_RETURN_6 2147483648))) (let ((.cse4 (= v_main_~x~0_41 0))) (and (or (not .cse4) .cse2) (or .cse3 .cse4))) (not (<= v_main_~x~0_41 v_main_~y~0_BEFORE_RETURN_6))))) .cse5 .cse6 (= |__VERIFIER_assert_#in~cond| 0)) (or .cse5 .cse6 (forall ((v_main_~x~0_19 Int)) (or (let ((.cse7 (= v_main_~x~0_19 0))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse7) (or (not (= |__VERIFIER_assert_#in~cond| 1)) (not .cse7)))) (let ((.cse8 (not (= main_~y~0 0))) (.cse9 (not (= (+ v_main_~x~0_19 main_~y~0) 0)))) (and (or .cse8 (not (< 0 main_~i~0)) .cse9) (or .cse8 .cse9 (not (= main_~i~0 0)))))))) (or (not (<= main_~y~0 2147483647)) .cse6 (= main_~y~0 0) (not (<= 0 (+ main_~y~0 2147483648))) (forall ((v_main_~x~0_41 Int)) (or (not (< main_~y~0 (+ v_main_~x~0_41 1))) (let ((.cse10 (= v_main_~x~0_41 0))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) (not .cse10)) (or (not (= |__VERIFIER_assert_#in~cond| 1)) .cse10))) (not (<= v_main_~x~0_41 main_~y~0))))))) [2022-01-31 20:34:20,290 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 14) the Hoare annotation is: (let ((.cse5 (not (< main_~i~0 main_~n~0))) (.cse6 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (and (or (forall ((v_main_~y~0_BEFORE_RETURN_6 Int) (v_main_~x~0_43 Int) (v_main_~x~0_41 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_6 Int)) (let ((.cse2 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_6 0))) (.cse3 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_6 1)))) (or (let ((.cse0 (= v_main_~x~0_43 0))) (and (or (not (= |__VERIFIER_assert_#in~cond| 1)) (not .cse0)) (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse0))) (not (< v_main_~y~0_BEFORE_RETURN_6 (+ v_main_~x~0_41 1))) (= v_main_~y~0_BEFORE_RETURN_6 0) (not (<= v_main_~y~0_BEFORE_RETURN_6 2147483647)) (let ((.cse1 (= (+ v_main_~x~0_43 main_~y~0) 0))) (and (or (not .cse1) .cse2) (or .cse1 .cse3))) (not (<= 0 (+ v_main_~y~0_BEFORE_RETURN_6 2147483648))) (let ((.cse4 (= v_main_~x~0_41 0))) (and (or (not .cse4) .cse2) (or .cse3 .cse4))) (not (<= v_main_~x~0_41 v_main_~y~0_BEFORE_RETURN_6))))) .cse5 .cse6 (= |__VERIFIER_assert_#in~cond| 0)) (or .cse5 .cse6 (forall ((v_main_~x~0_19 Int)) (or (let ((.cse7 (= v_main_~x~0_19 0))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse7) (or (not (= |__VERIFIER_assert_#in~cond| 1)) (not .cse7)))) (let ((.cse8 (not (= main_~y~0 0))) (.cse9 (not (= (+ v_main_~x~0_19 main_~y~0) 0)))) (and (or .cse8 (not (< 0 main_~i~0)) .cse9) (or .cse8 .cse9 (not (= main_~i~0 0)))))))) (or (not (<= main_~y~0 2147483647)) .cse6 (= main_~y~0 0) (not (<= 0 (+ main_~y~0 2147483648))) (forall ((v_main_~x~0_41 Int)) (or (not (< main_~y~0 (+ v_main_~x~0_41 1))) (let ((.cse10 (= v_main_~x~0_41 0))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) (not .cse10)) (or (not (= |__VERIFIER_assert_#in~cond| 1)) .cse10))) (not (<= v_main_~x~0_41 main_~y~0))))))) [2022-01-31 20:34:20,290 INFO L854 garLoopResultBuilder]: At program point L10-2(lines 9 14) the Hoare annotation is: (let ((.cse5 (not (< main_~i~0 main_~n~0))) (.cse6 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (and (or (forall ((v_main_~y~0_BEFORE_RETURN_6 Int) (v_main_~x~0_43 Int) (v_main_~x~0_41 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_6 Int)) (let ((.cse2 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_6 0))) (.cse3 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_6 1)))) (or (let ((.cse0 (= v_main_~x~0_43 0))) (and (or (not (= |__VERIFIER_assert_#in~cond| 1)) (not .cse0)) (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse0))) (not (< v_main_~y~0_BEFORE_RETURN_6 (+ v_main_~x~0_41 1))) (= v_main_~y~0_BEFORE_RETURN_6 0) (not (<= v_main_~y~0_BEFORE_RETURN_6 2147483647)) (let ((.cse1 (= (+ v_main_~x~0_43 main_~y~0) 0))) (and (or (not .cse1) .cse2) (or .cse1 .cse3))) (not (<= 0 (+ v_main_~y~0_BEFORE_RETURN_6 2147483648))) (let ((.cse4 (= v_main_~x~0_41 0))) (and (or (not .cse4) .cse2) (or .cse3 .cse4))) (not (<= v_main_~x~0_41 v_main_~y~0_BEFORE_RETURN_6))))) .cse5 .cse6 (= |__VERIFIER_assert_#in~cond| 0)) (or .cse5 .cse6 (forall ((v_main_~x~0_19 Int)) (or (let ((.cse7 (= v_main_~x~0_19 0))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse7) (or (not (= |__VERIFIER_assert_#in~cond| 1)) (not .cse7)))) (let ((.cse8 (not (= main_~y~0 0))) (.cse9 (not (= (+ v_main_~x~0_19 main_~y~0) 0)))) (and (or .cse8 (not (< 0 main_~i~0)) .cse9) (or .cse8 .cse9 (not (= main_~i~0 0)))))))) (or (not (<= main_~y~0 2147483647)) .cse6 (= main_~y~0 0) (not (<= 0 (+ main_~y~0 2147483648))) (forall ((v_main_~x~0_41 Int)) (or (not (< main_~y~0 (+ v_main_~x~0_41 1))) (let ((.cse10 (= v_main_~x~0_41 0))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) (not .cse10)) (or (not (= |__VERIFIER_assert_#in~cond| 1)) .cse10))) (not (<= v_main_~x~0_41 main_~y~0))))))) [2022-01-31 20:34:20,290 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) the Hoare annotation is: (let ((.cse0 (not (< main_~i~0 main_~n~0)))) (and (or .cse0 (forall ((v_main_~x~0_19 Int)) (or (let ((.cse1 (= v_main_~x~0_19 0))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse1) (or (not (= |__VERIFIER_assert_#in~cond| 1)) (not .cse1)))) (let ((.cse2 (not (= main_~y~0 0))) (.cse3 (not (= (+ v_main_~x~0_19 main_~y~0) 0)))) (and (or .cse2 (not (< 0 main_~i~0)) .cse3) (or .cse2 .cse3 (not (= main_~i~0 0)))))))) (or (not (<= main_~y~0 2147483647)) (= main_~y~0 0) (not (<= 0 (+ main_~y~0 2147483648))) (forall ((v_main_~x~0_41 Int)) (or (not (< main_~y~0 (+ v_main_~x~0_41 1))) (let ((.cse4 (= v_main_~x~0_41 0))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) (not .cse4)) (or (not (= |__VERIFIER_assert_#in~cond| 1)) .cse4))) (not (<= v_main_~x~0_41 main_~y~0))))) (or (forall ((v_main_~y~0_BEFORE_RETURN_6 Int) (v_main_~x~0_43 Int) (v_main_~x~0_41 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_6 Int)) (let ((.cse7 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_6 0))) (.cse8 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_6 1)))) (or (let ((.cse5 (= v_main_~x~0_43 0))) (and (or (not (= |__VERIFIER_assert_#in~cond| 1)) (not .cse5)) (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse5))) (not (< v_main_~y~0_BEFORE_RETURN_6 (+ v_main_~x~0_41 1))) (= v_main_~y~0_BEFORE_RETURN_6 0) (not (<= v_main_~y~0_BEFORE_RETURN_6 2147483647)) (let ((.cse6 (= (+ v_main_~x~0_43 main_~y~0) 0))) (and (or (not .cse6) .cse7) (or .cse6 .cse8))) (not (<= 0 (+ v_main_~y~0_BEFORE_RETURN_6 2147483648))) (let ((.cse9 (= v_main_~x~0_41 0))) (and (or (not .cse9) .cse7) (or .cse8 .cse9))) (not (<= v_main_~x~0_41 v_main_~y~0_BEFORE_RETURN_6))))) .cse0 (= |__VERIFIER_assert_#in~cond| 0)))) [2022-01-31 20:34:20,292 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-01-31 20:34:20,293 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 20:34:20,297 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,298 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,298 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,298 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] [2022-01-31 20:34:20,298 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,298 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,298 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] [2022-01-31 20:34:20,298 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,298 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,299 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] [2022-01-31 20:34:20,299 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,299 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] [2022-01-31 20:34:20,299 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,303 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,303 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,303 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,304 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] [2022-01-31 20:34:20,304 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,304 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,304 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] [2022-01-31 20:34:20,304 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,304 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,304 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] [2022-01-31 20:34:20,304 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,304 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] [2022-01-31 20:34:20,304 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,306 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_43,QUANTIFIED] [2022-01-31 20:34:20,306 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_43,QUANTIFIED] [2022-01-31 20:34:20,306 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,306 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,306 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,307 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,307 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_43,QUANTIFIED] [2022-01-31 20:34:20,307 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,307 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_43,QUANTIFIED] [2022-01-31 20:34:20,307 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,307 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,307 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,307 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,307 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,307 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,307 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_19,QUANTIFIED] [2022-01-31 20:34:20,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_19,QUANTIFIED] [2022-01-31 20:34:20,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_19,QUANTIFIED] [2022-01-31 20:34:20,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_19,QUANTIFIED] [2022-01-31 20:34:20,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:34:20 BoogieIcfgContainer [2022-01-31 20:34:20,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 20:34:20,309 INFO L158 Benchmark]: Toolchain (without parser) took 4621.00ms. Allocated memory was 195.0MB in the beginning and 262.1MB in the end (delta: 67.1MB). Free memory was 146.4MB in the beginning and 156.7MB in the end (delta: -10.4MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. [2022-01-31 20:34:20,310 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 163.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 20:34:20,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.29ms. Allocated memory is still 195.0MB. Free memory was 146.2MB in the beginning and 172.7MB in the end (delta: -26.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-31 20:34:20,310 INFO L158 Benchmark]: Boogie Preprocessor took 28.59ms. Allocated memory is still 195.0MB. Free memory was 172.7MB in the beginning and 171.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 20:34:20,310 INFO L158 Benchmark]: RCFGBuilder took 231.83ms. Allocated memory is still 195.0MB. Free memory was 171.2MB in the beginning and 160.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-31 20:34:20,310 INFO L158 Benchmark]: TraceAbstraction took 4147.94ms. Allocated memory was 195.0MB in the beginning and 262.1MB in the end (delta: 67.1MB). Free memory was 160.1MB in the beginning and 156.7MB in the end (delta: 3.4MB). Peak memory consumption was 71.6MB. Max. memory is 8.0GB. [2022-01-31 20:34:20,311 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 163.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.29ms. Allocated memory is still 195.0MB. Free memory was 146.2MB in the beginning and 172.7MB in the end (delta: -26.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.59ms. Allocated memory is still 195.0MB. Free memory was 172.7MB in the beginning and 171.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 231.83ms. Allocated memory is still 195.0MB. Free memory was 171.2MB in the beginning and 160.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4147.94ms. Allocated memory was 195.0MB in the beginning and 262.1MB in the end (delta: 67.1MB). Free memory was 160.1MB in the beginning and 156.7MB in the end (delta: 3.4MB). Peak memory consumption was 71.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] * 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 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 148 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 415 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 138 IncrementalHoareTripleChecker+Unchecked, 283 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 357 IncrementalHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 132 mSDtfsCounter, 357 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 44 SyntacticMatches, 19 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=6, InterpolantAutomatonStates: 71, 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, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 78 PreInvPairs, 113 NumberOfFragments, 1273 HoareAnnotationTreeSize, 78 FomulaSimplifications, 32 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 3327 FormulaSimplificationTreeSizeReductionInter, 0.6s 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 - InvariantResult [Line: 22]: Loop Invariant [2022-01-31 20:34:20,316 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,316 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] [2022-01-31 20:34:20,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] [2022-01-31 20:34:20,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] [2022-01-31 20:34:20,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] [2022-01-31 20:34:20,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] [2022-01-31 20:34:20,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] [2022-01-31 20:34:20,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] [2022-01-31 20:34:20,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:34:20,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_21,QUANTIFIED] [2022-01-31 20:34:20,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_2,QUANTIFIED] Derived loop invariant: ((i < n && i == 0) && y == 0) || (\exists v_main_~x~0_21 : int, v_main_~y~0_BEFORE_RETURN_2 : int, v___VERIFIER_assert_~cond_BEFORE_RETURN_2 : int :: (((((((x == 0 && v___VERIFIER_assert_~cond_BEFORE_RETURN_2 == 0) || (v___VERIFIER_assert_~cond_BEFORE_RETURN_2 == 1 && !(x == 0))) && v_main_~y~0_BEFORE_RETURN_2 < v_main_~x~0_21 + 1) && 0 <= v_main_~y~0_BEFORE_RETURN_2 + 2147483648) && v_main_~y~0_BEFORE_RETURN_2 <= 2147483647) && ((v_main_~x~0_21 == 0 && v___VERIFIER_assert_~cond_BEFORE_RETURN_2 == 0) || (v___VERIFIER_assert_~cond_BEFORE_RETURN_2 == 1 && !(v_main_~x~0_21 == 0)))) && !(v_main_~y~0_BEFORE_RETURN_2 == 0)) && v_main_~x~0_21 <= v_main_~y~0_BEFORE_RETURN_2) - ProcedureContractResult [Line: 18]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert [2022-01-31 20:34:20,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_43,QUANTIFIED] [2022-01-31 20:34:20,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_43,QUANTIFIED] [2022-01-31 20:34:20,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_43,QUANTIFIED] [2022-01-31 20:34:20,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_43,QUANTIFIED] [2022-01-31 20:34:20,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_19,QUANTIFIED] [2022-01-31 20:34:20,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_19,QUANTIFIED] [2022-01-31 20:34:20,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_19,QUANTIFIED] [2022-01-31 20:34:20,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_19,QUANTIFIED] [2022-01-31 20:34:20,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_43,QUANTIFIED] [2022-01-31 20:34:20,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_43,QUANTIFIED] [2022-01-31 20:34:20,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_43,QUANTIFIED] [2022-01-31 20:34:20,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_43,QUANTIFIED] [2022-01-31 20:34:20,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_BEFORE_RETURN_6,QUANTIFIED] [2022-01-31 20:34:20,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_19,QUANTIFIED] [2022-01-31 20:34:20,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_19,QUANTIFIED] [2022-01-31 20:34:20,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_19,QUANTIFIED] [2022-01-31 20:34:20,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_19,QUANTIFIED] [2022-01-31 20:34:20,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,323 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] [2022-01-31 20:34:20,323 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_41,QUANTIFIED] Derived contract for procedure __VERIFIER_assert: (((((forall v_main_~y~0_BEFORE_RETURN_6 : int, v_main_~x~0_43 : int, v_main_~x~0_41 : int, v___VERIFIER_assert_~cond_BEFORE_RETURN_6 : int :: ((((((((!(\old(cond) == 1) || !(v_main_~x~0_43 == 0)) && (!(\old(cond) == 0) || v_main_~x~0_43 == 0)) || !(v_main_~y~0_BEFORE_RETURN_6 < v_main_~x~0_41 + 1)) || v_main_~y~0_BEFORE_RETURN_6 == 0) || !(v_main_~y~0_BEFORE_RETURN_6 <= 2147483647)) || ((!(v_main_~x~0_43 + y == 0) || !(v___VERIFIER_assert_~cond_BEFORE_RETURN_6 == 0)) && (v_main_~x~0_43 + y == 0 || !(v___VERIFIER_assert_~cond_BEFORE_RETURN_6 == 1)))) || !(0 <= v_main_~y~0_BEFORE_RETURN_6 + 2147483648)) || ((!(v_main_~x~0_41 == 0) || !(v___VERIFIER_assert_~cond_BEFORE_RETURN_6 == 0)) && (!(v___VERIFIER_assert_~cond_BEFORE_RETURN_6 == 1) || v_main_~x~0_41 == 0))) || !(v_main_~x~0_41 <= v_main_~y~0_BEFORE_RETURN_6)) || !(i < n)) || \old(cond) == cond) || \old(cond) == 0) && ((!(i < n) || \old(cond) == cond) || (forall v_main_~x~0_19 : int :: ((!(\old(cond) == 0) || v_main_~x~0_19 == 0) && (!(\old(cond) == 1) || !(v_main_~x~0_19 == 0))) || (((!(y == 0) || !(0 < i)) || !(v_main_~x~0_19 + y == 0)) && ((!(y == 0) || !(v_main_~x~0_19 + y == 0)) || !(i == 0)))))) && ((((!(y <= 2147483647) || \old(cond) == cond) || y == 0) || !(0 <= y + 2147483648)) || (forall v_main_~x~0_41 : int :: (!(y < v_main_~x~0_41 + 1) || ((!(\old(cond) == 0) || !(v_main_~x~0_41 == 0)) && (!(\old(cond) == 1) || v_main_~x~0_41 == 0))) || !(v_main_~x~0_41 <= y))) RESULT: Ultimate proved your program to be correct! [2022-01-31 20:34:20,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...