/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/loop-industry-pattern/nested-3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:45:58,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:45:58,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:45:58,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:45:58,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:45:58,919 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:45:58,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:45:58,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:45:58,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:45:58,931 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:45:58,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:45:58,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:45:58,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:45:58,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:45:58,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:45:58,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:45:58,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:45:58,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:45:58,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:45:58,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:45:58,951 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:45:58,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:45:58,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:45:58,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:45:58,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:45:58,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:45:58,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:45:58,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:45:58,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:45:58,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:45:58,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:45:58,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:45:58,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:45:58,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:45:58,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:45:58,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:45:58,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:45:58,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:45:58,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:45:58,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:45:58,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:45:58,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:45:58,970 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 12:45:58,980 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:45:58,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:45:58,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:45:58,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:45:58,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:45:58,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:45:58,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:45:58,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:45:58,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:45:58,983 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:45:58,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:45:58,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:45:58,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:45:58,983 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:45:58,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:45:58,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:45:58,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:45:58,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:45:58,984 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:45:58,984 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:45:58,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:45:58,985 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:45:58,985 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 12:45:59,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:45:59,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:45:59,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:45:59,237 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:45:59,238 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:45:59,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/nested-3.c [2022-04-15 12:45:59,304 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5c3c2b9/92eb47338a894c0ea57ba55f7d0a6511/FLAG88ec4ba49 [2022-04-15 12:45:59,628 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:45:59,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested-3.c [2022-04-15 12:45:59,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5c3c2b9/92eb47338a894c0ea57ba55f7d0a6511/FLAG88ec4ba49 [2022-04-15 12:46:00,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5c3c2b9/92eb47338a894c0ea57ba55f7d0a6511 [2022-04-15 12:46:00,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:46:00,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:46:00,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:46:00,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:46:00,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:46:00,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:46:00" (1/1) ... [2022-04-15 12:46:00,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c4cb5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:00, skipping insertion in model container [2022-04-15 12:46:00,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:46:00" (1/1) ... [2022-04-15 12:46:00,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:46:00,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:46:00,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested-3.c[404,417] [2022-04-15 12:46:00,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:46:00,266 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:46:00,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested-3.c[404,417] [2022-04-15 12:46:00,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:46:00,292 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:46:00,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:00 WrapperNode [2022-04-15 12:46:00,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:46:00,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:46:00,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:46:00,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:46:00,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:00" (1/1) ... [2022-04-15 12:46:00,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:00" (1/1) ... [2022-04-15 12:46:00,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:00" (1/1) ... [2022-04-15 12:46:00,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:00" (1/1) ... [2022-04-15 12:46:00,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:00" (1/1) ... [2022-04-15 12:46:00,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:00" (1/1) ... [2022-04-15 12:46:00,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:00" (1/1) ... [2022-04-15 12:46:00,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:46:00,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:46:00,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:46:00,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:46:00,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:00" (1/1) ... [2022-04-15 12:46:00,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:46:00,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:00,349 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 12:46:00,351 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 12:46:00,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:46:00,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:46:00,379 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:46:00,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:46:00,379 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:46:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:46:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:46:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:46:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:46:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:46:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:46:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:46:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:46:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:46:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:46:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:46:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:46:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:46:00,430 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:46:00,431 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:46:00,534 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:46:00,540 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:46:00,540 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 12:46:00,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:46:00 BoogieIcfgContainer [2022-04-15 12:46:00,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:46:00,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:46:00,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:46:00,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:46:00,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:46:00" (1/3) ... [2022-04-15 12:46:00,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b69226e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:46:00, skipping insertion in model container [2022-04-15 12:46:00,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:00" (2/3) ... [2022-04-15 12:46:00,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b69226e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:46:00, skipping insertion in model container [2022-04-15 12:46:00,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:46:00" (3/3) ... [2022-04-15 12:46:00,549 INFO L111 eAbstractionObserver]: Analyzing ICFG nested-3.c [2022-04-15 12:46:00,553 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:46:00,553 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:46:00,598 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:46:00,609 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 12:46:00,610 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:46:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.6) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:46:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:46:00,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:00,638 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:00,638 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:00,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:00,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1677248157, now seen corresponding path program 1 times [2022-04-15 12:46:00,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:00,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1000128347] [2022-04-15 12:46:00,668 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:46:00,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1677248157, now seen corresponding path program 2 times [2022-04-15 12:46:00,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:00,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372070145] [2022-04-15 12:46:00,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:00,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:00,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:00,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= ~last~0 |old(~last~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(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {26#true} is VALID [2022-04-15 12:46:00,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 12:46:00,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #66#return; {26#true} is VALID [2022-04-15 12:46:00,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {32#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:00,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= ~last~0 |old(~last~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(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {26#true} is VALID [2022-04-15 12:46:00,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 12:46:00,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #66#return; {26#true} is VALID [2022-04-15 12:46:00,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2022-04-15 12:46:00,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {26#true} is VALID [2022-04-15 12:46:00,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !false;~st~0 := 1;~c~0 := 0; {31#(= main_~c~0 0)} is VALID [2022-04-15 12:46:00,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#(= main_~c~0 0)} assume !(~c~0 < 200000); {27#false} is VALID [2022-04-15 12:46:00,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {27#false} is VALID [2022-04-15 12:46:00,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume ~c~0 == ~last~0 && 0 == ~st~0;~a~0 := 1 + ~a~0; {27#false} is VALID [2022-04-15 12:46:00,865 INFO L272 TraceCheckUtils]: 10: Hoare triple {27#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {27#false} is VALID [2022-04-15 12:46:00,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-15 12:46:00,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-15 12:46:00,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-15 12:46:00,868 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 12:46:00,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:00,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372070145] [2022-04-15 12:46:00,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372070145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:00,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:00,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:00,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:00,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1000128347] [2022-04-15 12:46:00,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1000128347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:00,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:00,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:00,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331586085] [2022-04-15 12:46:00,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:00,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2022-04-15 12:46:00,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:00,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 12:46:00,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:00,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:46:00,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:00,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:46:00,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:46:00,954 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 12:46:01,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:01,136 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. [2022-04-15 12:46:01,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:46:01,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2022-04-15 12:46:01,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 12:46:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-15 12:46:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 12:46:01,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-15 12:46:01,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-04-15 12:46:01,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:01,237 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:46:01,237 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:46:01,241 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:46:01,246 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:01,249 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 26 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:46:01,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-04-15 12:46:01,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:01,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:46:01,282 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:46:01,283 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:46:01,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:01,285 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 12:46:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 12:46:01,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:01,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:01,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 12:46:01,286 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 12:46:01,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:01,290 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 12:46:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 12:46:01,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:01,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:01,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:01,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:46:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-15 12:46:01,294 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2022-04-15 12:46:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:01,294 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-15 12:46:01,295 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 12:46:01,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2022-04-15 12:46:01,328 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 12:46:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 12:46:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:46:01,331 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:01,336 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:01,336 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:46:01,336 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:01,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash -946078686, now seen corresponding path program 1 times [2022-04-15 12:46:01,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:01,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [649083123] [2022-04-15 12:46:01,521 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:46:01,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2908935, now seen corresponding path program 1 times [2022-04-15 12:46:01,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:01,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911093253] [2022-04-15 12:46:01,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:01,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:01,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:01,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {207#(and (= ~last~0 |old(~last~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(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {201#true} is VALID [2022-04-15 12:46:01,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#true} assume true; {201#true} is VALID [2022-04-15 12:46:01,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {201#true} {201#true} #66#return; {201#true} is VALID [2022-04-15 12:46:01,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {201#true} call ULTIMATE.init(); {207#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:01,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {207#(and (= ~last~0 |old(~last~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(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {201#true} is VALID [2022-04-15 12:46:01,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {201#true} assume true; {201#true} is VALID [2022-04-15 12:46:01,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {201#true} {201#true} #66#return; {201#true} is VALID [2022-04-15 12:46:01,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {201#true} call #t~ret6 := main(); {201#true} is VALID [2022-04-15 12:46:01,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {201#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {201#true} is VALID [2022-04-15 12:46:01,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#true} assume !false;~st~0 := 1;~c~0 := 0; {201#true} is VALID [2022-04-15 12:46:01,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {201#true} [70] L23-3-->L23-4_primed: Formula: (or (= v_~last~0_In_1 v_~last~0_In_1) (and (= v_main_~c~0_Out_2 0) (= (+ v_~last~0_In_1 1) v_main_~c~0_Out_2) (= v_main_~st~0_Out_2 0) (= v_~last~0_In_1 0))) InVars {~last~0=v_~last~0_In_1} OutVars{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] {201#true} is VALID [2022-04-15 12:46:01,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {201#true} [69] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {201#true} is VALID [2022-04-15 12:46:01,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {201#true} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {206#(<= (+ ~last~0 1) main_~c~0)} is VALID [2022-04-15 12:46:01,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {206#(<= (+ ~last~0 1) main_~c~0)} assume ~c~0 == ~last~0 && 0 == ~st~0;~a~0 := 1 + ~a~0; {202#false} is VALID [2022-04-15 12:46:01,640 INFO L272 TraceCheckUtils]: 11: Hoare triple {202#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {202#false} is VALID [2022-04-15 12:46:01,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#false} ~cond := #in~cond; {202#false} is VALID [2022-04-15 12:46:01,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#false} assume 0 == ~cond; {202#false} is VALID [2022-04-15 12:46:01,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {202#false} assume !false; {202#false} is VALID [2022-04-15 12:46:01,641 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 12:46:01,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:01,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911093253] [2022-04-15 12:46:01,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911093253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:01,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:01,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:01,700 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:01,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [649083123] [2022-04-15 12:46:01,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [649083123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:01,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:01,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:46:01,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363247295] [2022-04-15 12:46:01,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:01,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:46:01,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:01,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:01,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:01,720 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:46:01,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:01,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:46:01,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:46:01,722 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:02,045 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-15 12:46:02,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:46:02,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:46:02,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2022-04-15 12:46:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2022-04-15 12:46:02,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 67 transitions. [2022-04-15 12:46:02,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:02,111 INFO L225 Difference]: With dead ends: 50 [2022-04-15 12:46:02,111 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 12:46:02,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:46:02,113 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:02,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 32 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:46:02,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 12:46:02,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-04-15 12:46:02,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:02,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:46:02,135 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:46:02,135 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:46:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:02,142 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-15 12:46:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-15 12:46:02,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:02,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:02,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 36 states. [2022-04-15 12:46:02,146 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 36 states. [2022-04-15 12:46:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:02,152 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-15 12:46:02,152 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-15 12:46:02,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:02,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:02,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:02,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:46:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-04-15 12:46:02,159 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2022-04-15 12:46:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:02,160 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-04-15 12:46:02,160 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:02,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 35 transitions. [2022-04-15 12:46:02,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-15 12:46:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:46:02,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:02,227 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:02,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:46:02,227 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:02,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash -944231644, now seen corresponding path program 1 times [2022-04-15 12:46:02,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:02,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [448937822] [2022-04-15 12:46:02,375 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:46:02,376 INFO L85 PathProgramCache]: Analyzing trace with hash 970416713, now seen corresponding path program 1 times [2022-04-15 12:46:02,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:02,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931780652] [2022-04-15 12:46:02,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:02,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:02,417 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:02,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:02,465 INFO L85 PathProgramCache]: Analyzing trace with hash -944231644, now seen corresponding path program 2 times [2022-04-15 12:46:02,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:02,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915426112] [2022-04-15 12:46:02,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:02,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:02,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:02,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {452#(and (= ~last~0 |old(~last~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(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {445#true} is VALID [2022-04-15 12:46:02,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {445#true} assume true; {445#true} is VALID [2022-04-15 12:46:02,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {445#true} {445#true} #66#return; {445#true} is VALID [2022-04-15 12:46:02,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {452#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:02,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#(and (= ~last~0 |old(~last~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(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {445#true} is VALID [2022-04-15 12:46:02,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2022-04-15 12:46:02,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #66#return; {445#true} is VALID [2022-04-15 12:46:02,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret6 := main(); {445#true} is VALID [2022-04-15 12:46:02,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {445#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {445#true} is VALID [2022-04-15 12:46:02,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {445#true} assume !false;~st~0 := 1;~c~0 := 0; {450#(= main_~c~0 0)} is VALID [2022-04-15 12:46:02,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {450#(= main_~c~0 0)} assume !!(~c~0 < 200000); {450#(= main_~c~0 0)} is VALID [2022-04-15 12:46:02,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {450#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {450#(= main_~c~0 0)} is VALID [2022-04-15 12:46:02,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {450#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {451#(<= main_~c~0 1)} is VALID [2022-04-15 12:46:02,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {451#(<= main_~c~0 1)} assume !(~c~0 < 200000); {446#false} is VALID [2022-04-15 12:46:02,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {446#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {446#false} is VALID [2022-04-15 12:46:02,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {446#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {446#false} is VALID [2022-04-15 12:46:02,513 INFO L272 TraceCheckUtils]: 13: Hoare triple {446#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {446#false} is VALID [2022-04-15 12:46:02,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {446#false} ~cond := #in~cond; {446#false} is VALID [2022-04-15 12:46:02,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {446#false} assume 0 == ~cond; {446#false} is VALID [2022-04-15 12:46:02,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {446#false} assume !false; {446#false} is VALID [2022-04-15 12:46:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:02,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:02,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915426112] [2022-04-15 12:46:02,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915426112] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:02,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692786295] [2022-04-15 12:46:02,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:46:02,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:02,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:02,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:02,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:46:02,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:46:02,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:02,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 12:46:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:02,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:02,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2022-04-15 12:46:02,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {445#true} #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(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {445#true} is VALID [2022-04-15 12:46:02,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2022-04-15 12:46:02,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #66#return; {445#true} is VALID [2022-04-15 12:46:02,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret6 := main(); {445#true} is VALID [2022-04-15 12:46:02,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {445#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {445#true} is VALID [2022-04-15 12:46:02,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {445#true} assume !false;~st~0 := 1;~c~0 := 0; {474#(<= main_~c~0 0)} is VALID [2022-04-15 12:46:02,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {474#(<= main_~c~0 0)} is VALID [2022-04-15 12:46:02,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {481#(<= ~last~0 0)} is VALID [2022-04-15 12:46:02,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {481#(<= ~last~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {481#(<= ~last~0 0)} is VALID [2022-04-15 12:46:02,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {481#(<= ~last~0 0)} assume !(~c~0 < 200000); {488#(and (<= ~last~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 12:46:02,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {488#(and (<= ~last~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {446#false} is VALID [2022-04-15 12:46:02,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {446#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {446#false} is VALID [2022-04-15 12:46:02,758 INFO L272 TraceCheckUtils]: 13: Hoare triple {446#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {446#false} is VALID [2022-04-15 12:46:02,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {446#false} ~cond := #in~cond; {446#false} is VALID [2022-04-15 12:46:02,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {446#false} assume 0 == ~cond; {446#false} is VALID [2022-04-15 12:46:02,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {446#false} assume !false; {446#false} is VALID [2022-04-15 12:46:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:02,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:02,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {446#false} assume !false; {446#false} is VALID [2022-04-15 12:46:02,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {446#false} assume 0 == ~cond; {446#false} is VALID [2022-04-15 12:46:02,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {446#false} ~cond := #in~cond; {446#false} is VALID [2022-04-15 12:46:02,852 INFO L272 TraceCheckUtils]: 13: Hoare triple {446#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {446#false} is VALID [2022-04-15 12:46:02,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {446#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {446#false} is VALID [2022-04-15 12:46:02,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {522#(not (<= main_~c~0 (+ ~last~0 1)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {446#false} is VALID [2022-04-15 12:46:02,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {526#(< ~last~0 199999)} assume !(~c~0 < 200000); {522#(not (<= main_~c~0 (+ ~last~0 1)))} is VALID [2022-04-15 12:46:02,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {526#(< ~last~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {526#(< ~last~0 199999)} is VALID [2022-04-15 12:46:02,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {533#(< main_~c~0 199999)} assume ~c~0 == ~last~0;~st~0 := 0; {526#(< ~last~0 199999)} is VALID [2022-04-15 12:46:02,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {533#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {533#(< main_~c~0 199999)} is VALID [2022-04-15 12:46:02,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {445#true} assume !false;~st~0 := 1;~c~0 := 0; {533#(< main_~c~0 199999)} is VALID [2022-04-15 12:46:02,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {445#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {445#true} is VALID [2022-04-15 12:46:02,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret6 := main(); {445#true} is VALID [2022-04-15 12:46:02,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #66#return; {445#true} is VALID [2022-04-15 12:46:02,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2022-04-15 12:46:02,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {445#true} #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(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {445#true} is VALID [2022-04-15 12:46:02,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2022-04-15 12:46:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:02,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692786295] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:02,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:02,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-15 12:46:02,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:02,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [448937822] [2022-04-15 12:46:02,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [448937822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:02,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:02,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:46:02,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467769190] [2022-04-15 12:46:02,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:02,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:46:02,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:02,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:02,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:02,872 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:46:02,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:02,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:46:02,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:46:02,873 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:02,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:02,992 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2022-04-15 12:46:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:46:02,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:46:02,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-15 12:46:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:02,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-15 12:46:02,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-15 12:46:03,041 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 12:46:03,042 INFO L225 Difference]: With dead ends: 61 [2022-04-15 12:46:03,042 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:46:03,043 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:46:03,044 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:03,044 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 31 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:46:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-04-15 12:46:03,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:03,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:46:03,065 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:46:03,065 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:46:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:03,067 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-04-15 12:46:03,067 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-04-15 12:46:03,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:03,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:03,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 39 states. [2022-04-15 12:46:03,068 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 39 states. [2022-04-15 12:46:03,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:03,069 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-04-15 12:46:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-04-15 12:46:03,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:03,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:03,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:03,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:46:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-04-15 12:46:03,071 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 17 [2022-04-15 12:46:03,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:03,072 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-04-15 12:46:03,072 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:03,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 41 transitions. [2022-04-15 12:46:03,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-15 12:46:03,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:46:03,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:03,110 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:03,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:03,325 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:03,326 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:03,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:03,326 INFO L85 PathProgramCache]: Analyzing trace with hash -2068588025, now seen corresponding path program 1 times [2022-04-15 12:46:03,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:03,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [351650786] [2022-04-15 12:46:03,554 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 12:46:03,558 INFO L158 Benchmark]: Toolchain (without parser) took 3487.34ms. Allocated memory is still 186.6MB. Free memory was 137.1MB in the beginning and 89.9MB in the end (delta: 47.2MB). Peak memory consumption was 48.1MB. Max. memory is 8.0GB. [2022-04-15 12:46:03,558 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 186.6MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:46:03,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.66ms. Allocated memory is still 186.6MB. Free memory was 136.8MB in the beginning and 163.2MB in the end (delta: -26.4MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-04-15 12:46:03,559 INFO L158 Benchmark]: Boogie Preprocessor took 26.71ms. Allocated memory is still 186.6MB. Free memory was 163.2MB in the beginning and 161.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 12:46:03,559 INFO L158 Benchmark]: RCFGBuilder took 221.49ms. Allocated memory is still 186.6MB. Free memory was 161.6MB in the beginning and 150.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:46:03,559 INFO L158 Benchmark]: TraceAbstraction took 3013.64ms. Allocated memory is still 186.6MB. Free memory was 150.2MB in the beginning and 89.9MB in the end (delta: 60.3MB). Peak memory consumption was 61.3MB. Max. memory is 8.0GB. [2022-04-15 12:46:03,561 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.16ms. Allocated memory is still 186.6MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.66ms. Allocated memory is still 186.6MB. Free memory was 136.8MB in the beginning and 163.2MB in the end (delta: -26.4MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.71ms. Allocated memory is still 186.6MB. Free memory was 163.2MB in the beginning and 161.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 221.49ms. Allocated memory is still 186.6MB. Free memory was 161.6MB in the beginning and 150.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3013.64ms. Allocated memory is still 186.6MB. Free memory was 150.2MB in the beginning and 89.9MB in the end (delta: 60.3MB). Peak memory consumption was 61.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 12:46:03,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...