/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:09:04,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:09:04,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:09:04,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:09:04,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:09:04,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:09:04,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:09:04,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:09:04,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:09:04,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:09:04,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:09:04,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:09:04,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:09:04,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:09:04,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:09:04,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:09:04,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:09:04,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:09:04,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:09:04,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:09:04,522 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:09:04,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:09:04,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:09:04,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:09:04,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:09:04,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:09:04,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:09:04,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:09:04,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:09:04,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:09:04,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:09:04,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:09:04,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:09:04,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:09:04,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:09:04,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:09:04,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:09:04,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:09:04,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:09:04,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:09:04,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:09:04,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:09:04,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:09:04,549 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:09:04,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:09:04,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:09:04,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:09:04,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:09:04,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:09:04,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:09:04,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:09:04,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:09:04,552 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:09:04,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:09:04,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:09:04,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:09:04,553 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:09:04,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:09:04,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:09:04,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:09:04,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:09:04,553 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:09:04,554 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:09:04,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:09:04,554 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:09:04,554 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:09:04,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:09:04,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:09:04,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:09:04,812 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:09:04,815 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:09:04,816 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt3.c [2022-04-15 13:09:04,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3112dea/c995adbf7dc748bf98b55133d0269c52/FLAG330522ac7 [2022-04-15 13:09:05,210 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:09:05,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt3.c [2022-04-15 13:09:05,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3112dea/c995adbf7dc748bf98b55133d0269c52/FLAG330522ac7 [2022-04-15 13:09:05,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3112dea/c995adbf7dc748bf98b55133d0269c52 [2022-04-15 13:09:05,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:09:05,228 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:09:05,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:09:05,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:09:05,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:09:05,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:09:05" (1/1) ... [2022-04-15 13:09:05,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142f1c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:05, skipping insertion in model container [2022-04-15 13:09:05,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:09:05" (1/1) ... [2022-04-15 13:09:05,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:09:05,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:09:05,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt3.c[403,416] [2022-04-15 13:09:05,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:09:05,406 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:09:05,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt3.c[403,416] [2022-04-15 13:09:05,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:09:05,436 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:09:05,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:05 WrapperNode [2022-04-15 13:09:05,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:09:05,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:09:05,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:09:05,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:09:05,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:05" (1/1) ... [2022-04-15 13:09:05,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:05" (1/1) ... [2022-04-15 13:09:05,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:05" (1/1) ... [2022-04-15 13:09:05,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:05" (1/1) ... [2022-04-15 13:09:05,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:05" (1/1) ... [2022-04-15 13:09:05,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:05" (1/1) ... [2022-04-15 13:09:05,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:05" (1/1) ... [2022-04-15 13:09:05,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:09:05,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:09:05,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:09:05,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:09:05,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:05" (1/1) ... [2022-04-15 13:09:05,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:09:05,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:09:05,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 13:09:05,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 13:09:05,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:09:05,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:09:05,543 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:09:05,544 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:09:05,544 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:09:05,544 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:09:05,544 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:09:05,544 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:09:05,544 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:09:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:09:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:09:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:09:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 13:09:05,546 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:09:05,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:09:05,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:09:05,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:09:05,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:09:05,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:09:05,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:09:05,594 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:09:05,595 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:09:07,899 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:09:07,905 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:09:07,905 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:09:07,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:09:07 BoogieIcfgContainer [2022-04-15 13:09:07,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:09:07,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:09:07,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:09:07,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:09:07,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:09:05" (1/3) ... [2022-04-15 13:09:07,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e14547b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:09:07, skipping insertion in model container [2022-04-15 13:09:07,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:05" (2/3) ... [2022-04-15 13:09:07,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e14547b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:09:07, skipping insertion in model container [2022-04-15 13:09:07,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:09:07" (3/3) ... [2022-04-15 13:09:07,932 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt3.c [2022-04-15 13:09:07,937 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:09:07,938 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:09:07,968 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:09:07,990 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 13:09:07,990 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:09:08,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 13:09:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:09:08,024 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:08,025 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:09:08,025 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:08,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:08,030 INFO L85 PathProgramCache]: Analyzing trace with hash -639692549, now seen corresponding path program 1 times [2022-04-15 13:09:08,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:08,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [345361039] [2022-04-15 13:09:08,049 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:09:08,049 INFO L85 PathProgramCache]: Analyzing trace with hash -639692549, now seen corresponding path program 2 times [2022-04-15 13:09:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:08,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589326271] [2022-04-15 13:09:08,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:08,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:08,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:09:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:08,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {26#true} is VALID [2022-04-15 13:09:08,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 13:09:08,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #61#return; {26#true} is VALID [2022-04-15 13:09:08,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:09:08,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {26#true} is VALID [2022-04-15 13:09:08,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 13:09:08,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #61#return; {26#true} is VALID [2022-04-15 13:09:08,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2022-04-15 13:09:08,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {26#true} is VALID [2022-04-15 13:09:08,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {26#true} is VALID [2022-04-15 13:09:08,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-15 13:09:08,204 INFO L272 TraceCheckUtils]: 8: Hoare triple {27#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-15 13:09:08,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-15 13:09:08,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-15 13:09:08,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-15 13:09:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:09:08,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:09:08,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589326271] [2022-04-15 13:09:08,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589326271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:08,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:08,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:09:08,211 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:09:08,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [345361039] [2022-04-15 13:09:08,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [345361039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:08,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:08,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:09:08,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343613540] [2022-04-15 13:09:08,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:09:08,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:09:08,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:09:08,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:08,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:08,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:09:08,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:08,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:09:08,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:09:08,274 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:10,549 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 13:09:10,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:09:10,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:09:10,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:09:10,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-04-15 13:09:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-04-15 13:09:10,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2022-04-15 13:09:10,615 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 13:09:10,623 INFO L225 Difference]: With dead ends: 35 [2022-04-15 13:09:10,623 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 13:09:10,626 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:09:10,629 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:09:10,631 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 26 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:09:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 13:09:10,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 13:09:10,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:09:10,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:10,661 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:10,661 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:10,664 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 13:09:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 13:09:10,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:10,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:10,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 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) Second operand 16 states. [2022-04-15 13:09:10,665 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 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) Second operand 16 states. [2022-04-15 13:09:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:10,667 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 13:09:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 13:09:10,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:10,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:10,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:09:10,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:09:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-15 13:09:10,670 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-15 13:09:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:09:10,670 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-15 13:09:10,671 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:10,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-15 13:09:10,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 13:09:10,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:09:10,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:10,692 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:09:10,693 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:09:10,693 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:10,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:10,694 INFO L85 PathProgramCache]: Analyzing trace with hash -654468885, now seen corresponding path program 1 times [2022-04-15 13:09:10,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:10,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [117577189] [2022-04-15 13:09:10,695 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:09:10,695 INFO L85 PathProgramCache]: Analyzing trace with hash -654468885, now seen corresponding path program 2 times [2022-04-15 13:09:10,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:10,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428384301] [2022-04-15 13:09:10,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:10,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:10,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:09:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:10,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {168#true} is VALID [2022-04-15 13:09:10,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-15 13:09:10,967 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {168#true} {168#true} #61#return; {168#true} is VALID [2022-04-15 13:09:10,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {176#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:09:10,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {168#true} is VALID [2022-04-15 13:09:10,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-15 13:09:10,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #61#return; {168#true} is VALID [2022-04-15 13:09:10,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret5 := main(); {168#true} is VALID [2022-04-15 13:09:10,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {168#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {168#true} is VALID [2022-04-15 13:09:10,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {168#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {173#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-15 13:09:10,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {173#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {173#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-15 13:09:10,971 INFO L272 TraceCheckUtils]: 8: Hoare triple {173#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:09:10,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {175#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:09:10,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {175#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {169#false} is VALID [2022-04-15 13:09:10,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {169#false} assume !false; {169#false} is VALID [2022-04-15 13:09:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:09:10,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:09:10,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428384301] [2022-04-15 13:09:10,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428384301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:10,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:10,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:09:10,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:09:10,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [117577189] [2022-04-15 13:09:10,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [117577189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:10,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:10,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:09:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465704020] [2022-04-15 13:09:10,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:09:10,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:09:10,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:09:10,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:10,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:10,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:09:10,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:10,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:09:10,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:09:10,989 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:13,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:09:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:13,367 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-15 13:09:13,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:09:13,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:09:13,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:09:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-15 13:09:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-15 13:09:13,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-15 13:09:13,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:13,412 INFO L225 Difference]: With dead ends: 23 [2022-04-15 13:09:13,412 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 13:09:13,412 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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 13:09:13,413 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:09:13,414 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 13:09:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 13:09:13,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-15 13:09:13,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:09:13,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:13,420 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:13,420 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:13,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:13,422 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-15 13:09:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-15 13:09:13,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:13,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:13,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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) Second operand 18 states. [2022-04-15 13:09:13,423 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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) Second operand 18 states. [2022-04-15 13:09:13,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:13,424 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-15 13:09:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-15 13:09:13,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:13,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:13,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:09:13,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:09:13,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 13:09:13,427 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-15 13:09:13,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:09:13,427 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 13:09:13,427 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:13,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 13:09:13,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:13,448 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:09:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:09:13,449 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:13,449 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:09:13,449 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:09:13,449 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:13,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:13,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1940796243, now seen corresponding path program 1 times [2022-04-15 13:09:13,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:13,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [753292512] [2022-04-15 13:09:13,913 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:09:13,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1843117673, now seen corresponding path program 1 times [2022-04-15 13:09:13,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:13,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021726374] [2022-04-15 13:09:13,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:13,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:14,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:09:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:14,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {310#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {301#true} is VALID [2022-04-15 13:09:14,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 13:09:14,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #61#return; {301#true} is VALID [2022-04-15 13:09:14,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {310#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:09:14,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {301#true} is VALID [2022-04-15 13:09:14,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 13:09:14,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #61#return; {301#true} is VALID [2022-04-15 13:09:14,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-15 13:09:14,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {301#true} is VALID [2022-04-15 13:09:14,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {301#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {306#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-15 13:09:14,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {306#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [65] L24-2-->L24-3_primed: Formula: (or (and (= v_main_~l~0_In_1 v_main_~l~0_Out_2) (= v_main_~n~0_In_1 v_main_~n~0_In_1) (= v_main_~i~0_In_1 v_main_~i~0_Out_2)) (let ((.cse0 (mod (+ v_main_~l~0_Out_2 4294967295) 4294967296))) (and (= 0 (mod (mod .cse0 3) 4294967296)) (< .cse0 (mod v_main_~n~0_In_1 4294967296)) (= (+ (* (- 1) v_main_~l~0_Out_2) v_main_~i~0_Out_2) (+ (* (- 1) v_main_~l~0_In_1) v_main_~i~0_In_1)) (= v_main_~n~0_In_1 0) (<= v_main_~l~0_In_1 v_main_~l~0_Out_2)))) InVars {main_~i~0=v_main_~i~0_In_1, main_~l~0=v_main_~l~0_In_1, main_~n~0=v_main_~n~0_In_1} OutVars{main_~i~0=v_main_~i~0_Out_2, main_~l~0=v_main_~l~0_Out_2, main_~n~0=v_main_~n~0_In_1} AuxVars[] AssignedVars[main_~l~0, main_~i~0] {307#(and (<= (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296))) (= main_~k~0 0) (<= main_~l~0 main_~i~0) (= main_~j~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) 1)))} is VALID [2022-04-15 13:09:14,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {307#(and (<= (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296))) (= main_~k~0 0) (<= main_~l~0 main_~i~0) (= main_~j~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) 1)))} [64] L24-3_primed-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {307#(and (<= (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296))) (= main_~k~0 0) (<= main_~l~0 main_~i~0) (= main_~j~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) 1)))} is VALID [2022-04-15 13:09:14,389 INFO L272 TraceCheckUtils]: 9: Hoare triple {307#(and (<= (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296))) (= main_~k~0 0) (<= main_~l~0 main_~i~0) (= main_~j~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) 1)))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {308#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:09:14,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {308#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {309#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:09:14,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {309#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {302#false} is VALID [2022-04-15 13:09:14,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-15 13:09:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:09:14,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:09:14,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021726374] [2022-04-15 13:09:14,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021726374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:14,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:14,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:09:18,746 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~l~0 4294967296))) (and (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= c_main_~j~0 0) (= c_main_~i~0 1) (= (mod (mod .cse0 3) 4294967296) 0) (= c_main_~k~0 0))) is different from false [2022-04-15 13:09:18,809 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:09:18,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [753292512] [2022-04-15 13:09:18,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [753292512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:18,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:18,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 13:09:18,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801608820] [2022-04-15 13:09:18,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:09:18,810 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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 15 [2022-04-15 13:09:18,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:09:18,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:18,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:18,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 13:09:18,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:18,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 13:09:18,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2022-04-15 13:09:18,831 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:23,175 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:09:25,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:09:25,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:25,708 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-15 13:09:25,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:09:25,709 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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 15 [2022-04-15 13:09:25,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:09:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-15 13:09:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-15 13:09:25,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2022-04-15 13:09:25,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:25,761 INFO L225 Difference]: With dead ends: 33 [2022-04-15 13:09:25,761 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 13:09:25,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=51, Invalid=161, Unknown=2, NotChecked=26, Total=240 [2022-04-15 13:09:25,762 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:09:25,763 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 46 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 2 Unknown, 15 Unchecked, 4.3s Time] [2022-04-15 13:09:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 13:09:25,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 13:09:25,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:09:25,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:25,770 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:25,770 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:25,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:25,771 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-15 13:09:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 13:09:25,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:25,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:25,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 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) Second operand 21 states. [2022-04-15 13:09:25,772 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 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) Second operand 21 states. [2022-04-15 13:09:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:25,774 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-15 13:09:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 13:09:25,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:25,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:25,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:09:25,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:09:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-15 13:09:25,775 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2022-04-15 13:09:25,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:09:25,776 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-15 13:09:25,776 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:25,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-15 13:09:25,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:25,808 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 13:09:25,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 13:09:25,808 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:25,808 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:09:25,808 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:09:25,809 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:25,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:25,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2042434564, now seen corresponding path program 1 times [2022-04-15 13:09:25,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:25,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1301037718] [2022-04-15 13:09:26,283 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:09:26,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1784012329, now seen corresponding path program 1 times [2022-04-15 13:09:26,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:26,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715306572] [2022-04-15 13:09:26,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:26,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:26,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:09:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:26,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {490#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:09:26,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:09:26,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {478#true} #61#return; {483#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:09:26,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {478#true} call ULTIMATE.init(); {490#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:09:26,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:09:26,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:09:26,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {478#true} #61#return; {483#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:09:26,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {483#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {483#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:09:26,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {484#(and (or (<= ~SIZE~0 20000001) (< (div ~SIZE~0 4294967296) (+ (div main_~n~0 4294967296) 1))) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:09:26,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {484#(and (or (<= ~SIZE~0 20000001) (< (div ~SIZE~0 4294967296) (+ (div main_~n~0 4294967296) 1))) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {485#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (or (<= 0 (div main_~n~0 4294967296)) (<= (+ 4274967295 main_~n~0) 0)))} is VALID [2022-04-15 13:09:26,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {485#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (or (<= 0 (div main_~n~0 4294967296)) (<= (+ 4274967295 main_~n~0) 0)))} [67] L24-2-->L24-3_primed: Formula: (or (and (= v_main_~n~0_In_2 v_main_~n~0_In_2) (= v_main_~l~0_In_2 v_main_~l~0_Out_4) (= v_main_~k~0_In_1 v_main_~k~0_Out_2)) (let ((.cse0 (mod (+ v_main_~l~0_Out_4 4294967295) 4294967296))) (and (not (= (mod (mod .cse0 3) 4294967296) 0)) (not (= (mod (+ v_main_~l~0_Out_4 1) 2) 0)) (= (+ (* (- 1) v_main_~l~0_In_2) v_main_~k~0_In_1) (+ (* (- 1) v_main_~l~0_Out_4) v_main_~k~0_Out_2)) (<= v_main_~l~0_In_2 v_main_~l~0_Out_4) (= v_main_~n~0_In_2 0) (< .cse0 (mod v_main_~n~0_In_2 4294967296))))) InVars {main_~l~0=v_main_~l~0_In_2, main_~n~0=v_main_~n~0_In_2, main_~k~0=v_main_~k~0_In_1} OutVars{main_~l~0=v_main_~l~0_Out_4, main_~n~0=v_main_~n~0_In_2, main_~k~0=v_main_~k~0_Out_2} AuxVars[] AssignedVars[main_~l~0, main_~k~0] {486#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (<= main_~l~0 main_~k~0) (<= (+ main_~k~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~l~0)))} is VALID [2022-04-15 13:09:26,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {486#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (<= main_~l~0 main_~k~0) (<= (+ main_~k~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~l~0)))} [66] L24-3_primed-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {487#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (<= (+ main_~k~0 (* (div main_~l~0 4294967296) 4294967296)) (* main_~l~0 2)) (<= main_~l~0 main_~k~0))} is VALID [2022-04-15 13:09:26,796 INFO L272 TraceCheckUtils]: 9: Hoare triple {487#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (<= (+ main_~k~0 (* (div main_~l~0 4294967296) 4294967296)) (* main_~l~0 2)) (<= main_~l~0 main_~k~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {488#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:09:26,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {488#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {489#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:09:26,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {479#false} is VALID [2022-04-15 13:09:26,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {479#false} assume !false; {479#false} is VALID [2022-04-15 13:09:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:09:26,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:09:26,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715306572] [2022-04-15 13:09:26,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715306572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:26,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:26,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 13:09:26,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:09:26,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1301037718] [2022-04-15 13:09:26,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1301037718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:26,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:26,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 13:09:26,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692348387] [2022-04-15 13:09:26,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:09:26,910 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 13:09:26,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:09:26,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:29,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:29,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 13:09:29,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:29,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 13:09:29,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-15 13:09:29,087 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:35,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:09:37,754 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:09:39,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:09:42,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:09:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:42,378 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-15 13:09:42,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:09:42,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 13:09:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:09:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-15 13:09:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-15 13:09:42,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-15 13:09:44,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:44,581 INFO L225 Difference]: With dead ends: 30 [2022-04-15 13:09:44,581 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 13:09:44,582 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:09:44,582 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 43 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-04-15 13:09:44,583 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 38 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 4 Unknown, 0 Unchecked, 8.6s Time] [2022-04-15 13:09:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 13:09:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 13:09:44,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:09:44,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:44,619 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:44,619 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:44,620 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 13:09:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 13:09:44,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:44,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:44,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 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) Second operand 21 states. [2022-04-15 13:09:44,621 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 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) Second operand 21 states. [2022-04-15 13:09:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:44,622 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 13:09:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 13:09:44,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:44,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:44,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:09:44,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:09:44,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-15 13:09:44,624 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2022-04-15 13:09:44,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:09:44,625 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-15 13:09:44,625 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:44,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-15 13:09:44,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 13:09:44,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 13:09:44,659 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:44,659 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:09:44,660 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 13:09:44,660 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:44,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:44,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1013814982, now seen corresponding path program 1 times [2022-04-15 13:09:44,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:44,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [94328364] [2022-04-15 13:09:45,869 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.pushout(QvasrAbstractionJoin.java:181) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.join(QvasrAbstractionJoin.java:116) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.summarizeLoop(QvasrSummarizer.java:130) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrLoopSummarization.getQvasrAcceleration(QvasrLoopSummarization.java:87) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorQvasr.accelerateLoop(AcceleratorQvasr.java:91) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 13:09:45,873 INFO L158 Benchmark]: Toolchain (without parser) took 40644.60ms. Allocated memory was 178.3MB in the beginning and 244.3MB in the end (delta: 66.1MB). Free memory was 128.1MB in the beginning and 128.8MB in the end (delta: -653.4kB). Peak memory consumption was 66.3MB. Max. memory is 8.0GB. [2022-04-15 13:09:45,874 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 178.3MB. Free memory was 144.3MB in the beginning and 144.3MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:09:45,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.85ms. Allocated memory is still 178.3MB. Free memory was 127.9MB in the beginning and 152.7MB in the end (delta: -24.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 13:09:45,874 INFO L158 Benchmark]: Boogie Preprocessor took 41.04ms. Allocated memory is still 178.3MB. Free memory was 152.7MB in the beginning and 151.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 13:09:45,874 INFO L158 Benchmark]: RCFGBuilder took 2433.52ms. Allocated memory is still 178.3MB. Free memory was 151.1MB in the beginning and 140.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 13:09:45,875 INFO L158 Benchmark]: TraceAbstraction took 37959.23ms. Allocated memory was 178.3MB in the beginning and 244.3MB in the end (delta: 66.1MB). Free memory was 139.6MB in the beginning and 128.8MB in the end (delta: 10.8MB). Peak memory consumption was 78.4MB. Max. memory is 8.0GB. [2022-04-15 13:09:45,876 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.14ms. Allocated memory is still 178.3MB. Free memory was 144.3MB in the beginning and 144.3MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.85ms. Allocated memory is still 178.3MB. Free memory was 127.9MB in the beginning and 152.7MB in the end (delta: -24.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.04ms. Allocated memory is still 178.3MB. Free memory was 152.7MB in the beginning and 151.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 2433.52ms. Allocated memory is still 178.3MB. Free memory was 151.1MB in the beginning and 140.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 37959.23ms. Allocated memory was 178.3MB in the beginning and 244.3MB in the end (delta: 66.1MB). Free memory was 139.6MB in the beginning and 128.8MB in the end (delta: 10.8MB). Peak memory consumption was 78.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0: de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 13:09:45,899 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...