/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/loop-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 20:58:29,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 20:58:29,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 20:58:29,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 20:58:29,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 20:58:29,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 20:58:29,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 20:58:29,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 20:58:29,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 20:58:29,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 20:58:29,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 20:58:29,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 20:58:29,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 20:58:29,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 20:58:29,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 20:58:29,200 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 20:58:29,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 20:58:29,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 20:58:29,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 20:58:29,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 20:58:29,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 20:58:29,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 20:58:29,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 20:58:29,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 20:58:29,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 20:58:29,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 20:58:29,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 20:58:29,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 20:58:29,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 20:58:29,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 20:58:29,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 20:58:29,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 20:58:29,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 20:58:29,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 20:58:29,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 20:58:29,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 20:58:29,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 20:58:29,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 20:58:29,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 20:58:29,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 20:58:29,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 20:58:29,228 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:58:29,241 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 20:58:29,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 20:58:29,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 20:58:29,243 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 20:58:29,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 20:58:29,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 20:58:29,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 20:58:29,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 20:58:29,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 20:58:29,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 20:58:29,244 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 20:58:29,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 20:58:29,244 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 20:58:29,244 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 20:58:29,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 20:58:29,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 20:58:29,245 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 20:58:29,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 20:58:29,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:58:29,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 20:58:29,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 20:58:29,245 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 20:58:29,245 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 20:58:29,245 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:58:29,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 20:58:29,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 20:58:29,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 20:58:29,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 20:58:29,431 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 20:58:29,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2022-01-31 20:58:29,505 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54c16f8b/a7b1921ecb5e471792205943c8931d72/FLAGdde1d8031 [2022-01-31 20:58:29,875 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 20:58:29,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2022-01-31 20:58:29,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54c16f8b/a7b1921ecb5e471792205943c8931d72/FLAGdde1d8031 [2022-01-31 20:58:29,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54c16f8b/a7b1921ecb5e471792205943c8931d72 [2022-01-31 20:58:29,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 20:58:29,892 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 20:58:29,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 20:58:29,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 20:58:29,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 20:58:29,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:58:29" (1/1) ... [2022-01-31 20:58:29,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@687a29ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:29, skipping insertion in model container [2022-01-31 20:58:29,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:58:29" (1/1) ... [2022-01-31 20:58:29,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 20:58:29,912 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 20:58:30,022 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i[893,906] [2022-01-31 20:58:30,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:58:30,033 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 20:58:30,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i[893,906] [2022-01-31 20:58:30,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:58:30,051 INFO L208 MainTranslator]: Completed translation [2022-01-31 20:58:30,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:30 WrapperNode [2022-01-31 20:58:30,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 20:58:30,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 20:58:30,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 20:58:30,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 20:58:30,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:30" (1/1) ... [2022-01-31 20:58:30,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:30" (1/1) ... [2022-01-31 20:58:30,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:30" (1/1) ... [2022-01-31 20:58:30,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:30" (1/1) ... [2022-01-31 20:58:30,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:30" (1/1) ... [2022-01-31 20:58:30,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:30" (1/1) ... [2022-01-31 20:58:30,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:30" (1/1) ... [2022-01-31 20:58:30,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 20:58:30,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 20:58:30,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 20:58:30,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 20:58:30,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:30" (1/1) ... [2022-01-31 20:58:30,094 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:58:30,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 20:58:30,108 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:58:30,114 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:58:30,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 20:58:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 20:58:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 20:58:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 20:58:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 20:58:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 20:58:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 20:58:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 20:58:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-01-31 20:58:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-01-31 20:58:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 20:58:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 20:58:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 20:58:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 20:58:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 20:58:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 20:58:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 20:58:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 20:58:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 20:58:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 20:58:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 20:58:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 20:58:30,176 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 20:58:30,177 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 20:58:30,257 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 20:58:30,261 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 20:58:30,261 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 20:58:30,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:58:30 BoogieIcfgContainer [2022-01-31 20:58:30,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 20:58:30,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 20:58:30,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 20:58:30,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 20:58:30,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:58:29" (1/3) ... [2022-01-31 20:58:30,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e1f830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:58:30, skipping insertion in model container [2022-01-31 20:58:30,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:30" (2/3) ... [2022-01-31 20:58:30,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e1f830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:58:30, skipping insertion in model container [2022-01-31 20:58:30,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:58:30" (3/3) ... [2022-01-31 20:58:30,267 INFO L111 eAbstractionObserver]: Analyzing ICFG nested6.i [2022-01-31 20:58:30,271 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 20:58:30,271 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 20:58:30,321 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 20:58:30,326 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:58:30,326 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 20:58:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 22 states have internal predecessors, (31), 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:58:30,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 20:58:30,339 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:30,339 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:30,340 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:30,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:30,343 INFO L85 PathProgramCache]: Analyzing trace with hash -380972064, now seen corresponding path program 1 times [2022-01-31 20:58:30,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:30,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1981437555] [2022-01-31 20:58:30,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:30,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:30,387 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,501 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:58:30,503 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:30,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1981437555] [2022-01-31 20:58:30,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1981437555] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:30,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:30,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 20:58:30,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414515880] [2022-01-31 20:58:30,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:30,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 20:58:30,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:30,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 20:58:30,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 20:58:30,527 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 22 states have internal predecessors, (31), 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 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:58:30,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:30,643 INFO L93 Difference]: Finished difference Result 58 states and 81 transitions. [2022-01-31 20:58:30,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 20:58:30,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-31 20:58:30,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:30,650 INFO L225 Difference]: With dead ends: 58 [2022-01-31 20:58:30,650 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 20:58:30,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 20:58:30,654 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:30,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 52 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:58:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 20:58:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-31 20:58:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 20:58:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-01-31 20:58:30,690 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2022-01-31 20:58:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:30,690 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-01-31 20:58:30,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:58:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-01-31 20:58:30,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 20:58:30,691 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:30,691 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:30,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 20:58:30,691 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:30,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:30,692 INFO L85 PathProgramCache]: Analyzing trace with hash 580085489, now seen corresponding path program 1 times [2022-01-31 20:58:30,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:30,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [528636591] [2022-01-31 20:58:30,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:30,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:30,695 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,750 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:58:30,750 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:30,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [528636591] [2022-01-31 20:58:30,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [528636591] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:30,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:30,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:58:30,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880870292] [2022-01-31 20:58:30,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:30,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:58:30,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:30,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:58:30,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:58:30,752 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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:58:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:30,884 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-01-31 20:58:30,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:58:30,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-01-31 20:58:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:30,887 INFO L225 Difference]: With dead ends: 41 [2022-01-31 20:58:30,887 INFO L226 Difference]: Without dead ends: 39 [2022-01-31 20:58:30,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 20:58:30,892 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:30,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 45 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:58:30,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-31 20:58:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-01-31 20:58:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 20:58:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-01-31 20:58:30,912 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2022-01-31 20:58:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:30,913 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-01-31 20:58:30,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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:58:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-01-31 20:58:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 20:58:30,915 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:30,915 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:30,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 20:58:30,917 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:30,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:30,922 INFO L85 PathProgramCache]: Analyzing trace with hash -132185391, now seen corresponding path program 1 times [2022-01-31 20:58:30,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:30,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [825497134] [2022-01-31 20:58:30,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:30,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:30,924 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:58:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:31,009 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:58:31,009 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:31,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [825497134] [2022-01-31 20:58:31,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [825497134] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:31,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:31,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 20:58:31,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903753252] [2022-01-31 20:58:31,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:31,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 20:58:31,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:31,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 20:58:31,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 20:58:31,011 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 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:58:31,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:31,109 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-01-31 20:58:31,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 20:58:31,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 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 21 [2022-01-31 20:58:31,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:31,111 INFO L225 Difference]: With dead ends: 46 [2022-01-31 20:58:31,112 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 20:58:31,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 20:58:31,118 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:31,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 42 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:58:31,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 20:58:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-01-31 20:58:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 20:58:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-01-31 20:58:31,137 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2022-01-31 20:58:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:31,137 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-01-31 20:58:31,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 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:58:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-01-31 20:58:31,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 20:58:31,138 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:31,138 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:31,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 20:58:31,138 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:31,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:31,138 INFO L85 PathProgramCache]: Analyzing trace with hash -512108736, now seen corresponding path program 1 times [2022-01-31 20:58:31,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:31,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [665645056] [2022-01-31 20:58:31,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:31,197 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:31,198 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:31,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:31,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:31,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 20:58:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:31,255 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:58:31,298 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:31,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [665645056] [2022-01-31 20:58:31,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [665645056] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:31,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:31,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 20:58:31,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025525307] [2022-01-31 20:58:31,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:31,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 20:58:31,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:31,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 20:58:31,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-31 20:58:31,300 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 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:58:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:31,451 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2022-01-31 20:58:31,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 20:58:31,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 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 25 [2022-01-31 20:58:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:31,454 INFO L225 Difference]: With dead ends: 83 [2022-01-31 20:58:31,454 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 20:58:31,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-01-31 20:58:31,460 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:31,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 42 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:58:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 20:58:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2022-01-31 20:58:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 20:58:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2022-01-31 20:58:31,479 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 25 [2022-01-31 20:58:31,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:31,480 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2022-01-31 20:58:31,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 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:58:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2022-01-31 20:58:31,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 20:58:31,481 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:31,481 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 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:58:31,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 20:58:31,481 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:31,481 INFO L85 PathProgramCache]: Analyzing trace with hash 735221632, now seen corresponding path program 1 times [2022-01-31 20:58:31,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:31,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1987322296] [2022-01-31 20:58:31,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:31,713 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:31,713 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:31,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:31,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:31,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 20:58:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:31,804 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:58:35,794 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:35,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1987322296] [2022-01-31 20:58:35,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1987322296] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:35,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:35,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 20:58:35,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066042174] [2022-01-31 20:58:35,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:35,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 20:58:35,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:35,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 20:58:35,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=309, Unknown=3, NotChecked=0, Total=380 [2022-01-31 20:58:35,796 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 5 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:58:37,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:37,866 INFO L93 Difference]: Finished difference Result 118 states and 145 transitions. [2022-01-31 20:58:37,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 20:58:37,866 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 39 [2022-01-31 20:58:37,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:37,867 INFO L225 Difference]: With dead ends: 118 [2022-01-31 20:58:37,867 INFO L226 Difference]: Without dead ends: 94 [2022-01-31 20:58:37,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=222, Invalid=1181, Unknown=3, NotChecked=0, Total=1406 [2022-01-31 20:58:37,869 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 70 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:37,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 85 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 467 Invalid, 0 Unknown, 67 Unchecked, 0.2s Time] [2022-01-31 20:58:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-01-31 20:58:37,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2022-01-31 20:58:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 53 states have internal predecessors, (63), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-31 20:58:37,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2022-01-31 20:58:37,878 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 39 [2022-01-31 20:58:37,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:37,879 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2022-01-31 20:58:37,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 5 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:58:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-01-31 20:58:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 20:58:37,880 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:37,880 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:37,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 20:58:37,880 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:37,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:37,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1785248429, now seen corresponding path program 1 times [2022-01-31 20:58:37,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:37,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [496420836] [2022-01-31 20:58:37,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:37,934 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:37,934 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:37,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:37,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:37,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 20:58:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:38,002 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:58:41,355 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:41,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [496420836] [2022-01-31 20:58:41,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [496420836] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:41,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:41,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 20:58:41,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658165403] [2022-01-31 20:58:41,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:41,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 20:58:41,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:41,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 20:58:41,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=310, Unknown=2, NotChecked=0, Total=380 [2022-01-31 20:58:41,357 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 14 states have internal predecessors, (31), 4 states have call successors, (6), 5 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:58:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:43,506 INFO L93 Difference]: Finished difference Result 202 states and 256 transitions. [2022-01-31 20:58:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 20:58:43,507 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 14 states have internal predecessors, (31), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 42 [2022-01-31 20:58:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:43,509 INFO L225 Difference]: With dead ends: 202 [2022-01-31 20:58:43,509 INFO L226 Difference]: Without dead ends: 178 [2022-01-31 20:58:43,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=260, Invalid=1460, Unknown=2, NotChecked=0, Total=1722 [2022-01-31 20:58:43,510 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 82 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:43,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 70 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 411 Invalid, 0 Unknown, 54 Unchecked, 0.2s Time] [2022-01-31 20:58:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-01-31 20:58:43,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 162. [2022-01-31 20:58:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 118 states have (on average 1.2881355932203389) internal successors, (152), 123 states have internal predecessors, (152), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-01-31 20:58:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 205 transitions. [2022-01-31 20:58:43,533 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 205 transitions. Word has length 42 [2022-01-31 20:58:43,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:43,533 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 205 transitions. [2022-01-31 20:58:43,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 14 states have internal predecessors, (31), 4 states have call successors, (6), 5 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:58:43,533 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 205 transitions. [2022-01-31 20:58:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 20:58:43,534 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:43,534 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:43,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 20:58:43,534 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:43,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:43,535 INFO L85 PathProgramCache]: Analyzing trace with hash 853900399, now seen corresponding path program 2 times [2022-01-31 20:58:43,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:43,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [574353915] [2022-01-31 20:58:43,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:43,598 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:43,713 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:43,713 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 20:58:43,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:43,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:43,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 20:58:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:43,768 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:58:47,796 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:47,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [574353915] [2022-01-31 20:58:47,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [574353915] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:47,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:47,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 20:58:47,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118688875] [2022-01-31 20:58:47,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:47,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 20:58:47,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:47,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 20:58:47,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=344, Unknown=3, NotChecked=0, Total=420 [2022-01-31 20:58:47,799 INFO L87 Difference]: Start difference. First operand 162 states and 205 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (6), 5 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:58:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:50,588 INFO L93 Difference]: Finished difference Result 200 states and 252 transitions. [2022-01-31 20:58:50,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 20:58:50,589 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 43 [2022-01-31 20:58:50,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:50,589 INFO L225 Difference]: With dead ends: 200 [2022-01-31 20:58:50,589 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 20:58:50,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=199, Invalid=1056, Unknown=5, NotChecked=0, Total=1260 [2022-01-31 20:58:50,591 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:50,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 88 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 424 Invalid, 0 Unknown, 42 Unchecked, 0.2s Time] [2022-01-31 20:58:50,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 20:58:50,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 20:58:50,592 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:58:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 20:58:50,592 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2022-01-31 20:58:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:50,592 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 20:58:50,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (6), 5 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:58:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 20:58:50,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 20:58:50,594 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 20:58:50,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 20:58:50,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 20:59:08,055 WARN L228 SmtUtils]: Spent 17.38s on a formula simplification. DAG size of input: 76 DAG size of output: 25 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 20:59:18,428 WARN L228 SmtUtils]: Spent 7.76s on a formula simplification. DAG size of input: 71 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 20:59:32,407 WARN L228 SmtUtils]: Spent 13.97s on a formula simplification. DAG size of input: 76 DAG size of output: 25 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 20:59:56,090 WARN L228 SmtUtils]: Spent 20.96s on a formula simplification. DAG size of input: 76 DAG size of output: 25 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 20:59:56,096 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-01-31 20:59:56,096 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-01-31 20:59:56,096 INFO L858 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-01-31 20:59:56,096 INFO L858 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-01-31 20:59:56,096 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-01-31 20:59:56,096 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-01-31 20:59:56,096 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-01-31 20:59:56,096 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 24 48) the Hoare annotation is: true [2022-01-31 20:59:56,096 INFO L854 garLoopResultBuilder]: At program point L36-2(lines 36 38) the Hoare annotation is: (let ((.cse0 (* main_~i~0 2))) (or (and (< main_~j~0 main_~n~0) (= main_~k~0 main_~j~0) (<= .cse0 main_~k~0)) (and (<= (+ .cse0 1) main_~k~0) (<= main_~k~0 main_~n~0) (<= .cse0 main_~j~0)))) [2022-01-31 20:59:56,096 INFO L861 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-01-31 20:59:56,097 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= (* main_~i~0 2) main_~j~0) (<= main_~n~0 main_~k~0)) [2022-01-31 20:59:56,097 INFO L854 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= (* main_~i~0 2) main_~j~0) (<= main_~n~0 main_~k~0)) [2022-01-31 20:59:56,097 INFO L854 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (* main_~i~0 2))) (or (and (< main_~j~0 main_~n~0) (= main_~k~0 main_~j~0) (<= .cse0 main_~k~0)) (and (<= (+ .cse0 1) main_~k~0) (< main_~k~0 main_~n~0) (<= .cse0 main_~j~0)))) [2022-01-31 20:59:56,097 INFO L854 garLoopResultBuilder]: At program point L37-1(lines 36 38) the Hoare annotation is: (let ((.cse0 (* main_~i~0 2))) (or (and (< main_~j~0 main_~n~0) (= main_~k~0 main_~j~0) (<= .cse0 main_~k~0)) (and (<= (+ .cse0 1) main_~k~0) (< main_~k~0 main_~n~0) (<= .cse0 main_~j~0)))) [2022-01-31 20:59:56,097 INFO L854 garLoopResultBuilder]: At program point L33-2(lines 33 45) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= (* main_~i~0 2) main_~j~0) (<= main_~n~0 main_~k~0)) [2022-01-31 20:59:56,097 INFO L854 garLoopResultBuilder]: At program point L33-3(lines 33 45) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2022-01-31 20:59:56,097 INFO L861 garLoopResultBuilder]: At program point L29(lines 29 32) the Hoare annotation is: true [2022-01-31 20:59:56,097 INFO L854 garLoopResultBuilder]: At program point L29-1(lines 29 32) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2022-01-31 20:59:56,097 INFO L861 garLoopResultBuilder]: At program point L46(lines 24 48) the Hoare annotation is: true [2022-01-31 20:59:56,097 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 24 48) the Hoare annotation is: true [2022-01-31 20:59:56,097 INFO L854 garLoopResultBuilder]: At program point L42(lines 34 44) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= (* main_~i~0 2) main_~j~0) (<= main_~n~0 main_~k~0)) [2022-01-31 20:59:56,097 INFO L854 garLoopResultBuilder]: At program point L34-2(lines 34 44) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= (* main_~i~0 2) main_~j~0) (<= main_~n~0 main_~k~0)) [2022-01-31 20:59:56,097 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 24 48) the Hoare annotation is: true [2022-01-31 20:59:56,097 INFO L854 garLoopResultBuilder]: At program point L35(lines 35 43) the Hoare annotation is: (and (<= |main_#t~nondet5| 2147483647) (<= 0 (+ 2147483648 |main_#t~nondet5|)) (< main_~j~0 main_~n~0) (<= main_~k~0 main_~n~0) (<= (* main_~i~0 2) main_~j~0) (<= main_~n~0 main_~k~0)) [2022-01-31 20:59:56,098 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 20:59:56,098 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:59:56,098 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 20:59:56,098 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 20:59:56,098 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 20:59:56,098 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 20:59:56,098 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 20:59:56,098 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (and (or (forall ((v_main_~i~0_29 Int) (v_main_~k~0_66 Int)) (or (not (<= (+ (* v_main_~i~0_29 2) 1) v_main_~k~0_66)) (not (< v_main_~k~0_66 main_~n~0)))) (not (= |__VERIFIER_assert_#in~cond| 1)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-01-31 20:59:56,098 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-01-31 20:59:56,098 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (and (or (forall ((v_main_~i~0_29 Int) (v_main_~k~0_66 Int)) (or (not (<= (+ (* v_main_~i~0_29 2) 1) v_main_~k~0_66)) (not (< v_main_~k~0_66 main_~n~0)))) (not (= |__VERIFIER_assert_#in~cond| 1)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-01-31 20:59:56,098 INFO L854 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 20:59:56,098 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 20:59:56,098 INFO L854 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (and (or (forall ((v_main_~i~0_29 Int) (v_main_~k~0_66 Int)) (or (not (<= (+ (* v_main_~i~0_29 2) 1) v_main_~k~0_66)) (not (< v_main_~k~0_66 main_~n~0)))) (not (= |__VERIFIER_assert_#in~cond| 1)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-01-31 20:59:56,100 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-01-31 20:59:56,101 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 20:59:56,117 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_29,QUANTIFIED] [2022-01-31 20:59:56,117 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_66,QUANTIFIED] [2022-01-31 20:59:56,117 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_66,QUANTIFIED] [2022-01-31 20:59:56,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:59:56 BoogieIcfgContainer [2022-01-31 20:59:56,118 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 20:59:56,119 INFO L158 Benchmark]: Toolchain (without parser) took 86226.28ms. Allocated memory was 186.6MB in the beginning and 293.6MB in the end (delta: 107.0MB). Free memory was 132.0MB in the beginning and 242.7MB in the end (delta: -110.7MB). Peak memory consumption was 142.6MB. Max. memory is 8.0GB. [2022-01-31 20:59:56,119 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 148.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 20:59:56,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.52ms. Allocated memory is still 186.6MB. Free memory was 131.8MB in the beginning and 157.7MB in the end (delta: -25.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-31 20:59:56,119 INFO L158 Benchmark]: Boogie Preprocessor took 28.37ms. Allocated memory is still 186.6MB. Free memory was 157.7MB in the beginning and 156.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 20:59:56,119 INFO L158 Benchmark]: RCFGBuilder took 181.54ms. Allocated memory is still 186.6MB. Free memory was 156.6MB in the beginning and 145.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 20:59:56,120 INFO L158 Benchmark]: TraceAbstraction took 85854.73ms. Allocated memory was 186.6MB in the beginning and 293.6MB in the end (delta: 107.0MB). Free memory was 145.1MB in the beginning and 242.7MB in the end (delta: -97.6MB). Peak memory consumption was 156.7MB. Max. memory is 8.0GB. [2022-01-31 20:59:56,123 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.13ms. Allocated memory is still 186.6MB. Free memory is still 148.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 158.52ms. Allocated memory is still 186.6MB. Free memory was 131.8MB in the beginning and 157.7MB in the end (delta: -25.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.37ms. Allocated memory is still 186.6MB. Free memory was 157.7MB in the beginning and 156.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 181.54ms. Allocated memory is still 186.6MB. Free memory was 156.6MB in the beginning and 145.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 85854.73ms. Allocated memory was 186.6MB in the beginning and 293.6MB in the end (delta: 107.0MB). Free memory was 145.1MB in the beginning and 242.7MB in the end (delta: -97.6MB). Peak memory consumption was 156.7MB. 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_main_~i~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_66,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: 19]: 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 85.8s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 65.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 334 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 325 mSDsluCounter, 424 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 163 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1759 IncrementalHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 166 mSDtfsCounter, 1759 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 62 SyntacticMatches, 16 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 17.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=6, InterpolantAutomatonStates: 97, 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, 56 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 282 PreInvPairs, 386 NumberOfFragments, 303 HoareAnnotationTreeSize, 282 FomulaSimplifications, 249 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 30 FomulaSimplificationsInter, 3967 FormulaSimplificationTreeSizeReductionInter, 65.4s 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: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: k <= n && n <= k - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((j < n && k == j) && i * 2 <= k) || ((i * 2 + 1 <= k && k <= n) && i * 2 <= j) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (k <= n && i * 2 <= j) && n <= k - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert [2022-01-31 20:59:56,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_29,QUANTIFIED] [2022-01-31 20:59:56,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_66,QUANTIFIED] [2022-01-31 20:59:56,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_66,QUANTIFIED] [2022-01-31 20:59:56,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_29,QUANTIFIED] [2022-01-31 20:59:56,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_66,QUANTIFIED] [2022-01-31 20:59:56,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_66,QUANTIFIED] Derived contract for procedure __VERIFIER_assert: (((forall v_main_~i~0_29 : int, v_main_~k~0_66 : int :: !(v_main_~i~0_29 * 2 + 1 <= v_main_~k~0_66) || !(v_main_~k~0_66 < n)) || !(\old(cond) == 1)) || \old(cond) == cond) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-01-31 20:59:56,186 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...