/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/theatreSquare.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:12:58,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:12:58,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:12:58,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:12:58,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:12:58,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:12:58,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:12:58,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:12:58,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:12:58,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:12:58,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:12:58,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:12:58,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:12:58,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:12:58,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:12:58,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:12:58,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:12:58,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:12:58,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:12:58,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:12:58,188 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:12:58,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:12:58,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:12:58,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:12:58,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:12:58,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:12:58,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:12:58,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:12:58,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:12:58,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:12:58,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:12:58,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:12:58,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:12:58,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:12:58,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:12:58,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:12:58,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:12:58,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:12:58,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:12:58,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:12:58,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:12:58,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:12:58,202 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:12:58,208 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:12:58,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:12:58,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:12:58,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:12:58,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:12:58,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:12:58,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:12:58,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:12:58,210 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:12:58,211 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:12:58,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:12:58,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:12:58,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:12:58,211 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:12:58,211 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:12:58,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:12:58,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:12:58,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:12:58,211 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:12:58,211 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:12:58,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:12:58,212 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:12:58,212 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:12:58,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:12:58,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:12:58,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:12:58,392 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:12:58,392 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:12:58,393 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/theatreSquare.c [2022-04-15 13:12:58,459 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a2044e1/d12c1c81fc6b4d97b03a19d578af907e/FLAG6586c351f [2022-04-15 13:12:58,734 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:12:58,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c [2022-04-15 13:12:58,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a2044e1/d12c1c81fc6b4d97b03a19d578af907e/FLAG6586c351f [2022-04-15 13:12:59,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a2044e1/d12c1c81fc6b4d97b03a19d578af907e [2022-04-15 13:12:59,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:12:59,180 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:12:59,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:12:59,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:12:59,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:12:59,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:12:59" (1/1) ... [2022-04-15 13:12:59,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16543fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:12:59, skipping insertion in model container [2022-04-15 13:12:59,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:12:59" (1/1) ... [2022-04-15 13:12:59,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:12:59,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:12:59,309 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/theatreSquare.c[370,383] [2022-04-15 13:12:59,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:12:59,331 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:12:59,338 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/theatreSquare.c[370,383] [2022-04-15 13:12:59,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:12:59,358 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:12:59,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:12:59 WrapperNode [2022-04-15 13:12:59,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:12:59,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:12:59,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:12:59,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:12:59,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:12:59" (1/1) ... [2022-04-15 13:12:59,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:12:59" (1/1) ... [2022-04-15 13:12:59,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:12:59" (1/1) ... [2022-04-15 13:12:59,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:12:59" (1/1) ... [2022-04-15 13:12:59,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:12:59" (1/1) ... [2022-04-15 13:12:59,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:12:59" (1/1) ... [2022-04-15 13:12:59,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:12:59" (1/1) ... [2022-04-15 13:12:59,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:12:59,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:12:59,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:12:59,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:12:59,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:12:59" (1/1) ... [2022-04-15 13:12:59,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:12:59,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:12:59,409 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:12:59,435 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:12:59,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:12:59,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:12:59,444 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:12:59,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:12:59,444 INFO L138 BoogieDeclarations]: Found implementation of procedure correct_version [2022-04-15 13:12:59,444 INFO L138 BoogieDeclarations]: Found implementation of procedure student_version [2022-04-15 13:12:59,444 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:12:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:12:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:12:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:12:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:12:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 13:12:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:12:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure correct_version [2022-04-15 13:12:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure student_version [2022-04-15 13:12:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:12:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:12:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:12:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:12:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:12:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:12:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:12:59,489 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:12:59,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:12:59,700 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:12:59,704 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:12:59,704 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-15 13:12:59,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:12:59 BoogieIcfgContainer [2022-04-15 13:12:59,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:12:59,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:12:59,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:12:59,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:12:59,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:12:59" (1/3) ... [2022-04-15 13:12:59,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176a020b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:12:59, skipping insertion in model container [2022-04-15 13:12:59,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:12:59" (2/3) ... [2022-04-15 13:12:59,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176a020b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:12:59, skipping insertion in model container [2022-04-15 13:12:59,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:12:59" (3/3) ... [2022-04-15 13:12:59,715 INFO L111 eAbstractionObserver]: Analyzing ICFG theatreSquare.c [2022-04-15 13:12:59,718 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:12:59,718 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:12:59,744 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:12:59,748 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:12:59,748 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:12:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:12:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:12:59,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:12:59,765 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:12:59,765 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:12:59,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:12:59,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1554304209, now seen corresponding path program 1 times [2022-04-15 13:12:59,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:12:59,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1496788605] [2022-04-15 13:12:59,781 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:12:59,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1554304209, now seen corresponding path program 2 times [2022-04-15 13:12:59,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:12:59,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411354933] [2022-04-15 13:12:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:12:59,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:12:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:00,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:13:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:00,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-15 13:13:00,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-15 13:13:00,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #117#return; {42#true} is VALID [2022-04-15 13:13:00,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {50#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:13:00,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-15 13:13:00,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-15 13:13:00,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #117#return; {42#true} is VALID [2022-04-15 13:13:00,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret10 := main(); {42#true} is VALID [2022-04-15 13:13:00,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~n~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~m~0 := #t~nondet6;havoc #t~nondet6;havoc ~n_stones1~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~n_stones2~0 := #t~nondet7;havoc #t~nondet7;~n_stones1~0 := ~n_stones2~0; {47#(= main_~n_stones2~0 main_~n_stones1~0)} is VALID [2022-04-15 13:13:00,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#(= main_~n_stones2~0 main_~n_stones1~0)} assume !(((((1 <= ~n~0 && 1 <= ~m~0) && 1 <= ~a~0) && ~n~0 <= 109) && ~m~0 <= 109) && ~a~0 <= 109); {47#(= main_~n_stones2~0 main_~n_stones1~0)} is VALID [2022-04-15 13:13:00,029 INFO L272 TraceCheckUtils]: 7: Hoare triple {47#(= main_~n_stones2~0 main_~n_stones1~0)} call __VERIFIER_assert((if ~n_stones1~0 == ~n_stones2~0 then 1 else 0)); {48#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:13:00,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {48#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {49#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:13:00,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {49#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {43#false} is VALID [2022-04-15 13:13:00,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-15 13:13:00,031 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:13:00,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:13:00,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411354933] [2022-04-15 13:13:00,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411354933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:00,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:00,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:13:00,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:13:00,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1496788605] [2022-04-15 13:13:00,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1496788605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:00,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:00,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:13:00,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412527870] [2022-04-15 13:13:00,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:13:00,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:13:00,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:13:00,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:00,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:00,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:13:00,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:00,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:13:00,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:13:00,083 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:00,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:00,436 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2022-04-15 13:13:00,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:13:00,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:13:00,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:13:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-15 13:13:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-15 13:13:00,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 103 transitions. [2022-04-15 13:13:00,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:00,529 INFO L225 Difference]: With dead ends: 76 [2022-04-15 13:13:00,529 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 13:13:00,531 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:13:00,533 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:13:00,534 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 61 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:13:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 13:13:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 13:13:00,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:13:00,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:13:00,555 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:13:00,555 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:13:00,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:00,557 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-15 13:13:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-15 13:13:00,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:00,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:00,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 13:13:00,558 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 13:13:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:00,560 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-15 13:13:00,560 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-15 13:13:00,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:00,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:00,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:13:00,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:13:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:13:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-15 13:13:00,564 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2022-04-15 13:13:00,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:13:00,564 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-15 13:13:00,564 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:00,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-15 13:13:00,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:00,596 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-15 13:13:00,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 13:13:00,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:13:00,597 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, 1, 1, 1, 1, 1, 1] [2022-04-15 13:13:00,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:13:00,598 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:13:00,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:13:00,598 INFO L85 PathProgramCache]: Analyzing trace with hash 362112746, now seen corresponding path program 1 times [2022-04-15 13:13:00,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:00,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [239753] [2022-04-15 13:13:00,599 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:13:00,599 INFO L85 PathProgramCache]: Analyzing trace with hash 362112746, now seen corresponding path program 2 times [2022-04-15 13:13:00,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:13:00,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770323619] [2022-04-15 13:13:00,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:00,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:13:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:00,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:13:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:00,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {368#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {341#true} is VALID [2022-04-15 13:13:00,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {341#true} assume true; {341#true} is VALID [2022-04-15 13:13:00,694 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {341#true} {341#true} #117#return; {341#true} is VALID [2022-04-15 13:13:00,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 13:13:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:00,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {341#true} ~n := #in~n;~m := #in~m;~a := #in~a;~i~0 := 0;~j~0 := 0;~b~0 := 0;~l~0 := 0; {341#true} is VALID [2022-04-15 13:13:00,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {341#true} assume !(~b~0 < ~n); {341#true} is VALID [2022-04-15 13:13:00,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {341#true} assume !(~l~0 < ~m); {341#true} is VALID [2022-04-15 13:13:00,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {341#true} ~x~0 := 0;~y~0 := 0; {369#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} is VALID [2022-04-15 13:13:00,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {369#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} assume !(~x~0 < ~i~0); {369#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} is VALID [2022-04-15 13:13:00,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {369#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} #res := ~y~0; {370#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} is VALID [2022-04-15 13:13:00,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {370#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} assume true; {370#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} is VALID [2022-04-15 13:13:00,748 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {370#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} {341#true} #111#return; {354#(= |main_#t~ret8| 0)} is VALID [2022-04-15 13:13:00,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 13:13:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:00,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {341#true} ~n := #in~n;~m := #in~m;~a := #in~a;~i~1 := 0;~j~1 := 0;~b~1 := 0;~l~1 := 0; {341#true} is VALID [2022-04-15 13:13:00,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {341#true} assume !(~b~1 < ~n); {341#true} is VALID [2022-04-15 13:13:00,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {341#true} assume !(~l~1 < ~m); {341#true} is VALID [2022-04-15 13:13:00,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {341#true} ~x~1 := 0;~y~1 := 0; {371#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} is VALID [2022-04-15 13:13:00,811 INFO L290 TraceCheckUtils]: 4: Hoare triple {371#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} assume !(~x~1 < ~i~1); {371#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} is VALID [2022-04-15 13:13:00,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} #res := ~y~1; {372#(= |student_version_#res| 0)} is VALID [2022-04-15 13:13:00,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {372#(= |student_version_#res| 0)} assume true; {372#(= |student_version_#res| 0)} is VALID [2022-04-15 13:13:00,813 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {372#(= |student_version_#res| 0)} {355#(= main_~n_stones1~0 0)} #113#return; {364#(= main_~n_stones1~0 |main_#t~ret9|)} is VALID [2022-04-15 13:13:00,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {341#true} call ULTIMATE.init(); {368#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:13:00,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {341#true} is VALID [2022-04-15 13:13:00,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {341#true} assume true; {341#true} is VALID [2022-04-15 13:13:00,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {341#true} {341#true} #117#return; {341#true} is VALID [2022-04-15 13:13:00,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {341#true} call #t~ret10 := main(); {341#true} is VALID [2022-04-15 13:13:00,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {341#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~n~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~m~0 := #t~nondet6;havoc #t~nondet6;havoc ~n_stones1~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~n_stones2~0 := #t~nondet7;havoc #t~nondet7;~n_stones1~0 := ~n_stones2~0; {341#true} is VALID [2022-04-15 13:13:00,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {341#true} assume ((((1 <= ~n~0 && 1 <= ~m~0) && 1 <= ~a~0) && ~n~0 <= 109) && ~m~0 <= 109) && ~a~0 <= 109; {341#true} is VALID [2022-04-15 13:13:00,815 INFO L272 TraceCheckUtils]: 7: Hoare triple {341#true} call #t~ret8 := correct_version(~n~0, ~m~0, ~a~0); {341#true} is VALID [2022-04-15 13:13:00,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {341#true} ~n := #in~n;~m := #in~m;~a := #in~a;~i~0 := 0;~j~0 := 0;~b~0 := 0;~l~0 := 0; {341#true} is VALID [2022-04-15 13:13:00,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {341#true} assume !(~b~0 < ~n); {341#true} is VALID [2022-04-15 13:13:00,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {341#true} assume !(~l~0 < ~m); {341#true} is VALID [2022-04-15 13:13:00,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {341#true} ~x~0 := 0;~y~0 := 0; {369#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} is VALID [2022-04-15 13:13:00,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {369#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} assume !(~x~0 < ~i~0); {369#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} is VALID [2022-04-15 13:13:00,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {369#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} #res := ~y~0; {370#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} is VALID [2022-04-15 13:13:00,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {370#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} assume true; {370#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} is VALID [2022-04-15 13:13:00,821 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {370#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} {341#true} #111#return; {354#(= |main_#t~ret8| 0)} is VALID [2022-04-15 13:13:00,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {354#(= |main_#t~ret8| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~n_stones1~0 := #t~ret8;havoc #t~ret8; {355#(= main_~n_stones1~0 0)} is VALID [2022-04-15 13:13:00,824 INFO L272 TraceCheckUtils]: 17: Hoare triple {355#(= main_~n_stones1~0 0)} call #t~ret9 := student_version(~n~0, ~m~0, ~a~0); {341#true} is VALID [2022-04-15 13:13:00,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {341#true} ~n := #in~n;~m := #in~m;~a := #in~a;~i~1 := 0;~j~1 := 0;~b~1 := 0;~l~1 := 0; {341#true} is VALID [2022-04-15 13:13:00,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {341#true} assume !(~b~1 < ~n); {341#true} is VALID [2022-04-15 13:13:00,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {341#true} assume !(~l~1 < ~m); {341#true} is VALID [2022-04-15 13:13:00,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {341#true} ~x~1 := 0;~y~1 := 0; {371#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} is VALID [2022-04-15 13:13:00,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {371#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} assume !(~x~1 < ~i~1); {371#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} is VALID [2022-04-15 13:13:00,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {371#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} #res := ~y~1; {372#(= |student_version_#res| 0)} is VALID [2022-04-15 13:13:00,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {372#(= |student_version_#res| 0)} assume true; {372#(= |student_version_#res| 0)} is VALID [2022-04-15 13:13:00,829 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {372#(= |student_version_#res| 0)} {355#(= main_~n_stones1~0 0)} #113#return; {364#(= main_~n_stones1~0 |main_#t~ret9|)} is VALID [2022-04-15 13:13:00,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {364#(= main_~n_stones1~0 |main_#t~ret9|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~n_stones2~0 := #t~ret9;havoc #t~ret9; {365#(= main_~n_stones2~0 main_~n_stones1~0)} is VALID [2022-04-15 13:13:00,831 INFO L272 TraceCheckUtils]: 27: Hoare triple {365#(= main_~n_stones2~0 main_~n_stones1~0)} call __VERIFIER_assert((if ~n_stones1~0 == ~n_stones2~0 then 1 else 0)); {366#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:13:00,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {366#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {367#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:13:00,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {367#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {342#false} is VALID [2022-04-15 13:13:00,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {342#false} assume !false; {342#false} is VALID [2022-04-15 13:13:00,833 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:13:00,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:13:00,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770323619] [2022-04-15 13:13:00,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770323619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:00,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:00,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 13:13:00,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:13:00,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [239753] [2022-04-15 13:13:00,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [239753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:00,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:00,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 13:13:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171283956] [2022-04-15 13:13:00,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:13:00,837 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-15 13:13:00,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:13:00,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:13:00,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:00,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 13:13:00,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:00,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 13:13:00,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:13:00,860 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:13:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:01,579 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-15 13:13:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 13:13:01,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-15 13:13:01,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:13:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:13:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2022-04-15 13:13:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:13:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2022-04-15 13:13:01,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 58 transitions. [2022-04-15 13:13:01,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:01,645 INFO L225 Difference]: With dead ends: 50 [2022-04-15 13:13:01,645 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 13:13:01,646 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-04-15 13:13:01,648 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:13:01,649 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 80 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 13:13:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 13:13:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-04-15 13:13:01,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:13:01,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 13:13:01,677 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 13:13:01,677 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 13:13:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:01,684 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-15 13:13:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-15 13:13:01,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:01,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:01,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 44 states. [2022-04-15 13:13:01,686 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 44 states. [2022-04-15 13:13:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:01,692 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-15 13:13:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-15 13:13:01,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:01,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:01,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:13:01,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:13:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 13:13:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-15 13:13:01,699 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 31 [2022-04-15 13:13:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:13:01,699 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-15 13:13:01,699 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:13:01,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 50 transitions. [2022-04-15 13:13:01,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:01,735 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-15 13:13:01,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 13:13:01,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:13:01,735 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:13:01,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:13:01,736 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:13:01,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:13:01,736 INFO L85 PathProgramCache]: Analyzing trace with hash -310269904, now seen corresponding path program 1 times [2022-04-15 13:13:01,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:01,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [218943180] [2022-04-15 13:13:37,517 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:13:37,519 INFO L85 PathProgramCache]: Analyzing trace with hash 470809425, now seen corresponding path program 1 times [2022-04-15 13:13:37,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:13:37,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657543131] [2022-04-15 13:13:37,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:37,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:13:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:37,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:13:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:37,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {693#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {670#true} is VALID [2022-04-15 13:13:37,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-15 13:13:37,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {670#true} {670#true} #117#return; {670#true} is VALID [2022-04-15 13:13:37,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 13:13:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:37,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {670#true} ~n := #in~n;~m := #in~m;~a := #in~a;~i~0 := 0;~j~0 := 0;~b~0 := 0;~l~0 := 0; {694#(and (<= correct_version_~b~0 0) (= |correct_version_#in~n| correct_version_~n))} is VALID [2022-04-15 13:13:37,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {694#(and (<= correct_version_~b~0 0) (= |correct_version_#in~n| correct_version_~n))} assume !(~b~0 < ~n); {695#(<= |correct_version_#in~n| 0)} is VALID [2022-04-15 13:13:37,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {695#(<= |correct_version_#in~n| 0)} assume !(~l~0 < ~m); {695#(<= |correct_version_#in~n| 0)} is VALID [2022-04-15 13:13:37,619 INFO L290 TraceCheckUtils]: 3: Hoare triple {695#(<= |correct_version_#in~n| 0)} ~x~0 := 0;~y~0 := 0; {695#(<= |correct_version_#in~n| 0)} is VALID [2022-04-15 13:13:37,619 INFO L290 TraceCheckUtils]: 4: Hoare triple {695#(<= |correct_version_#in~n| 0)} assume !(~x~0 < ~i~0); {695#(<= |correct_version_#in~n| 0)} is VALID [2022-04-15 13:13:37,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {695#(<= |correct_version_#in~n| 0)} #res := ~y~0; {695#(<= |correct_version_#in~n| 0)} is VALID [2022-04-15 13:13:37,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {695#(<= |correct_version_#in~n| 0)} assume true; {695#(<= |correct_version_#in~n| 0)} is VALID [2022-04-15 13:13:37,621 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {695#(<= |correct_version_#in~n| 0)} {675#(<= 1 main_~n~0)} #111#return; {671#false} is VALID [2022-04-15 13:13:37,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 13:13:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:37,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {670#true} ~n := #in~n;~m := #in~m;~a := #in~a;~i~1 := 0;~j~1 := 0;~b~1 := 0;~l~1 := 0; {670#true} is VALID [2022-04-15 13:13:37,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} assume !(~b~1 < ~n); {670#true} is VALID [2022-04-15 13:13:37,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} assume !(~l~1 < ~m); {670#true} is VALID [2022-04-15 13:13:37,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {670#true} ~x~1 := 0;~y~1 := 0; {670#true} is VALID [2022-04-15 13:13:37,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {670#true} [121] L79-2-->L79-3_primed: Formula: (let ((.cse0 (= v_student_version_~x~1_In_1 v_student_version_~x~1_Out_2))) (or (and (< v_student_version_~x~1_Out_2 (+ v_student_version_~i~1_In_1 1)) (= v_student_version_~j~1_In_1 0) .cse0 (<= v_student_version_~y~1_In_1 v_student_version_~y~1_Out_2)) (and (= v_student_version_~y~1_In_1 v_student_version_~y~1_Out_2) .cse0 (= v_student_version_~i~1_In_1 v_student_version_~i~1_In_1) (= v_student_version_~j~1_In_1 v_student_version_~j~1_In_1)))) InVars {student_version_~i~1=v_student_version_~i~1_In_1, student_version_~y~1=v_student_version_~y~1_In_1, student_version_~x~1=v_student_version_~x~1_In_1, student_version_~j~1=v_student_version_~j~1_In_1} OutVars{student_version_~i~1=v_student_version_~i~1_In_1, student_version_~y~1=v_student_version_~y~1_Out_2, student_version_~x~1=v_student_version_~x~1_Out_2, student_version_~j~1=v_student_version_~j~1_In_1} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {670#true} is VALID [2022-04-15 13:13:37,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} [120] L79-3_primed-->L79-3: Formula: (not (< v_student_version_~x~1_2 v_student_version_~i~1_3)) InVars {student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} OutVars{student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 13:13:37,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {670#true} #res := ~y~1; {670#true} is VALID [2022-04-15 13:13:37,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-15 13:13:37,642 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {670#true} {671#false} #113#return; {671#false} is VALID [2022-04-15 13:13:37,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} call ULTIMATE.init(); {693#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:13:37,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {670#true} is VALID [2022-04-15 13:13:37,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-15 13:13:37,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} #117#return; {670#true} is VALID [2022-04-15 13:13:37,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} call #t~ret10 := main(); {670#true} is VALID [2022-04-15 13:13:37,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~n~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~m~0 := #t~nondet6;havoc #t~nondet6;havoc ~n_stones1~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~n_stones2~0 := #t~nondet7;havoc #t~nondet7;~n_stones1~0 := ~n_stones2~0; {670#true} is VALID [2022-04-15 13:13:37,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {670#true} assume ((((1 <= ~n~0 && 1 <= ~m~0) && 1 <= ~a~0) && ~n~0 <= 109) && ~m~0 <= 109) && ~a~0 <= 109; {675#(<= 1 main_~n~0)} is VALID [2022-04-15 13:13:37,644 INFO L272 TraceCheckUtils]: 7: Hoare triple {675#(<= 1 main_~n~0)} call #t~ret8 := correct_version(~n~0, ~m~0, ~a~0); {670#true} is VALID [2022-04-15 13:13:37,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} ~n := #in~n;~m := #in~m;~a := #in~a;~i~0 := 0;~j~0 := 0;~b~0 := 0;~l~0 := 0; {694#(and (<= correct_version_~b~0 0) (= |correct_version_#in~n| correct_version_~n))} is VALID [2022-04-15 13:13:37,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {694#(and (<= correct_version_~b~0 0) (= |correct_version_#in~n| correct_version_~n))} assume !(~b~0 < ~n); {695#(<= |correct_version_#in~n| 0)} is VALID [2022-04-15 13:13:37,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {695#(<= |correct_version_#in~n| 0)} assume !(~l~0 < ~m); {695#(<= |correct_version_#in~n| 0)} is VALID [2022-04-15 13:13:37,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {695#(<= |correct_version_#in~n| 0)} ~x~0 := 0;~y~0 := 0; {695#(<= |correct_version_#in~n| 0)} is VALID [2022-04-15 13:13:37,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {695#(<= |correct_version_#in~n| 0)} assume !(~x~0 < ~i~0); {695#(<= |correct_version_#in~n| 0)} is VALID [2022-04-15 13:13:37,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {695#(<= |correct_version_#in~n| 0)} #res := ~y~0; {695#(<= |correct_version_#in~n| 0)} is VALID [2022-04-15 13:13:37,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {695#(<= |correct_version_#in~n| 0)} assume true; {695#(<= |correct_version_#in~n| 0)} is VALID [2022-04-15 13:13:37,648 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {695#(<= |correct_version_#in~n| 0)} {675#(<= 1 main_~n~0)} #111#return; {671#false} is VALID [2022-04-15 13:13:37,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {671#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~n_stones1~0 := #t~ret8;havoc #t~ret8; {671#false} is VALID [2022-04-15 13:13:37,648 INFO L272 TraceCheckUtils]: 17: Hoare triple {671#false} call #t~ret9 := student_version(~n~0, ~m~0, ~a~0); {670#true} is VALID [2022-04-15 13:13:37,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#true} ~n := #in~n;~m := #in~m;~a := #in~a;~i~1 := 0;~j~1 := 0;~b~1 := 0;~l~1 := 0; {670#true} is VALID [2022-04-15 13:13:37,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {670#true} assume !(~b~1 < ~n); {670#true} is VALID [2022-04-15 13:13:37,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {670#true} assume !(~l~1 < ~m); {670#true} is VALID [2022-04-15 13:13:37,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {670#true} ~x~1 := 0;~y~1 := 0; {670#true} is VALID [2022-04-15 13:13:37,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {670#true} [121] L79-2-->L79-3_primed: Formula: (let ((.cse0 (= v_student_version_~x~1_In_1 v_student_version_~x~1_Out_2))) (or (and (< v_student_version_~x~1_Out_2 (+ v_student_version_~i~1_In_1 1)) (= v_student_version_~j~1_In_1 0) .cse0 (<= v_student_version_~y~1_In_1 v_student_version_~y~1_Out_2)) (and (= v_student_version_~y~1_In_1 v_student_version_~y~1_Out_2) .cse0 (= v_student_version_~i~1_In_1 v_student_version_~i~1_In_1) (= v_student_version_~j~1_In_1 v_student_version_~j~1_In_1)))) InVars {student_version_~i~1=v_student_version_~i~1_In_1, student_version_~y~1=v_student_version_~y~1_In_1, student_version_~x~1=v_student_version_~x~1_In_1, student_version_~j~1=v_student_version_~j~1_In_1} OutVars{student_version_~i~1=v_student_version_~i~1_In_1, student_version_~y~1=v_student_version_~y~1_Out_2, student_version_~x~1=v_student_version_~x~1_Out_2, student_version_~j~1=v_student_version_~j~1_In_1} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {670#true} is VALID [2022-04-15 13:13:37,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {670#true} [120] L79-3_primed-->L79-3: Formula: (not (< v_student_version_~x~1_2 v_student_version_~i~1_3)) InVars {student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} OutVars{student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 13:13:37,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {670#true} #res := ~y~1; {670#true} is VALID [2022-04-15 13:13:37,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-15 13:13:37,651 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {670#true} {671#false} #113#return; {671#false} is VALID [2022-04-15 13:13:37,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {671#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~n_stones2~0 := #t~ret9;havoc #t~ret9; {671#false} is VALID [2022-04-15 13:13:37,651 INFO L272 TraceCheckUtils]: 28: Hoare triple {671#false} call __VERIFIER_assert((if ~n_stones1~0 == ~n_stones2~0 then 1 else 0)); {671#false} is VALID [2022-04-15 13:13:37,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {671#false} ~cond := #in~cond; {671#false} is VALID [2022-04-15 13:13:37,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {671#false} assume 0 == ~cond; {671#false} is VALID [2022-04-15 13:13:37,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {671#false} assume !false; {671#false} is VALID [2022-04-15 13:13:37,652 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:13:37,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:13:37,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657543131] [2022-04-15 13:13:37,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657543131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:37,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:37,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:13:37,782 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:13:37,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [218943180] [2022-04-15 13:13:37,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [218943180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:37,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:37,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 13:13:37,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563435359] [2022-04-15 13:13:37,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:13:37,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-04-15 13:13:37,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:13:37,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:13:37,785 WARN L143 InductivityCheck]: Transition 701#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= __VERIFIER_assert_~cond 0)) ( _ , assume !false; , 671#false ) not inductive [2022-04-15 13:13:37,785 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:13:37,785 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) 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:13:37,791 INFO L158 Benchmark]: Toolchain (without parser) took 38610.35ms. Allocated memory was 205.5MB in the beginning and 252.7MB in the end (delta: 47.2MB). Free memory was 155.2MB in the beginning and 164.9MB in the end (delta: -9.8MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-04-15 13:13:37,791 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 205.5MB. Free memory was 171.8MB in the beginning and 171.7MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:13:37,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.85ms. Allocated memory is still 205.5MB. Free memory was 155.0MB in the beginning and 181.5MB in the end (delta: -26.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 13:13:37,793 INFO L158 Benchmark]: Boogie Preprocessor took 27.96ms. Allocated memory is still 205.5MB. Free memory was 181.1MB in the beginning and 179.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 13:13:37,795 INFO L158 Benchmark]: RCFGBuilder took 318.57ms. Allocated memory is still 205.5MB. Free memory was 179.4MB in the beginning and 165.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 13:13:37,796 INFO L158 Benchmark]: TraceAbstraction took 38083.34ms. Allocated memory was 205.5MB in the beginning and 252.7MB in the end (delta: 47.2MB). Free memory was 165.4MB in the beginning and 164.9MB in the end (delta: 493.9kB). Peak memory consumption was 48.5MB. Max. memory is 8.0GB. [2022-04-15 13:13:37,798 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.13ms. Allocated memory is still 205.5MB. Free memory was 171.8MB in the beginning and 171.7MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 175.85ms. Allocated memory is still 205.5MB. Free memory was 155.0MB in the beginning and 181.5MB in the end (delta: -26.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.96ms. Allocated memory is still 205.5MB. Free memory was 181.1MB in the beginning and 179.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 318.57ms. Allocated memory is still 205.5MB. Free memory was 179.4MB in the beginning and 165.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 38083.34ms. Allocated memory was 205.5MB in the beginning and 252.7MB in the end (delta: 47.2MB). Free memory was 165.4MB in the beginning and 164.9MB in the end (delta: 493.9kB). Peak memory consumption was 48.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 13:13:37,809 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...