/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/sumt7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:10:21,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:10:21,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:10:21,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:10:21,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:10:21,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:10:21,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:10:21,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:10:21,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:10:21,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:10:21,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:10:21,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:10:21,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:10:21,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:10:21,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:10:21,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:10:21,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:10:21,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:10:21,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:10:21,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:10:21,325 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:10:21,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:10:21,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:10:21,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:10:21,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:10:21,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:10:21,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:10:21,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:10:21,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:10:21,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:10:21,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:10:21,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:10:21,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:10:21,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:10:21,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:10:21,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:10:21,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:10:21,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:10:21,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:10:21,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:10:21,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:10:21,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:10:21,345 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:10:21,355 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:10:21,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:10:21,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:10:21,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:10:21,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:10:21,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:10:21,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:10:21,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:10:21,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:10:21,358 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:10:21,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:10:21,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:10:21,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:10:21,358 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:10:21,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:10:21,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:10:21,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:10:21,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:10:21,359 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:10:21,359 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:10:21,359 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:10:21,359 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:10:21,359 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:10:21,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:10:21,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:10:21,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:10:21,598 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:10:21,599 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:10:21,599 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt7.c [2022-04-15 13:10:21,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f80c2aaf/c99f0003dfb24902904c083f6a7b562b/FLAG3605d148a [2022-04-15 13:10:22,039 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:10:22,040 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt7.c [2022-04-15 13:10:22,044 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f80c2aaf/c99f0003dfb24902904c083f6a7b562b/FLAG3605d148a [2022-04-15 13:10:22,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f80c2aaf/c99f0003dfb24902904c083f6a7b562b [2022-04-15 13:10:22,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:10:22,058 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:10:22,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:10:22,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:10:22,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:10:22,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:10:22" (1/1) ... [2022-04-15 13:10:22,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75057d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:10:22, skipping insertion in model container [2022-04-15 13:10:22,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:10:22" (1/1) ... [2022-04-15 13:10:22,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:10:22,083 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:10:22,292 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/sumt7.c[403,416] [2022-04-15 13:10:22,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:10:22,331 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:10:22,346 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/sumt7.c[403,416] [2022-04-15 13:10:22,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:10:22,376 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:10:22,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:10:22 WrapperNode [2022-04-15 13:10:22,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:10:22,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:10:22,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:10:22,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:10:22,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:10:22" (1/1) ... [2022-04-15 13:10:22,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:10:22" (1/1) ... [2022-04-15 13:10:22,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:10:22" (1/1) ... [2022-04-15 13:10:22,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:10:22" (1/1) ... [2022-04-15 13:10:22,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:10:22" (1/1) ... [2022-04-15 13:10:22,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:10:22" (1/1) ... [2022-04-15 13:10:22,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:10:22" (1/1) ... [2022-04-15 13:10:22,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:10:22,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:10:22,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:10:22,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:10:22,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:10:22" (1/1) ... [2022-04-15 13:10:22,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:10:22,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:10:22,444 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:10:22,466 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:10:22,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:10:22,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:10:22,483 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:10:22,483 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:10:22,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:10:22,484 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:10:22,484 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:10:22,484 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:10:22,484 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:10:22,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:10:22,484 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:10:22,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:10:22,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 13:10:22,485 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:10:22,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:10:22,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:10:22,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:10:22,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:10:22,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:10:22,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:10:22,545 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:10:22,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:10:31,355 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:10:31,360 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:10:31,361 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:10:31,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:10:31 BoogieIcfgContainer [2022-04-15 13:10:31,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:10:31,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:10:31,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:10:31,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:10:31,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:10:22" (1/3) ... [2022-04-15 13:10:31,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c41e20e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:10:31, skipping insertion in model container [2022-04-15 13:10:31,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:10:22" (2/3) ... [2022-04-15 13:10:31,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c41e20e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:10:31, skipping insertion in model container [2022-04-15 13:10:31,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:10:31" (3/3) ... [2022-04-15 13:10:31,369 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt7.c [2022-04-15 13:10:31,373 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:10:31,373 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:10:31,407 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:10:31,413 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:10:31,413 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:10:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 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:10:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 13:10:31,434 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:10:31,434 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:10:31,435 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:10:31,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:10:31,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1555439542, now seen corresponding path program 1 times [2022-04-15 13:10:31,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:31,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [857904116] [2022-04-15 13:10:31,454 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:10:31,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1555439542, now seen corresponding path program 2 times [2022-04-15 13:10:31,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:10:31,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942238541] [2022-04-15 13:10:31,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:31,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:10:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:32,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:10:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:32,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(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; {30#true} is VALID [2022-04-15 13:10:32,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-15 13:10:32,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #81#return; {30#true} is VALID [2022-04-15 13:10:32,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {40#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:10:32,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(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; {30#true} is VALID [2022-04-15 13:10:32,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-15 13:10:32,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #81#return; {30#true} is VALID [2022-04-15 13:10:32,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID [2022-04-15 13:10:32,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {35#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 13:10:32,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {35#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {35#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 13:10:32,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {35#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 13:10:32,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {36#(and (= main_~k~0 0) (= main_~v2~0 0) (<= 1 main_~v1~0) (= main_~j~0 0) (<= main_~v1~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 13:10:32,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#(and (= main_~k~0 0) (= main_~v2~0 0) (<= 1 main_~v1~0) (= main_~j~0 0) (<= main_~v1~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {37#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v3~0 0))} is VALID [2022-04-15 13:10:32,128 INFO L272 TraceCheckUtils]: 10: Hoare triple {37#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {38#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:10:32,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {39#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:10:32,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {31#false} is VALID [2022-04-15 13:10:32,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-04-15 13:10:32,131 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:10:32,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:10:32,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942238541] [2022-04-15 13:10:32,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942238541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:32,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:32,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:10:32,134 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:10:32,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [857904116] [2022-04-15 13:10:32,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [857904116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:32,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:32,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:10:32,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42018993] [2022-04-15 13:10:32,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:10:32,140 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 13:10:32,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:10:32,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:32,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:10:32,163 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:10:32,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:32,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:10:32,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:10:32,187 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 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 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:34,474 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:10:41,126 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:10:45,436 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:10:49,848 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:10:52,014 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:10:54,186 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:10:56,356 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:11:00,753 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:11:02,926 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:11:07,343 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:11:09,348 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:11:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:11,896 INFO L93 Difference]: Finished difference Result 63 states and 89 transitions. [2022-04-15 13:11:11,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:11:11,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 13:11:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:11:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-04-15 13:11:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-04-15 13:11:11,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 89 transitions. [2022-04-15 13:11:12,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:12,033 INFO L225 Difference]: With dead ends: 63 [2022-04-15 13:11:12,033 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 13:11:12,035 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-15 13:11:12,038 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 53 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 12 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:11:12,038 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 55 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 111 Invalid, 10 Unknown, 0 Unchecked, 22.8s Time] [2022-04-15 13:11:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 13:11:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-04-15 13:11:12,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:11:12,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:11:12,074 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:11:12,075 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:11:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:12,080 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-15 13:11:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-15 13:11:12,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:12,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:12,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 13:11:12,083 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 13:11:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:12,093 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-15 13:11:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-15 13:11:12,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:12,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:12,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:11:12,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:11:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:11:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-04-15 13:11:12,104 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2022-04-15 13:11:12,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:11:12,104 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-04-15 13:11:12,105 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:12,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 37 transitions. [2022-04-15 13:11:12,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-15 13:11:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:11:12,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:11:12,168 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:11:12,168 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:11:12,168 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:11:12,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:11:12,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2040977129, now seen corresponding path program 1 times [2022-04-15 13:11:12,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:12,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1227714956] [2022-04-15 13:11:12,173 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:11:12,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2040977129, now seen corresponding path program 2 times [2022-04-15 13:11:12,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:11:12,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540734181] [2022-04-15 13:11:12,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:11:12,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:11:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:12,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:11:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:12,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#(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; {314#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:11:12,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {314#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:11:12,533 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {314#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {305#true} #81#return; {310#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:11:12,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {313#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:11:12,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#(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; {314#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:11:12,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {314#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:11:12,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {305#true} #81#return; {310#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:11:12,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {310#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {310#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:11:12,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {310#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {311#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) (div main_~l~0 4294967296)) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:11:12,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {311#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) (div main_~l~0 4294967296)) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {312#(= main_~l~0 0)} is VALID [2022-04-15 13:11:12,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {312#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {312#(= main_~l~0 0)} is VALID [2022-04-15 13:11:12,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {312#(= main_~l~0 0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {306#false} is VALID [2022-04-15 13:11:12,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {306#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {306#false} is VALID [2022-04-15 13:11:12,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {306#false} ~l~0 := 1 + ~l~0; {306#false} is VALID [2022-04-15 13:11:12,540 INFO L272 TraceCheckUtils]: 11: Hoare triple {306#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {306#false} is VALID [2022-04-15 13:11:12,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {306#false} ~cond := #in~cond; {306#false} is VALID [2022-04-15 13:11:12,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {306#false} assume 0 == ~cond; {306#false} is VALID [2022-04-15 13:11:12,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {306#false} assume !false; {306#false} is VALID [2022-04-15 13:11:12,541 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:11:12,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:11:12,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540734181] [2022-04-15 13:11:12,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540734181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:12,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:12,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:11:12,542 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:11:12,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1227714956] [2022-04-15 13:11:12,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1227714956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:12,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:12,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:11:12,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433054526] [2022-04-15 13:11:12,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:11:12,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-15 13:11:12,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:11:12,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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:11:14,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:14,731 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:11:14,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:14,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:11:14,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:11:14,732 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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:11:21,232 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:11:25,594 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:11:32,045 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:11:36,404 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:11:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:36,614 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-15 13:11:36,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:11:36,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-15 13:11:36,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:11:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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:11:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-15 13:11:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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:11:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-15 13:11:36,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-15 13:11:38,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:38,842 INFO L225 Difference]: With dead ends: 45 [2022-04-15 13:11:38,842 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 13:11:38,843 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:11:38,844 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 12 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:11:38,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 30 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 24 Invalid, 4 Unknown, 0 Unchecked, 8.1s Time] [2022-04-15 13:11:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 13:11:38,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 13:11:38,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:11:38,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:11:38,892 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:11:38,893 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:11:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:38,895 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 13:11:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 13:11:38,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:38,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:38,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-15 13:11:38,896 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-15 13:11:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:38,898 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 13:11:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 13:11:38,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:38,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:38,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:11:38,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:11:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:11:38,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-15 13:11:38,901 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 15 [2022-04-15 13:11:38,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:11:38,901 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-15 13:11:38,902 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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:11:38,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-15 13:11:38,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 13:11:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 13:11:38,956 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:11:38,957 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:11:38,957 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:11:38,957 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:11:38,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:11:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1572266990, now seen corresponding path program 1 times [2022-04-15 13:11:38,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:38,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [877012966] [2022-04-15 13:11:41,016 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:11:41,019 INFO L85 PathProgramCache]: Analyzing trace with hash 738488328, now seen corresponding path program 1 times [2022-04-15 13:11:41,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:11:41,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856873073] [2022-04-15 13:11:41,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:11:41,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:11:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:41,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:11:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:41,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {545#(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; {546#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:11:41,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {546#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:11:41,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {546#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {531#true} #81#return; {536#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:11:41,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {531#true} call ULTIMATE.init(); {545#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:11:41,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#(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; {546#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:11:41,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {546#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {546#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:11:41,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {546#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {531#true} #81#return; {536#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:11:41,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {536#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {536#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:11:41,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {536#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {537#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (or (<= ~SIZE~0 20000001) (< (div ~SIZE~0 4294967296) (+ (div main_~n~0 4294967296) 1))) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 13:11:41,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {537#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (or (<= ~SIZE~0 20000001) (< (div ~SIZE~0 4294967296) (+ (div main_~n~0 4294967296) 1))) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {538#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (or (<= 0 (div main_~n~0 4294967296)) (<= (+ 4274967295 main_~n~0) 0)) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 13:11:41,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (or (<= 0 (div main_~n~0 4294967296)) (<= (+ 4274967295 main_~n~0) 0)) (= main_~v1~0 0) (= main_~v3~0 0))} [85] L38-1-->L23_primed: Formula: (or (and (= v_main_~l~0_In_1 v_main_~l~0_Out_2) (= v_main_~i~0_In_1 v_main_~i~0_In_1) (= v_main_~n~0_In_1 v_main_~n~0_In_1) (= v_main_~v3~0_In_1 v_main_~v3~0_In_1) (= v_main_~j~0_In_1 v_main_~j~0_In_1) (= v_main_~v1~0_In_1 v_main_~v1~0_Out_2) (= v_main_~v2~0_In_1 v_main_~v2~0_In_1) (= v_main_~k~0_In_1 v_main_~k~0_In_1) (= v_main_~v4~0_In_1 v_main_~v4~0_In_1)) (let ((.cse0 (mod (+ v_main_~l~0_Out_2 4294967295) 4294967296))) (and (= (mod (+ v_main_~v1~0_Out_2 v_main_~i~0_In_1 v_main_~v3~0_In_1 v_main_~j~0_In_1 v_main_~v4~0_In_1 v_main_~v2~0_In_1 v_main_~k~0_In_1) 4294967296) (mod v_main_~l~0_Out_2 4294967296)) (< .cse0 (mod v_main_~n~0_In_1 4294967296)) (= v_main_~v2~0_In_1 0) (= v_main_~v4~0_In_1 0) (= v_main_~i~0_In_1 0) (= (+ (* (- 1) v_main_~l~0_In_1) v_main_~v1~0_In_1) (+ v_main_~v1~0_Out_2 (* (- 1) v_main_~l~0_Out_2))) (= (mod (mod .cse0 7) 4294967296) 0) (= v_main_~n~0_In_1 0) (= v_main_~j~0_In_1 0) (= v_main_~v3~0_In_1 0) (<= v_main_~l~0_In_1 v_main_~l~0_Out_2) (= v_main_~k~0_In_1 0)))) InVars {main_~l~0=v_main_~l~0_In_1, main_~v1~0=v_main_~v1~0_In_1, main_~v2~0=v_main_~v2~0_In_1, main_~k~0=v_main_~k~0_In_1, main_~v4~0=v_main_~v4~0_In_1, main_~j~0=v_main_~j~0_In_1, main_~i~0=v_main_~i~0_In_1, main_~v3~0=v_main_~v3~0_In_1, main_~n~0=v_main_~n~0_In_1} OutVars{main_~l~0=v_main_~l~0_Out_2, main_~v1~0=v_main_~v1~0_Out_2, main_~v2~0=v_main_~v2~0_In_1, main_~k~0=v_main_~k~0_In_1, main_~v4~0=v_main_~v4~0_In_1, main_~j~0=v_main_~j~0_In_1, main_~i~0=v_main_~i~0_In_1, main_~v3~0=v_main_~v3~0_In_1, main_~n~0=v_main_~n~0_In_1} AuxVars[] AssignedVars[main_~l~0, main_~v1~0] {539#(or (and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0)) (and (= main_~l~0 0) (not (<= (+ (div main_~n~0 4294967296) 1) (div main_~l~0 4294967296))) (<= main_~n~0 0)))} is VALID [2022-04-15 13:11:41,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#(or (and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0)) (and (= main_~l~0 0) (not (<= (+ (div main_~n~0 4294967296) 1) (div main_~l~0 4294967296))) (<= main_~n~0 0)))} [84] L23_primed-->L23: Formula: (< (mod v_main_~l~0_12 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_12, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_12, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {540#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 13:11:41,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {541#(and (<= main_~v1~0 (+ main_~l~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ main_~l~0 1) main_~v1~0) (= main_~v3~0 0))} is VALID [2022-04-15 13:11:41,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {541#(and (<= main_~v1~0 (+ main_~l~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ main_~l~0 1) main_~v1~0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {542#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (not (<= (+ (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 1) 0)) (= main_~i~0 0) (= main_~v4~0 0) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v3~0 0))} is VALID [2022-04-15 13:11:41,852 INFO L272 TraceCheckUtils]: 11: Hoare triple {542#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (not (<= (+ (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 1) 0)) (= main_~i~0 0) (= main_~v4~0 0) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:11:41,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {543#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {544#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:11:41,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {544#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {532#false} is VALID [2022-04-15 13:11:41,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {532#false} assume !false; {532#false} is VALID [2022-04-15 13:11:41,871 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:11:41,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:11:41,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856873073] [2022-04-15 13:11:41,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856873073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:41,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:41,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 13:11:46,709 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:11:46,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [877012966] [2022-04-15 13:11:46,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [877012966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:46,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:46,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 13:11:46,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594865780] [2022-04-15 13:11:46,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:11:46,711 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 12 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-15 13:11:46,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:11:46,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 12 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:11:46,739 WARN L143 InductivityCheck]: Transition 552#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) ( _ , assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); , 540#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0)) ) not inductive [2022-04-15 13:11:46,740 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:11:46,740 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 13:11:46,744 INFO L158 Benchmark]: Toolchain (without parser) took 84686.36ms. Allocated memory was 166.7MB in the beginning and 212.9MB in the end (delta: 46.1MB). Free memory was 115.0MB in the beginning and 150.9MB in the end (delta: -36.0MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-04-15 13:11:46,745 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 166.7MB. Free memory was 131.7MB in the beginning and 131.7MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:11:46,745 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.32ms. Allocated memory was 166.7MB in the beginning and 212.9MB in the end (delta: 46.1MB). Free memory was 114.8MB in the beginning and 188.3MB in the end (delta: -73.6MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-04-15 13:11:46,745 INFO L158 Benchmark]: Boogie Preprocessor took 39.37ms. Allocated memory is still 212.9MB. Free memory was 188.3MB in the beginning and 186.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 13:11:46,746 INFO L158 Benchmark]: RCFGBuilder took 8945.28ms. Allocated memory is still 212.9MB. Free memory was 186.7MB in the beginning and 173.7MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 13:11:46,746 INFO L158 Benchmark]: TraceAbstraction took 75379.61ms. Allocated memory is still 212.9MB. Free memory was 173.3MB in the beginning and 150.9MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-04-15 13:11:46,747 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 166.7MB. Free memory was 131.7MB in the beginning and 131.7MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 317.32ms. Allocated memory was 166.7MB in the beginning and 212.9MB in the end (delta: 46.1MB). Free memory was 114.8MB in the beginning and 188.3MB in the end (delta: -73.6MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.37ms. Allocated memory is still 212.9MB. Free memory was 188.3MB in the beginning and 186.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 8945.28ms. Allocated memory is still 212.9MB. Free memory was 186.7MB in the beginning and 173.7MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 75379.61ms. Allocated memory is still 212.9MB. Free memory was 173.3MB in the beginning and 150.9MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 13:11:46,785 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...