/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:05:57,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:05:57,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:05:57,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:05:57,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:05:57,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:05:57,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:05:57,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:05:57,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:05:57,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:05:57,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:05:57,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:05:57,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:05:57,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:05:57,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:05:57,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:05:57,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:05:57,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:05:57,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:05:57,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:05:57,210 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:05:57,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:05:57,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:05:57,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:05:57,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:05:57,220 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:05:57,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:05:57,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:05:57,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:05:57,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:05:57,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:05:57,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:05:57,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:05:57,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:05:57,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:05:57,227 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:05:57,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:05:57,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:05:57,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:05:57,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:05:57,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:05:57,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:05:57,231 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:05:57,242 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:05:57,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:05:57,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:05:57,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:05:57,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:05:57,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:05:57,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:05:57,244 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:05:57,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:05:57,245 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:05:57,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:05:57,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:05:57,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:05:57,246 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:05:57,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:05:57,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:05:57,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:05:57,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:05:57,246 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:05:57,246 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:05:57,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:05:57,246 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:05:57,247 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:05:57,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:05:57,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:05:57,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:05:57,513 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:05:57,514 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:05:57,515 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2022-04-15 13:05:57,573 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7219b101/1e26f4e3dc2a43f7bd412485c717bd3f/FLAGc23105e2d [2022-04-15 13:05:57,949 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:05:57,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2022-04-15 13:05:57,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7219b101/1e26f4e3dc2a43f7bd412485c717bd3f/FLAGc23105e2d [2022-04-15 13:05:58,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7219b101/1e26f4e3dc2a43f7bd412485c717bd3f [2022-04-15 13:05:58,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:05:58,388 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:05:58,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:05:58,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:05:58,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:05:58,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:05:58" (1/1) ... [2022-04-15 13:05:58,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2642fbc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:58, skipping insertion in model container [2022-04-15 13:05:58,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:05:58" (1/1) ... [2022-04-15 13:05:58,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:05:58,420 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:05:58,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2022-04-15 13:05:58,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:05:58,594 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:05:58,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2022-04-15 13:05:58,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:05:58,626 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:05:58,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:58 WrapperNode [2022-04-15 13:05:58,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:05:58,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:05:58,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:05:58,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:05:58,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:58" (1/1) ... [2022-04-15 13:05:58,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:58" (1/1) ... [2022-04-15 13:05:58,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:58" (1/1) ... [2022-04-15 13:05:58,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:58" (1/1) ... [2022-04-15 13:05:58,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:58" (1/1) ... [2022-04-15 13:05:58,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:58" (1/1) ... [2022-04-15 13:05:58,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:58" (1/1) ... [2022-04-15 13:05:58,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:05:58,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:05:58,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:05:58,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:05:58,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:58" (1/1) ... [2022-04-15 13:05:58,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:05:58,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:05:58,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 13:05:58,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 13:05:58,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:05:58,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:05:58,720 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:05:58,720 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:05:58,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:05:58,720 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:05:58,721 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:05:58,721 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:05:58,721 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:05:58,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:05:58,723 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:05:58,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 13:05:58,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:05:58,723 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:05:58,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:05:58,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:05:58,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:05:58,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:05:58,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:05:58,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:05:58,775 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:05:58,776 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:05:58,918 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:05:58,925 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:05:58,925 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 13:05:58,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:05:58 BoogieIcfgContainer [2022-04-15 13:05:58,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:05:58,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:05:58,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:05:58,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:05:58,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:05:58" (1/3) ... [2022-04-15 13:05:58,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584a7af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:05:58, skipping insertion in model container [2022-04-15 13:05:58,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:58" (2/3) ... [2022-04-15 13:05:58,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584a7af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:05:58, skipping insertion in model container [2022-04-15 13:05:58,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:05:58" (3/3) ... [2022-04-15 13:05:58,934 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2022-04-15 13:05:58,938 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:05:58,939 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:05:58,975 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:05:58,988 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 13:05:58,988 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:05:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:05:59,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 13:05:59,037 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:59,038 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:59,039 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:59,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1039138334, now seen corresponding path program 1 times [2022-04-15 13:05:59,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:59,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1380924183] [2022-04-15 13:05:59,063 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:05:59,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1039138334, now seen corresponding path program 2 times [2022-04-15 13:05:59,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:59,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008050894] [2022-04-15 13:05:59,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:59,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:59,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:59,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {35#true} is VALID [2022-04-15 13:05:59,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-15 13:05:59,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #90#return; {35#true} is VALID [2022-04-15 13:05:59,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:05:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:59,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 13:05:59,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 13:05:59,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 13:05:59,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #86#return; {36#false} is VALID [2022-04-15 13:05:59,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {44#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:59,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {35#true} is VALID [2022-04-15 13:05:59,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-15 13:05:59,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #90#return; {35#true} is VALID [2022-04-15 13:05:59,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2022-04-15 13:05:59,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-15 13:05:59,248 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {35#true} is VALID [2022-04-15 13:05:59,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 13:05:59,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 13:05:59,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 13:05:59,249 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #86#return; {36#false} is VALID [2022-04-15 13:05:59,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {36#false} is VALID [2022-04-15 13:05:59,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#false} assume !false;~st~0 := 1;~c~0 := 0; {36#false} is VALID [2022-04-15 13:05:59,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-04-15 13:05:59,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {36#false} is VALID [2022-04-15 13:05:59,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume ~c~0 == ~last~0 && 0 == ~st~0;~a~0 := 1 + ~a~0; {36#false} is VALID [2022-04-15 13:05:59,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} assume ~d~0 == ~SIZE~0;~a~0 := 0;~b~0 := 1; {36#false} is VALID [2022-04-15 13:05:59,251 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {36#false} is VALID [2022-04-15 13:05:59,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-15 13:05:59,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-15 13:05:59,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-15 13:05:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:59,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:59,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008050894] [2022-04-15 13:05:59,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008050894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:59,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:59,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:05:59,258 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:59,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1380924183] [2022-04-15 13:05:59,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1380924183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:59,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:59,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:05:59,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99208218] [2022-04-15 13:05:59,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:59,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-15 13:05:59,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:59,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:59,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:59,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:05:59,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:59,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:05:59,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:05:59,350 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:59,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:59,520 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-04-15 13:05:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:05:59,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-15 13:05:59,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:59,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-15 13:05:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-15 13:05:59,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-04-15 13:05:59,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:59,641 INFO L225 Difference]: With dead ends: 50 [2022-04-15 13:05:59,641 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 13:05:59,644 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:05:59,648 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:59,649 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:05:59,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 13:05:59,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 13:05:59,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:59,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:59,678 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:59,679 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:59,682 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-15 13:05:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 13:05:59,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:59,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:59,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 13:05:59,683 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 13:05:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:59,686 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-15 13:05:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 13:05:59,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:59,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:59,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:59,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:59,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-15 13:05:59,691 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2022-04-15 13:05:59,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:59,691 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-15 13:05:59,692 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:59,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions. [2022-04-15 13:05:59,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 13:05:59,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 13:05:59,726 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:59,726 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:59,726 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:05:59,726 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:59,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:59,728 INFO L85 PathProgramCache]: Analyzing trace with hash 677978447, now seen corresponding path program 1 times [2022-04-15 13:05:59,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:59,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [319049365] [2022-04-15 13:05:59,729 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:05:59,729 INFO L85 PathProgramCache]: Analyzing trace with hash 677978447, now seen corresponding path program 2 times [2022-04-15 13:05:59,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:59,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368106633] [2022-04-15 13:05:59,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:59,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:59,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:59,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:05:59,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#(<= 20 ~SIZE~0)} assume true; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:05:59,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {260#(<= 20 ~SIZE~0)} {255#true} #90#return; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:05:59,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:05:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:59,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {255#true} ~cond := #in~cond; {255#true} is VALID [2022-04-15 13:05:59,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {255#true} assume !(0 == ~cond); {255#true} is VALID [2022-04-15 13:05:59,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {255#true} assume true; {255#true} is VALID [2022-04-15 13:05:59,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {255#true} {260#(<= 20 ~SIZE~0)} #86#return; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:05:59,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {255#true} call ULTIMATE.init(); {266#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:59,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:05:59,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#(<= 20 ~SIZE~0)} assume true; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:05:59,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {260#(<= 20 ~SIZE~0)} {255#true} #90#return; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:05:59,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {260#(<= 20 ~SIZE~0)} call #t~ret7 := main(); {260#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:05:59,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#(<= 20 ~SIZE~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:05:59,900 INFO L272 TraceCheckUtils]: 6: Hoare triple {260#(<= 20 ~SIZE~0)} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {255#true} is VALID [2022-04-15 13:05:59,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {255#true} ~cond := #in~cond; {255#true} is VALID [2022-04-15 13:05:59,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {255#true} assume !(0 == ~cond); {255#true} is VALID [2022-04-15 13:05:59,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {255#true} assume true; {255#true} is VALID [2022-04-15 13:05:59,902 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {255#true} {260#(<= 20 ~SIZE~0)} #86#return; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:05:59,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {260#(<= 20 ~SIZE~0)} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:05:59,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {260#(<= 20 ~SIZE~0)} assume !false;~st~0 := 1;~c~0 := 0; {265#(and (<= 20 ~SIZE~0) (= main_~c~0 0))} is VALID [2022-04-15 13:05:59,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#(and (<= 20 ~SIZE~0) (= main_~c~0 0))} assume !(~c~0 < ~SIZE~0); {256#false} is VALID [2022-04-15 13:05:59,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {256#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {256#false} is VALID [2022-04-15 13:05:59,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {256#false} assume ~c~0 == ~last~0 && 0 == ~st~0;~a~0 := 1 + ~a~0; {256#false} is VALID [2022-04-15 13:05:59,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {256#false} assume ~d~0 == ~SIZE~0;~a~0 := 0;~b~0 := 1; {256#false} is VALID [2022-04-15 13:05:59,904 INFO L272 TraceCheckUtils]: 17: Hoare triple {256#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {256#false} is VALID [2022-04-15 13:05:59,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {256#false} ~cond := #in~cond; {256#false} is VALID [2022-04-15 13:05:59,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {256#false} assume 0 == ~cond; {256#false} is VALID [2022-04-15 13:05:59,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {256#false} assume !false; {256#false} is VALID [2022-04-15 13:05:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:59,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:59,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368106633] [2022-04-15 13:05:59,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368106633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:59,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:59,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:05:59,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:59,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [319049365] [2022-04-15 13:05:59,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [319049365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:59,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:59,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:05:59,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827168928] [2022-04-15 13:05:59,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:59,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 13:05:59,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:59,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:59,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:59,927 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:05:59,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:59,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:05:59,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:05:59,929 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:00,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:00,133 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-15 13:06:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:06:00,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 13:06:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-15 13:06:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-15 13:06:00,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2022-04-15 13:06:00,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:00,193 INFO L225 Difference]: With dead ends: 46 [2022-04-15 13:06:00,193 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 13:06:00,194 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:06:00,197 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:00,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 25 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:06:00,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 13:06:00,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-04-15 13:06:00,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:00,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:00,223 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:00,223 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:00,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:00,225 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-15 13:06:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-15 13:06:00,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:00,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:00,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-15 13:06:00,226 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-15 13:06:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:00,229 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-15 13:06:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-15 13:06:00,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:00,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:00,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:00,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-15 13:06:00,231 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 21 [2022-04-15 13:06:00,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:00,231 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-15 13:06:00,232 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:00,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-15 13:06:00,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-15 13:06:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 13:06:00,267 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:00,267 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:00,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:06:00,267 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:00,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:00,268 INFO L85 PathProgramCache]: Analyzing trace with hash -673447056, now seen corresponding path program 1 times [2022-04-15 13:06:00,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:00,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [771619601] [2022-04-15 13:06:00,440 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:00,443 INFO L85 PathProgramCache]: Analyzing trace with hash 315662187, now seen corresponding path program 1 times [2022-04-15 13:06:00,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:00,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590349799] [2022-04-15 13:06:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:00,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:00,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:00,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {482#true} is VALID [2022-04-15 13:06:00,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#true} assume true; {482#true} is VALID [2022-04-15 13:06:00,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {482#true} {482#true} #90#return; {482#true} is VALID [2022-04-15 13:06:00,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:06:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:00,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {482#true} ~cond := #in~cond; {482#true} is VALID [2022-04-15 13:06:00,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#true} assume !(0 == ~cond); {482#true} is VALID [2022-04-15 13:06:00,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#true} assume true; {482#true} is VALID [2022-04-15 13:06:00,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} #86#return; {482#true} is VALID [2022-04-15 13:06:00,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {482#true} call ULTIMATE.init(); {492#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:00,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {482#true} is VALID [2022-04-15 13:06:00,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#true} assume true; {482#true} is VALID [2022-04-15 13:06:00,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} #90#return; {482#true} is VALID [2022-04-15 13:06:00,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {482#true} call #t~ret7 := main(); {482#true} is VALID [2022-04-15 13:06:00,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {482#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {482#true} is VALID [2022-04-15 13:06:00,510 INFO L272 TraceCheckUtils]: 6: Hoare triple {482#true} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {482#true} is VALID [2022-04-15 13:06:00,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {482#true} ~cond := #in~cond; {482#true} is VALID [2022-04-15 13:06:00,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {482#true} assume !(0 == ~cond); {482#true} is VALID [2022-04-15 13:06:00,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {482#true} assume true; {482#true} is VALID [2022-04-15 13:06:00,511 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {482#true} {482#true} #86#return; {482#true} is VALID [2022-04-15 13:06:00,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {482#true} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {482#true} is VALID [2022-04-15 13:06:00,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {482#true} assume !false;~st~0 := 1;~c~0 := 0; {482#true} is VALID [2022-04-15 13:06:00,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {482#true} [94] L25-3-->L25-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_In_1 v_main_~c~0_Out_2))) (or (and (= v_main_~c~0_Out_2 0) (<= (+ v_~last~0_In_1 1) v_main_~c~0_Out_2) (= |v_main_#t~post5_Out_2| 0) (< v_main_~c~0_Out_2 (+ v_~SIZE~0_In_1 1)) (= v_main_~st~0_Out_2 0) .cse0 (= v_~last~0_In_1 0)) (and (= v_~last~0_In_1 v_~last~0_In_1) (= v_~SIZE~0_In_1 v_~SIZE~0_In_1) .cse0))) InVars {~SIZE~0=v_~SIZE~0_In_1, main_~c~0=v_main_~c~0_In_1, ~last~0=v_~last~0_In_1} OutVars{~SIZE~0=v_~SIZE~0_In_1, main_#t~post5=|v_main_#t~post5_Out_2|, main_~c~0=v_main_~c~0_Out_2, main_~st~0=v_main_~st~0_Out_2, ~last~0=v_~last~0_In_1} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {482#true} is VALID [2022-04-15 13:06:00,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#true} [93] L25-4_primed-->L25-4: Formula: (not (< v_main_~c~0_11 v_~SIZE~0_3)) InVars {~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} OutVars{~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-15 13:06:00,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {482#true} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {491#(<= (+ ~last~0 1) main_~c~0)} is VALID [2022-04-15 13:06:00,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {491#(<= (+ ~last~0 1) main_~c~0)} assume ~c~0 == ~last~0 && 0 == ~st~0;~a~0 := 1 + ~a~0; {483#false} is VALID [2022-04-15 13:06:00,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {483#false} assume ~d~0 == ~SIZE~0;~a~0 := 0;~b~0 := 1; {483#false} is VALID [2022-04-15 13:06:00,513 INFO L272 TraceCheckUtils]: 18: Hoare triple {483#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {483#false} is VALID [2022-04-15 13:06:00,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {483#false} ~cond := #in~cond; {483#false} is VALID [2022-04-15 13:06:00,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {483#false} assume 0 == ~cond; {483#false} is VALID [2022-04-15 13:06:00,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {483#false} assume !false; {483#false} is VALID [2022-04-15 13:06:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:00,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:00,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590349799] [2022-04-15 13:06:00,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590349799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:00,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:00,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:06:00,586 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:00,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [771619601] [2022-04-15 13:06:00,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [771619601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:00,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:00,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:06:00,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914057762] [2022-04-15 13:06:00,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:00,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-15 13:06:00,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:00,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:06:00,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:00,608 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:06:00,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:00,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:06:00,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:06:00,609 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:06:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:01,029 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2022-04-15 13:06:01,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:06:01,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-15 13:06:01,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:06:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-15 13:06:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:06:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-15 13:06:01,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 80 transitions. [2022-04-15 13:06:01,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:01,100 INFO L225 Difference]: With dead ends: 59 [2022-04-15 13:06:01,100 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 13:06:01,100 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:06:01,101 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:01,102 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 45 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:06:01,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 13:06:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2022-04-15 13:06:01,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:01,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:01,139 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:01,139 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:01,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:01,142 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-04-15 13:06:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-04-15 13:06:01,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:01,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:01,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 43 states. [2022-04-15 13:06:01,144 INFO L87 Difference]: Start difference. First operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 43 states. [2022-04-15 13:06:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:01,146 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-04-15 13:06:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-04-15 13:06:01,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:01,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:01,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:01,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-04-15 13:06:01,149 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 24 [2022-04-15 13:06:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:01,149 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-04-15 13:06:01,149 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:06:01,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 43 transitions. [2022-04-15 13:06:01,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-15 13:06:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 13:06:01,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:01,189 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:01,190 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:06:01,190 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:01,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:01,190 INFO L85 PathProgramCache]: Analyzing trace with hash 708533296, now seen corresponding path program 1 times [2022-04-15 13:06:01,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:01,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2021336697] [2022-04-15 13:06:01,273 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:01,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1961381293, now seen corresponding path program 1 times [2022-04-15 13:06:01,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:01,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014410515] [2022-04-15 13:06:01,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:01,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:01,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:01,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {784#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {774#true} is VALID [2022-04-15 13:06:01,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 13:06:01,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {774#true} {774#true} #90#return; {774#true} is VALID [2022-04-15 13:06:01,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:06:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:01,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-15 13:06:01,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-15 13:06:01,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 13:06:01,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #86#return; {774#true} is VALID [2022-04-15 13:06:01,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {784#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:01,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {774#true} is VALID [2022-04-15 13:06:01,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 13:06:01,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #90#return; {774#true} is VALID [2022-04-15 13:06:01,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret7 := main(); {774#true} is VALID [2022-04-15 13:06:01,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {774#true} is VALID [2022-04-15 13:06:01,360 INFO L272 TraceCheckUtils]: 6: Hoare triple {774#true} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {774#true} is VALID [2022-04-15 13:06:01,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-15 13:06:01,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-15 13:06:01,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 13:06:01,363 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {774#true} {774#true} #86#return; {774#true} is VALID [2022-04-15 13:06:01,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {774#true} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {774#true} is VALID [2022-04-15 13:06:01,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {774#true} assume !false;~st~0 := 1;~c~0 := 0; {783#(= main_~st~0 1)} is VALID [2022-04-15 13:06:01,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#(= main_~st~0 1)} [96] L25-3-->L25-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_In_2 v_main_~c~0_Out_4))) (or (and (= v_~SIZE~0_In_2 v_~SIZE~0_In_2) (= v_~last~0_In_2 v_~last~0_In_2) .cse0) (and (= |v_main_#t~post5_Out_4| 0) .cse0 (< v_main_~c~0_Out_4 (+ v_~SIZE~0_In_2 1)) (< v_main_~c~0_Out_4 (+ v_~last~0_In_2 1)) (= v_main_~c~0_Out_4 0) (= v_~last~0_In_2 0)))) InVars {~SIZE~0=v_~SIZE~0_In_2, main_~c~0=v_main_~c~0_In_2, ~last~0=v_~last~0_In_2} OutVars{~SIZE~0=v_~SIZE~0_In_2, main_#t~post5=|v_main_#t~post5_Out_4|, main_~c~0=v_main_~c~0_Out_4, ~last~0=v_~last~0_In_2} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {783#(= main_~st~0 1)} is VALID [2022-04-15 13:06:01,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#(= main_~st~0 1)} [95] L25-4_primed-->L25-4: Formula: (not (< v_main_~c~0_11 v_~SIZE~0_3)) InVars {~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} OutVars{~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} AuxVars[] AssignedVars[] {783#(= main_~st~0 1)} is VALID [2022-04-15 13:06:01,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#(= main_~st~0 1)} assume !(0 == ~st~0 && ~c~0 == 1 + ~last~0);~a~0 := 2 + ~a~0;~b~0 := 2 + ~b~0; {783#(= main_~st~0 1)} is VALID [2022-04-15 13:06:01,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {783#(= main_~st~0 1)} assume ~c~0 == ~last~0 && 0 == ~st~0;~a~0 := 1 + ~a~0; {775#false} is VALID [2022-04-15 13:06:01,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {775#false} assume ~d~0 == ~SIZE~0;~a~0 := 0;~b~0 := 1; {775#false} is VALID [2022-04-15 13:06:01,365 INFO L272 TraceCheckUtils]: 18: Hoare triple {775#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {775#false} is VALID [2022-04-15 13:06:01,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-15 13:06:01,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-15 13:06:01,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-15 13:06:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:01,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014410515] [2022-04-15 13:06:01,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014410515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:01,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:01,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:06:01,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:01,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2021336697] [2022-04-15 13:06:01,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2021336697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:01,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:01,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:06:01,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690281020] [2022-04-15 13:06:01,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:01,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-15 13:06:01,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:01,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:06:01,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:01,433 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:06:01,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:01,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:06:01,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:06:01,435 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:06:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:01,893 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2022-04-15 13:06:01,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:06:01,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-15 13:06:01,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:06:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-15 13:06:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:06:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-15 13:06:01,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 75 transitions. [2022-04-15 13:06:01,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:01,971 INFO L225 Difference]: With dead ends: 64 [2022-04-15 13:06:01,971 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 13:06:01,972 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:06:01,973 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 20 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:01,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 57 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:06:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 13:06:02,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-15 13:06:02,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:02,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:02,019 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:02,019 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:02,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:02,022 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-15 13:06:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-04-15 13:06:02,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:02,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:02,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 13:06:02,023 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 13:06:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:02,025 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-15 13:06:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-04-15 13:06:02,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:02,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:02,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:02,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:02,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-04-15 13:06:02,027 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 24 [2022-04-15 13:06:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:02,028 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-04-15 13:06:02,028 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:06:02,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 40 transitions. [2022-04-15 13:06:02,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-15 13:06:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 13:06:02,069 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:02,069 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:02,069 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 13:06:02,069 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:02,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:02,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2061972965, now seen corresponding path program 1 times [2022-04-15 13:06:02,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:02,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [829658800] [2022-04-15 13:06:02,212 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:02,214 INFO L85 PathProgramCache]: Analyzing trace with hash -890294784, now seen corresponding path program 1 times [2022-04-15 13:06:02,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:02,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105695118] [2022-04-15 13:06:02,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:02,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:02,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {1081#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {1082#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:02,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {1082#(<= 20 ~SIZE~0)} assume true; {1082#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:02,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1082#(<= 20 ~SIZE~0)} {1070#true} #90#return; {1075#(not (= ~SIZE~0 0))} is VALID [2022-04-15 13:06:02,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:06:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:02,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {1070#true} ~cond := #in~cond; {1070#true} is VALID [2022-04-15 13:06:02,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#true} assume !(0 == ~cond); {1070#true} is VALID [2022-04-15 13:06:02,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-15 13:06:02,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1075#(not (= ~SIZE~0 0))} #86#return; {1075#(not (= ~SIZE~0 0))} is VALID [2022-04-15 13:06:02,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1081#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:02,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {1081#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {1082#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:02,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {1082#(<= 20 ~SIZE~0)} assume true; {1082#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:02,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1082#(<= 20 ~SIZE~0)} {1070#true} #90#return; {1075#(not (= ~SIZE~0 0))} is VALID [2022-04-15 13:06:02,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {1075#(not (= ~SIZE~0 0))} call #t~ret7 := main(); {1075#(not (= ~SIZE~0 0))} is VALID [2022-04-15 13:06:02,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {1075#(not (= ~SIZE~0 0))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {1075#(not (= ~SIZE~0 0))} is VALID [2022-04-15 13:06:02,325 INFO L272 TraceCheckUtils]: 6: Hoare triple {1075#(not (= ~SIZE~0 0))} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {1070#true} is VALID [2022-04-15 13:06:02,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {1070#true} ~cond := #in~cond; {1070#true} is VALID [2022-04-15 13:06:02,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {1070#true} assume !(0 == ~cond); {1070#true} is VALID [2022-04-15 13:06:02,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-15 13:06:02,328 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1070#true} {1075#(not (= ~SIZE~0 0))} #86#return; {1075#(not (= ~SIZE~0 0))} is VALID [2022-04-15 13:06:02,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {1075#(not (= ~SIZE~0 0))} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} is VALID [2022-04-15 13:06:02,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} assume !false;~st~0 := 1;~c~0 := 0; {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} is VALID [2022-04-15 13:06:02,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} [98] L25-3-->L25-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_In_3 v_main_~c~0_Out_6))) (or (and .cse0 (= v_~SIZE~0_In_3 v_~SIZE~0_In_3) (= v_~last~0_In_3 v_~last~0_In_3)) (and (< v_main_~c~0_Out_6 (+ v_~SIZE~0_In_3 1)) .cse0 (= v_main_~c~0_Out_6 0) (<= (+ v_~last~0_In_3 1) v_main_~c~0_Out_6) (= |v_main_#t~post5_Out_6| 0) (= v_main_~st~0_Out_4 0) (= v_~last~0_In_3 0)))) InVars {~SIZE~0=v_~SIZE~0_In_3, main_~c~0=v_main_~c~0_In_3, ~last~0=v_~last~0_In_3} OutVars{~SIZE~0=v_~SIZE~0_In_3, main_#t~post5=|v_main_#t~post5_Out_6|, main_~c~0=v_main_~c~0_Out_6, main_~st~0=v_main_~st~0_Out_4, ~last~0=v_~last~0_In_3} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} is VALID [2022-04-15 13:06:02,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} [97] L25-4_primed-->L25-4: Formula: (not (< v_main_~c~0_11 v_~SIZE~0_3)) InVars {~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} OutVars{~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} AuxVars[] AssignedVars[] {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} is VALID [2022-04-15 13:06:02,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} is VALID [2022-04-15 13:06:02,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} is VALID [2022-04-15 13:06:02,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} assume !(1 == ~st~0 && ~last~0 >= ~SIZE~0); {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} is VALID [2022-04-15 13:06:02,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} assume ~d~0 == ~SIZE~0;~a~0 := 0;~b~0 := 1; {1071#false} is VALID [2022-04-15 13:06:02,332 INFO L272 TraceCheckUtils]: 19: Hoare triple {1071#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {1071#false} is VALID [2022-04-15 13:06:02,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {1071#false} ~cond := #in~cond; {1071#false} is VALID [2022-04-15 13:06:02,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {1071#false} assume 0 == ~cond; {1071#false} is VALID [2022-04-15 13:06:02,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-15 13:06:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:02,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:02,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105695118] [2022-04-15 13:06:02,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105695118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:02,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:02,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:06:02,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:02,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [829658800] [2022-04-15 13:06:02,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [829658800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:02,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:02,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:06:02,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790079238] [2022-04-15 13:06:02,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:02,416 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 13:06:02,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:02,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:02,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:02,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:06:02,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:02,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:06:02,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:06:02,439 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:02,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:02,981 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2022-04-15 13:06:02,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 13:06:02,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 13:06:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:02,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-04-15 13:06:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-04-15 13:06:02,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2022-04-15 13:06:03,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:03,072 INFO L225 Difference]: With dead ends: 77 [2022-04-15 13:06:03,072 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 13:06:03,073 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:06:03,074 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 111 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:03,074 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 29 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:06:03,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 13:06:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2022-04-15 13:06:03,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:03,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 50 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 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-04-15 13:06:03,153 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 50 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 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-04-15 13:06:03,154 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 50 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 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-04-15 13:06:03,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:03,156 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-04-15 13:06:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-04-15 13:06:03,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:03,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:03,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 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) Second operand 55 states. [2022-04-15 13:06:03,159 INFO L87 Difference]: Start difference. First operand has 50 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 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) Second operand 55 states. [2022-04-15 13:06:03,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:03,161 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-04-15 13:06:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-04-15 13:06:03,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:03,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:03,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:03,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 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-04-15 13:06:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-15 13:06:03,166 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 25 [2022-04-15 13:06:03,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:03,167 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-15 13:06:03,167 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:03,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-15 13:06:03,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:03,230 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-15 13:06:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 13:06:03,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:03,231 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:03,231 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 13:06:03,231 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:03,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:03,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2060125923, now seen corresponding path program 1 times [2022-04-15 13:06:03,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:03,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1955482196] [2022-04-15 13:06:03,345 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:03,346 INFO L85 PathProgramCache]: Analyzing trace with hash -601416382, now seen corresponding path program 1 times [2022-04-15 13:06:03,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:03,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43636069] [2022-04-15 13:06:03,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:03,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:03,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:03,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {1478#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {1470#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:03,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {1470#(<= 20 ~SIZE~0)} assume true; {1470#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:03,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1470#(<= 20 ~SIZE~0)} {1465#true} #90#return; {1470#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:03,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:06:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:03,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {1465#true} ~cond := #in~cond; {1465#true} is VALID [2022-04-15 13:06:03,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {1465#true} assume !(0 == ~cond); {1465#true} is VALID [2022-04-15 13:06:03,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {1465#true} assume true; {1465#true} is VALID [2022-04-15 13:06:03,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1465#true} {1470#(<= 20 ~SIZE~0)} #86#return; {1470#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:03,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {1465#true} call ULTIMATE.init(); {1478#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:03,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {1478#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {1470#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:03,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {1470#(<= 20 ~SIZE~0)} assume true; {1470#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:03,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1470#(<= 20 ~SIZE~0)} {1465#true} #90#return; {1470#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:03,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {1470#(<= 20 ~SIZE~0)} call #t~ret7 := main(); {1470#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:03,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {1470#(<= 20 ~SIZE~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {1470#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:03,524 INFO L272 TraceCheckUtils]: 6: Hoare triple {1470#(<= 20 ~SIZE~0)} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {1465#true} is VALID [2022-04-15 13:06:03,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {1465#true} ~cond := #in~cond; {1465#true} is VALID [2022-04-15 13:06:03,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#true} assume !(0 == ~cond); {1465#true} is VALID [2022-04-15 13:06:03,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#true} assume true; {1465#true} is VALID [2022-04-15 13:06:03,525 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1465#true} {1470#(<= 20 ~SIZE~0)} #86#return; {1470#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:03,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {1470#(<= 20 ~SIZE~0)} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {1470#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:03,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {1470#(<= 20 ~SIZE~0)} assume !false;~st~0 := 1;~c~0 := 0; {1475#(and (<= 20 ~SIZE~0) (= main_~c~0 0))} is VALID [2022-04-15 13:06:03,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {1475#(and (<= 20 ~SIZE~0) (= main_~c~0 0))} [100] L25-3-->L25-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_In_4 v_main_~c~0_Out_8))) (or (and (= v_main_~c~0_Out_8 0) (= |v_main_#t~post5_Out_8| 0) (< v_main_~c~0_Out_8 (+ v_~SIZE~0_In_4 1)) .cse0 (<= (+ v_~last~0_In_4 1) v_main_~c~0_Out_8) (= v_main_~st~0_Out_6 0) (= v_~last~0_In_4 0)) (and .cse0 (= v_~last~0_In_4 v_~last~0_In_4) (= v_~SIZE~0_In_4 v_~SIZE~0_In_4)))) InVars {~SIZE~0=v_~SIZE~0_In_4, main_~c~0=v_main_~c~0_In_4, ~last~0=v_~last~0_In_4} OutVars{~SIZE~0=v_~SIZE~0_In_4, main_#t~post5=|v_main_#t~post5_Out_8|, main_~c~0=v_main_~c~0_Out_8, main_~st~0=v_main_~st~0_Out_6, ~last~0=v_~last~0_In_4} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {1476#(and (<= 20 ~SIZE~0) (or (<= ~last~0 0) (= main_~c~0 0)))} is VALID [2022-04-15 13:06:03,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {1476#(and (<= 20 ~SIZE~0) (or (<= ~last~0 0) (= main_~c~0 0)))} [99] L25-4_primed-->L25-4: Formula: (not (< v_main_~c~0_11 v_~SIZE~0_3)) InVars {~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} OutVars{~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} AuxVars[] AssignedVars[] {1477#(and (<= ~last~0 0) (<= 20 main_~c~0))} is VALID [2022-04-15 13:06:03,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {1477#(and (<= ~last~0 0) (<= 20 main_~c~0))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {1466#false} is VALID [2022-04-15 13:06:03,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {1466#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {1466#false} is VALID [2022-04-15 13:06:03,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {1466#false} assume !(1 == ~st~0 && ~last~0 >= ~SIZE~0); {1466#false} is VALID [2022-04-15 13:06:03,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {1466#false} assume !(~d~0 == ~SIZE~0); {1466#false} is VALID [2022-04-15 13:06:03,529 INFO L272 TraceCheckUtils]: 19: Hoare triple {1466#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {1466#false} is VALID [2022-04-15 13:06:03,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {1466#false} ~cond := #in~cond; {1466#false} is VALID [2022-04-15 13:06:03,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {1466#false} assume 0 == ~cond; {1466#false} is VALID [2022-04-15 13:06:03,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {1466#false} assume !false; {1466#false} is VALID [2022-04-15 13:06:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:03,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:03,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43636069] [2022-04-15 13:06:03,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43636069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:03,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:03,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:06:03,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:03,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1955482196] [2022-04-15 13:06:03,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1955482196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:03,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:03,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:06:03,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133298375] [2022-04-15 13:06:03,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:03,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 13:06:03,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:03,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:03,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:03,600 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:06:03,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:03,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:06:03,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:06:03,601 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:03,976 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2022-04-15 13:06:03,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:06:03,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 13:06:03,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 13:06:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 13:06:03,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-15 13:06:04,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:04,039 INFO L225 Difference]: With dead ends: 101 [2022-04-15 13:06:04,039 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 13:06:04,039 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:06:04,040 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:04,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 30 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:06:04,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 13:06:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2022-04-15 13:06:04,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:04,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 48 states have internal predecessors, (61), 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-04-15 13:06:04,127 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 48 states have internal predecessors, (61), 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-04-15 13:06:04,128 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 48 states have internal predecessors, (61), 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-04-15 13:06:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:04,130 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-15 13:06:04,130 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-15 13:06:04,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:04,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:04,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 48 states have internal predecessors, (61), 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) Second operand 63 states. [2022-04-15 13:06:04,131 INFO L87 Difference]: Start difference. First operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 48 states have internal predecessors, (61), 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) Second operand 63 states. [2022-04-15 13:06:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:04,133 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-15 13:06:04,133 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-15 13:06:04,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:04,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:04,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:04,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 48 states have internal predecessors, (61), 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-04-15 13:06:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-15 13:06:04,136 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 25 [2022-04-15 13:06:04,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:04,136 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-15 13:06:04,137 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:04,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-15 13:06:04,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-15 13:06:04,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 13:06:04,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:04,227 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:04,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 13:06:04,227 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:04,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:04,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2067453981, now seen corresponding path program 1 times [2022-04-15 13:06:04,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:04,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1061516275] [2022-04-15 13:06:04,306 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:04,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1182836992, now seen corresponding path program 1 times [2022-04-15 13:06:04,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:04,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696489458] [2022-04-15 13:06:04,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:04,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:04,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:04,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {1938#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {1931#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:04,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {1931#(<= 20 ~SIZE~0)} assume true; {1931#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:04,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1931#(<= 20 ~SIZE~0)} {1926#true} #90#return; {1931#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:04,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:06:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:04,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {1926#true} ~cond := #in~cond; {1926#true} is VALID [2022-04-15 13:06:04,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {1926#true} assume !(0 == ~cond); {1926#true} is VALID [2022-04-15 13:06:04,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {1926#true} assume true; {1926#true} is VALID [2022-04-15 13:06:04,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1926#true} {1931#(<= 20 ~SIZE~0)} #86#return; {1931#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:04,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {1926#true} call ULTIMATE.init(); {1938#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:04,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {1938#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {1931#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:04,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {1931#(<= 20 ~SIZE~0)} assume true; {1931#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:04,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1931#(<= 20 ~SIZE~0)} {1926#true} #90#return; {1931#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:04,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {1931#(<= 20 ~SIZE~0)} call #t~ret7 := main(); {1931#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:04,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {1931#(<= 20 ~SIZE~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {1931#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:04,393 INFO L272 TraceCheckUtils]: 6: Hoare triple {1931#(<= 20 ~SIZE~0)} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {1926#true} is VALID [2022-04-15 13:06:04,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {1926#true} ~cond := #in~cond; {1926#true} is VALID [2022-04-15 13:06:04,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {1926#true} assume !(0 == ~cond); {1926#true} is VALID [2022-04-15 13:06:04,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {1926#true} assume true; {1926#true} is VALID [2022-04-15 13:06:04,395 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1926#true} {1931#(<= 20 ~SIZE~0)} #86#return; {1931#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:04,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {1931#(<= 20 ~SIZE~0)} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {1936#(and (= main_~d~0 0) (<= 20 ~SIZE~0))} is VALID [2022-04-15 13:06:04,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#(and (= main_~d~0 0) (<= 20 ~SIZE~0))} assume !false;~st~0 := 1;~c~0 := 0; {1936#(and (= main_~d~0 0) (<= 20 ~SIZE~0))} is VALID [2022-04-15 13:06:04,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#(and (= main_~d~0 0) (<= 20 ~SIZE~0))} [102] L25-3-->L25-4_primed: Formula: (or (and (= v_~SIZE~0_In_5 v_~SIZE~0_In_5) (= v_~last~0_In_5 v_~last~0_In_5) (= v_main_~c~0_In_5 v_main_~c~0_Out_10)) (and (< v_main_~c~0_Out_10 (+ v_~last~0_In_5 1)) (= v_main_~c~0_Out_10 v_main_~c~0_In_5) (= v_main_~c~0_Out_10 0) (< v_main_~c~0_Out_10 (+ v_~SIZE~0_In_5 1)) (= v_~last~0_In_5 0) (= |v_main_#t~post5_Out_10| 0))) InVars {~SIZE~0=v_~SIZE~0_In_5, main_~c~0=v_main_~c~0_In_5, ~last~0=v_~last~0_In_5} OutVars{~SIZE~0=v_~SIZE~0_In_5, main_#t~post5=|v_main_#t~post5_Out_10|, main_~c~0=v_main_~c~0_Out_10, ~last~0=v_~last~0_In_5} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {1936#(and (= main_~d~0 0) (<= 20 ~SIZE~0))} is VALID [2022-04-15 13:06:04,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {1936#(and (= main_~d~0 0) (<= 20 ~SIZE~0))} [101] L25-4_primed-->L25-4: Formula: (not (< v_main_~c~0_11 v_~SIZE~0_3)) InVars {~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} OutVars{~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} AuxVars[] AssignedVars[] {1936#(and (= main_~d~0 0) (<= 20 ~SIZE~0))} is VALID [2022-04-15 13:06:04,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {1936#(and (= main_~d~0 0) (<= 20 ~SIZE~0))} assume !(0 == ~st~0 && ~c~0 == 1 + ~last~0);~a~0 := 2 + ~a~0;~b~0 := 2 + ~b~0; {1936#(and (= main_~d~0 0) (<= 20 ~SIZE~0))} is VALID [2022-04-15 13:06:04,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {1936#(and (= main_~d~0 0) (<= 20 ~SIZE~0))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {1936#(and (= main_~d~0 0) (<= 20 ~SIZE~0))} is VALID [2022-04-15 13:06:04,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {1936#(and (= main_~d~0 0) (<= 20 ~SIZE~0))} assume 1 == ~st~0 && ~last~0 >= ~SIZE~0;#t~post6 := ~d~0;~d~0 := 1 + #t~post6;havoc #t~post6; {1937#(<= (+ 19 main_~d~0) ~SIZE~0)} is VALID [2022-04-15 13:06:04,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {1937#(<= (+ 19 main_~d~0) ~SIZE~0)} assume ~d~0 == ~SIZE~0;~a~0 := 0;~b~0 := 1; {1927#false} is VALID [2022-04-15 13:06:04,404 INFO L272 TraceCheckUtils]: 19: Hoare triple {1927#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {1927#false} is VALID [2022-04-15 13:06:04,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {1927#false} ~cond := #in~cond; {1927#false} is VALID [2022-04-15 13:06:04,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {1927#false} assume 0 == ~cond; {1927#false} is VALID [2022-04-15 13:06:04,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {1927#false} assume !false; {1927#false} is VALID [2022-04-15 13:06:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:04,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:04,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696489458] [2022-04-15 13:06:04,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696489458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:04,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:04,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:06:04,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:04,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1061516275] [2022-04-15 13:06:04,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1061516275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:04,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:04,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:06:04,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688226984] [2022-04-15 13:06:04,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:04,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 13:06:04,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:04,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:04,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:04,495 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:06:04,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:04,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:06:04,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:06:04,496 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:05,132 INFO L93 Difference]: Finished difference Result 105 states and 135 transitions. [2022-04-15 13:06:05,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 13:06:05,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 13:06:05,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2022-04-15 13:06:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2022-04-15 13:06:05,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 96 transitions. [2022-04-15 13:06:05,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:05,230 INFO L225 Difference]: With dead ends: 105 [2022-04-15 13:06:05,230 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 13:06:05,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-15 13:06:05,231 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 85 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:05,231 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 42 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:06:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 13:06:05,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2022-04-15 13:06:05,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:05,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 75 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 66 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:06:05,359 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 75 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 66 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:06:05,359 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 75 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 66 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:06:05,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:05,362 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-15 13:06:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-15 13:06:05,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:05,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:05,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 66 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 80 states. [2022-04-15 13:06:05,363 INFO L87 Difference]: Start difference. First operand has 75 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 66 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 80 states. [2022-04-15 13:06:05,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:05,366 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-15 13:06:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-15 13:06:05,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:05,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:05,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:05,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 66 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:06:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2022-04-15 13:06:05,370 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 25 [2022-04-15 13:06:05,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:05,370 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2022-04-15 13:06:05,370 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:05,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 96 transitions. [2022-04-15 13:06:05,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2022-04-15 13:06:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 13:06:05,477 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:05,477 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:05,477 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 13:06:05,477 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:05,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:05,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2069301023, now seen corresponding path program 1 times [2022-04-15 13:06:05,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:05,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2068270098] [2022-04-15 13:06:05,549 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash -893958590, now seen corresponding path program 1 times [2022-04-15 13:06:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:05,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751075716] [2022-04-15 13:06:05,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:05,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:05,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {2484#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {2476#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:05,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {2476#(<= 20 ~SIZE~0)} assume true; {2476#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:05,663 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2476#(<= 20 ~SIZE~0)} {2471#true} #90#return; {2476#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:05,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:06:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:05,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {2471#true} ~cond := #in~cond; {2471#true} is VALID [2022-04-15 13:06:05,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {2471#true} assume !(0 == ~cond); {2471#true} is VALID [2022-04-15 13:06:05,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {2471#true} assume true; {2471#true} is VALID [2022-04-15 13:06:05,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2471#true} {2476#(<= 20 ~SIZE~0)} #86#return; {2476#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:05,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {2471#true} call ULTIMATE.init(); {2484#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:05,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {2484#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {2476#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:05,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {2476#(<= 20 ~SIZE~0)} assume true; {2476#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:05,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2476#(<= 20 ~SIZE~0)} {2471#true} #90#return; {2476#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:05,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {2476#(<= 20 ~SIZE~0)} call #t~ret7 := main(); {2476#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:05,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {2476#(<= 20 ~SIZE~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {2476#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:05,672 INFO L272 TraceCheckUtils]: 6: Hoare triple {2476#(<= 20 ~SIZE~0)} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {2471#true} is VALID [2022-04-15 13:06:05,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {2471#true} ~cond := #in~cond; {2471#true} is VALID [2022-04-15 13:06:05,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {2471#true} assume !(0 == ~cond); {2471#true} is VALID [2022-04-15 13:06:05,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {2471#true} assume true; {2471#true} is VALID [2022-04-15 13:06:05,672 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2471#true} {2476#(<= 20 ~SIZE~0)} #86#return; {2476#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:05,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {2476#(<= 20 ~SIZE~0)} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {2476#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:05,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {2476#(<= 20 ~SIZE~0)} assume !false;~st~0 := 1;~c~0 := 0; {2481#(and (<= 20 ~SIZE~0) (= main_~c~0 0))} is VALID [2022-04-15 13:06:05,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {2481#(and (<= 20 ~SIZE~0) (= main_~c~0 0))} [104] L25-3-->L25-4_primed: Formula: (or (and (= v_~last~0_In_6 v_~last~0_In_6) (= v_main_~c~0_In_6 v_main_~c~0_Out_12) (= v_~SIZE~0_In_6 v_~SIZE~0_In_6)) (and (= v_~last~0_In_6 0) (= |v_main_#t~post5_Out_12| 0) (= v_main_~c~0_Out_12 v_main_~c~0_In_6) (< v_main_~c~0_Out_12 (+ v_~last~0_In_6 1)) (< v_main_~c~0_Out_12 (+ v_~SIZE~0_In_6 1)) (= v_main_~c~0_Out_12 0))) InVars {~SIZE~0=v_~SIZE~0_In_6, main_~c~0=v_main_~c~0_In_6, ~last~0=v_~last~0_In_6} OutVars{~SIZE~0=v_~SIZE~0_In_6, main_#t~post5=|v_main_#t~post5_Out_12|, main_~c~0=v_main_~c~0_Out_12, ~last~0=v_~last~0_In_6} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {2482#(and (<= 20 ~SIZE~0) (or (<= ~last~0 0) (= main_~c~0 0)))} is VALID [2022-04-15 13:06:05,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {2482#(and (<= 20 ~SIZE~0) (or (<= ~last~0 0) (= main_~c~0 0)))} [103] L25-4_primed-->L25-4: Formula: (not (< v_main_~c~0_11 v_~SIZE~0_3)) InVars {~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} OutVars{~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} AuxVars[] AssignedVars[] {2483#(and (not (= main_~c~0 0)) (<= ~last~0 0) (<= 20 ~SIZE~0))} is VALID [2022-04-15 13:06:05,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {2483#(and (not (= main_~c~0 0)) (<= ~last~0 0) (<= 20 ~SIZE~0))} assume !(0 == ~st~0 && ~c~0 == 1 + ~last~0);~a~0 := 2 + ~a~0;~b~0 := 2 + ~b~0; {2483#(and (not (= main_~c~0 0)) (<= ~last~0 0) (<= 20 ~SIZE~0))} is VALID [2022-04-15 13:06:05,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {2483#(and (not (= main_~c~0 0)) (<= ~last~0 0) (<= 20 ~SIZE~0))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {2483#(and (not (= main_~c~0 0)) (<= ~last~0 0) (<= 20 ~SIZE~0))} is VALID [2022-04-15 13:06:05,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {2483#(and (not (= main_~c~0 0)) (<= ~last~0 0) (<= 20 ~SIZE~0))} assume 1 == ~st~0 && ~last~0 >= ~SIZE~0;#t~post6 := ~d~0;~d~0 := 1 + #t~post6;havoc #t~post6; {2472#false} is VALID [2022-04-15 13:06:05,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {2472#false} assume !(~d~0 == ~SIZE~0); {2472#false} is VALID [2022-04-15 13:06:05,677 INFO L272 TraceCheckUtils]: 19: Hoare triple {2472#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {2472#false} is VALID [2022-04-15 13:06:05,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {2472#false} ~cond := #in~cond; {2472#false} is VALID [2022-04-15 13:06:05,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {2472#false} assume 0 == ~cond; {2472#false} is VALID [2022-04-15 13:06:05,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {2472#false} assume !false; {2472#false} is VALID [2022-04-15 13:06:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:05,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:05,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751075716] [2022-04-15 13:06:05,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751075716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:05,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:05,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:06:05,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:05,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2068270098] [2022-04-15 13:06:05,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2068270098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:05,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:05,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:06:05,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283461760] [2022-04-15 13:06:05,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:05,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 13:06:05,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:05,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:05,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:05,754 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:06:05,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:05,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:06:05,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:06:05,755 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:06,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:06,240 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2022-04-15 13:06:06,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:06:06,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 13:06:06,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-04-15 13:06:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:06,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-04-15 13:06:06,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2022-04-15 13:06:06,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:06,302 INFO L225 Difference]: With dead ends: 154 [2022-04-15 13:06:06,302 INFO L226 Difference]: Without dead ends: 91 [2022-04-15 13:06:06,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:06:06,303 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:06,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 28 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:06:06,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-15 13:06:06,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2022-04-15 13:06:06,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:06,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 81 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 72 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:06:06,484 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 81 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 72 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:06:06,488 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 81 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 72 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:06:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:06,491 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2022-04-15 13:06:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2022-04-15 13:06:06,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:06,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:06,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 72 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 91 states. [2022-04-15 13:06:06,492 INFO L87 Difference]: Start difference. First operand has 81 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 72 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 91 states. [2022-04-15 13:06:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:06,495 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2022-04-15 13:06:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2022-04-15 13:06:06,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:06,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:06,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:06,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:06,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 72 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:06:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2022-04-15 13:06:06,498 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 25 [2022-04-15 13:06:06,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:06,498 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2022-04-15 13:06:06,498 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:06,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 102 transitions. [2022-04-15 13:06:06,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2022-04-15 13:06:06,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 13:06:06,617 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:06,617 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:06,617 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 13:06:06,617 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:06,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:06,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1640504642, now seen corresponding path program 2 times [2022-04-15 13:06:06,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:06,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [219975291] [2022-04-15 13:06:06,732 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:06,734 INFO L85 PathProgramCache]: Analyzing trace with hash 259677698, now seen corresponding path program 1 times [2022-04-15 13:06:06,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:06,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069002954] [2022-04-15 13:06:06,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:06,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:06,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:06,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {3157#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {3149#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:06,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {3149#(<= 20 ~SIZE~0)} assume true; {3149#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:06,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3149#(<= 20 ~SIZE~0)} {3144#true} #90#return; {3149#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:06,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:06:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:06,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-15 13:06:06,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-15 13:06:06,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-15 13:06:06,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3144#true} {3149#(<= 20 ~SIZE~0)} #86#return; {3149#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:06,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {3144#true} call ULTIMATE.init(); {3157#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:06,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {3157#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {3149#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:06,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {3149#(<= 20 ~SIZE~0)} assume true; {3149#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:06,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3149#(<= 20 ~SIZE~0)} {3144#true} #90#return; {3149#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:06,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {3149#(<= 20 ~SIZE~0)} call #t~ret7 := main(); {3149#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:06,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {3149#(<= 20 ~SIZE~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {3149#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:06,845 INFO L272 TraceCheckUtils]: 6: Hoare triple {3149#(<= 20 ~SIZE~0)} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {3144#true} is VALID [2022-04-15 13:06:06,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-15 13:06:06,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-15 13:06:06,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-15 13:06:06,845 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3144#true} {3149#(<= 20 ~SIZE~0)} #86#return; {3149#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:06,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {3149#(<= 20 ~SIZE~0)} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {3149#(<= 20 ~SIZE~0)} is VALID [2022-04-15 13:06:06,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {3149#(<= 20 ~SIZE~0)} assume !false;~st~0 := 1;~c~0 := 0; {3154#(and (<= 20 ~SIZE~0) (= main_~c~0 0))} is VALID [2022-04-15 13:06:06,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {3154#(and (<= 20 ~SIZE~0) (= main_~c~0 0))} [106] L25-3-->L25-4_primed: Formula: (or (and (= v_main_~c~0_In_7 v_main_~c~0_Out_14) (= v_~last~0_In_7 v_~last~0_In_7) (= v_~SIZE~0_In_7 v_~SIZE~0_In_7)) (and (= v_main_~c~0_Out_14 v_main_~c~0_In_7) (= |v_main_#t~post5_Out_14| 0) (= v_main_~st~0_Out_8 0) (= v_~last~0_In_7 0) (= v_main_~c~0_Out_14 0) (<= (+ v_~last~0_In_7 1) v_main_~c~0_Out_14) (< v_main_~c~0_Out_14 (+ v_~SIZE~0_In_7 1)))) InVars {~SIZE~0=v_~SIZE~0_In_7, main_~c~0=v_main_~c~0_In_7, ~last~0=v_~last~0_In_7} OutVars{~SIZE~0=v_~SIZE~0_In_7, main_#t~post5=|v_main_#t~post5_Out_14|, main_~c~0=v_main_~c~0_Out_14, main_~st~0=v_main_~st~0_Out_8, ~last~0=v_~last~0_In_7} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {3155#(and (<= 20 ~SIZE~0) (or (<= ~last~0 0) (= main_~c~0 0)))} is VALID [2022-04-15 13:06:06,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {3155#(and (<= 20 ~SIZE~0) (or (<= ~last~0 0) (= main_~c~0 0)))} [105] L25-4_primed-->L25-4: Formula: (not (< v_main_~c~0_11 v_~SIZE~0_3)) InVars {~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} OutVars{~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} AuxVars[] AssignedVars[] {3156#(and (<= ~last~0 0) (<= 20 main_~c~0))} is VALID [2022-04-15 13:06:06,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {3156#(and (<= ~last~0 0) (<= 20 main_~c~0))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {3145#false} is VALID [2022-04-15 13:06:06,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {3145#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {3145#false} is VALID [2022-04-15 13:06:06,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {3145#false} assume !(1 == ~st~0 && ~last~0 >= ~SIZE~0); {3145#false} is VALID [2022-04-15 13:06:06,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {3145#false} assume !(~d~0 == ~SIZE~0); {3145#false} is VALID [2022-04-15 13:06:06,849 INFO L272 TraceCheckUtils]: 19: Hoare triple {3145#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {3145#false} is VALID [2022-04-15 13:06:06,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {3145#false} ~cond := #in~cond; {3145#false} is VALID [2022-04-15 13:06:06,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {3145#false} assume 0 == ~cond; {3145#false} is VALID [2022-04-15 13:06:06,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {3145#false} assume !false; {3145#false} is VALID [2022-04-15 13:06:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:06,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:06,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069002954] [2022-04-15 13:06:06,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069002954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:06,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:06,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:06:06,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:06,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [219975291] [2022-04-15 13:06:06,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [219975291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:06,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:06,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:06:06,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804267302] [2022-04-15 13:06:06,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:06,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-04-15 13:06:06,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:06,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:06,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:06,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:06:06,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:06,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:06:06,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:06:06,989 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:07,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:07,550 INFO L93 Difference]: Finished difference Result 166 states and 211 transitions. [2022-04-15 13:06:07,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:06:07,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-04-15 13:06:07,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-15 13:06:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-15 13:06:07,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 65 transitions. [2022-04-15 13:06:07,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:07,610 INFO L225 Difference]: With dead ends: 166 [2022-04-15 13:06:07,610 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 13:06:07,611 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:06:07,611 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:07,611 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 33 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:06:07,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 13:06:07,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2022-04-15 13:06:07,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:07,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 90 states, 80 states have (on average 1.25) internal successors, (100), 81 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:06:07,787 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 90 states, 80 states have (on average 1.25) internal successors, (100), 81 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:06:07,787 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 90 states, 80 states have (on average 1.25) internal successors, (100), 81 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:06:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:07,799 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2022-04-15 13:06:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2022-04-15 13:06:07,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:07,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:07,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 80 states have (on average 1.25) internal successors, (100), 81 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 97 states. [2022-04-15 13:06:07,800 INFO L87 Difference]: Start difference. First operand has 90 states, 80 states have (on average 1.25) internal successors, (100), 81 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 97 states. [2022-04-15 13:06:07,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:07,803 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2022-04-15 13:06:07,803 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2022-04-15 13:06:07,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:07,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:07,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:07,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.25) internal successors, (100), 81 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:06:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2022-04-15 13:06:07,807 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 28 [2022-04-15 13:06:07,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:07,807 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2022-04-15 13:06:07,807 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:06:07,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 111 transitions. [2022-04-15 13:06:07,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:07,932 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2022-04-15 13:06:07,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 13:06:07,932 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:07,932 INFO L499 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, 1, 1, 1] [2022-04-15 13:06:07,932 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 13:06:07,932 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:07,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:07,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1643345404, now seen corresponding path program 1 times [2022-04-15 13:06:07,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:07,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1769346213] [2022-04-15 13:06:08,142 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.pushout(QvasrAbstractionJoin.java:181) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.join(QvasrAbstractionJoin.java:116) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.summarizeLoop(QvasrSummarizer.java:130) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrLoopSummarization.getQvasrAcceleration(QvasrLoopSummarization.java:87) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorQvasr.accelerateLoop(AcceleratorQvasr.java:91) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 13:06:08,148 INFO L158 Benchmark]: Toolchain (without parser) took 9760.70ms. Allocated memory was 194.0MB in the beginning and 280.0MB in the end (delta: 86.0MB). Free memory was 141.0MB in the beginning and 212.9MB in the end (delta: -71.9MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. [2022-04-15 13:06:08,149 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 194.0MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:06:08,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.94ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 140.7MB in the beginning and 206.0MB in the end (delta: -65.3MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-15 13:06:08,149 INFO L158 Benchmark]: Boogie Preprocessor took 30.96ms. Allocated memory is still 232.8MB. Free memory was 206.0MB in the beginning and 204.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 13:06:08,149 INFO L158 Benchmark]: RCFGBuilder took 267.43ms. Allocated memory is still 232.8MB. Free memory was 204.6MB in the beginning and 192.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 13:06:08,150 INFO L158 Benchmark]: TraceAbstraction took 9219.59ms. Allocated memory was 232.8MB in the beginning and 280.0MB in the end (delta: 47.2MB). Free memory was 191.9MB in the beginning and 212.9MB in the end (delta: -21.0MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-04-15 13:06:08,155 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 194.0MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.94ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 140.7MB in the beginning and 206.0MB in the end (delta: -65.3MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.96ms. Allocated memory is still 232.8MB. Free memory was 206.0MB in the beginning and 204.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 267.43ms. Allocated memory is still 232.8MB. Free memory was 204.6MB in the beginning and 192.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 9219.59ms. Allocated memory was 232.8MB in the beginning and 280.0MB in the end (delta: 47.2MB). Free memory was 191.9MB in the beginning and 212.9MB in the end (delta: -21.0MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0: de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 13:06:08,183 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...