/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:15:04,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:15:04,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:15:04,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:15:04,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:15:04,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:15:04,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:15:04,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:15:04,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:15:04,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:15:04,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:15:04,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:15:04,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:15:04,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:15:04,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:15:04,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:15:04,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:15:04,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:15:04,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:15:04,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:15:04,554 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:15:04,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:15:04,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:15:04,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:15:04,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:15:04,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:15:04,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:15:04,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:15:04,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:15:04,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:15:04,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:15:04,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:15:04,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:15:04,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:15:04,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:15:04,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:15:04,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:15:04,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:15:04,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:15:04,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:15:04,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:15:04,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:15:04,588 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:15:04,608 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:15:04,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:15:04,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:15:04,611 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:15:04,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:15:04,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:15:04,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:15:04,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:15:04,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:15:04,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:15:04,613 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:15:04,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:15:04,613 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:15:04,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:15:04,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:15:04,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:15:04,614 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:15:04,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:15:04,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:15:04,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:15:04,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:15:04,615 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:15:04,615 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:15:04,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:15:04,615 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:15:04,615 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-08 04:15:04,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:15:04,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:15:04,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:15:04,897 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:15:04,898 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:15:04,899 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt8.c [2022-04-08 04:15:04,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46ab739c3/f460e0704fc247a69fee88cac31c4658/FLAG3abe8c712 [2022-04-08 04:15:05,358 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:15:05,358 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt8.c [2022-04-08 04:15:05,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46ab739c3/f460e0704fc247a69fee88cac31c4658/FLAG3abe8c712 [2022-04-08 04:15:05,375 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46ab739c3/f460e0704fc247a69fee88cac31c4658 [2022-04-08 04:15:05,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:15:05,380 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:15:05,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:15:05,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:15:05,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:15:05,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:15:05" (1/1) ... [2022-04-08 04:15:05,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e4a28d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:05, skipping insertion in model container [2022-04-08 04:15:05,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:15:05" (1/1) ... [2022-04-08 04:15:05,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:15:05,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:15:05,552 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/sumt8.c[403,416] [2022-04-08 04:15:05,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:15:05,578 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:15:05,590 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/sumt8.c[403,416] [2022-04-08 04:15:05,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:15:05,610 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:15:05,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:05 WrapperNode [2022-04-08 04:15:05,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:15:05,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:15:05,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:15:05,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:15:05,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:05" (1/1) ... [2022-04-08 04:15:05,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:05" (1/1) ... [2022-04-08 04:15:05,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:05" (1/1) ... [2022-04-08 04:15:05,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:05" (1/1) ... [2022-04-08 04:15:05,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:05" (1/1) ... [2022-04-08 04:15:05,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:05" (1/1) ... [2022-04-08 04:15:05,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:05" (1/1) ... [2022-04-08 04:15:05,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:15:05,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:15:05,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:15:05,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:15:05,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:05" (1/1) ... [2022-04-08 04:15:05,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:15:05,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:15:05,670 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-08 04:15:05,676 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-08 04:15:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:15:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:15:05,702 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:15:05,702 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:15:05,702 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:15:05,702 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:15:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:15:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:15:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:15:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:15:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:15:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:15:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 04:15:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:15:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:15:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:15:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:15:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:15:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:15:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:15:05,758 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:15:05,760 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:15:14,626 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:15:14,632 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:15:14,632 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:15:14,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:15:14 BoogieIcfgContainer [2022-04-08 04:15:14,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:15:14,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:15:14,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:15:14,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:15:14,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:15:05" (1/3) ... [2022-04-08 04:15:14,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a62f19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:15:14, skipping insertion in model container [2022-04-08 04:15:14,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:05" (2/3) ... [2022-04-08 04:15:14,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a62f19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:15:14, skipping insertion in model container [2022-04-08 04:15:14,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:15:14" (3/3) ... [2022-04-08 04:15:14,646 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt8.c [2022-04-08 04:15:14,650 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:15:14,650 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:15:14,688 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:15:14,694 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-08 04:15:14,695 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:15:14,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 22 states have internal predecessors, (32), 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-08 04:15:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 04:15:14,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:15:14,719 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:15:14,720 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:15:14,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:15:14,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1128394070, now seen corresponding path program 1 times [2022-04-08 04:15:14,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:15:14,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2759942] [2022-04-08 04:15:14,743 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:15:14,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1128394070, now seen corresponding path program 2 times [2022-04-08 04:15:14,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:15:14,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116942478] [2022-04-08 04:15:14,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:15:14,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:15:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:15:15,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:15:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:15:15,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(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; {31#true} is VALID [2022-04-08 04:15:15,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 04:15:15,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #86#return; {31#true} is VALID [2022-04-08 04:15:15,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {41#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:15:15,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(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; {31#true} is VALID [2022-04-08 04:15:15,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 04:15:15,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #86#return; {31#true} is VALID [2022-04-08 04:15:15,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-08 04:15:15,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#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;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {36#(and (= main_~v5~0 0) (= 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-08 04:15:15,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#(and (= main_~v5~0 0) (= 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); {36#(and (= main_~v5~0 0) (= 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-08 04:15:15,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#(and (= main_~v5~0 0) (= 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); {36#(and (= main_~v5~0 0) (= 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-08 04:15:15,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#(and (= main_~v5~0 0) (= 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 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {37#(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) (<= 1 main_~v5~0) (= main_~v3~0 0) (<= main_~v5~0 1))} is VALID [2022-04-08 04:15:15,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#(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) (<= 1 main_~v5~0) (= main_~v3~0 0) (<= main_~v5~0 1))} ~l~0 := 1 + ~l~0; {38#(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_~v5~0 main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296)))) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 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_~v5~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_~v5~0 main_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:15:15,640 INFO L272 TraceCheckUtils]: 10: Hoare triple {38#(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_~v5~0 main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296)))) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 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_~v5~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_~v5~0 main_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {39#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:15:15,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {40#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:15:15,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32#false} is VALID [2022-04-08 04:15:15,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-08 04:15:15,644 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-08 04:15:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:15:15,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116942478] [2022-04-08 04:15:15,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116942478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:15:15,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:15:15,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:15:15,648 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:15:15,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2759942] [2022-04-08 04:15:15,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2759942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:15:15,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:15:15,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:15:15,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769972662] [2022-04-08 04:15:15,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:15:15,657 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-08 04:15:15,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:15:15,662 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-08 04:15:15,684 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-08 04:15:15,685 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 04:15:15,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:15:15,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 04:15:15,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 04:15:15,719 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 22 states have internal predecessors, (32), 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-08 04:15:18,574 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-08 04:15:22,986 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-08 04:15:27,322 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-08 04:15:33,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:15:38,324 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:15:40,332 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-08 04:15:42,539 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:15:47,018 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-08 04:15:49,182 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-08 04:15:53,506 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-08 04:15:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:15:53,780 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2022-04-08 04:15:53,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 04:15:53,781 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-08 04:15:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:15:53,782 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-08 04:15:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 04:15:53,803 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-08 04:15:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 04:15:53,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-08 04:15:53,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:15:53,944 INFO L225 Difference]: With dead ends: 66 [2022-04-08 04:15:53,944 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 04:15:53,948 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-08 04:15:53,955 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 57 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 14 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:15:53,956 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 55 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 123 Invalid, 9 Unknown, 0 Unchecked, 21.2s Time] [2022-04-08 04:15:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 04:15:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-08 04:15:54,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:15:54,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 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-08 04:15:54,012 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 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-08 04:15:54,012 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 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-08 04:15:54,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:15:54,016 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 04:15:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 04:15:54,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:15:54,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:15:54,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 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 34 states. [2022-04-08 04:15:54,017 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 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 34 states. [2022-04-08 04:15:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:15:54,025 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 04:15:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 04:15:54,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:15:54,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:15:54,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:15:54,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:15:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 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-08 04:15:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-04-08 04:15:54,033 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 14 [2022-04-08 04:15:54,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:15:54,034 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-04-08 04:15:54,034 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-08 04:15:54,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 38 transitions. [2022-04-08 04:15:54,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:15:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-08 04:15:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 04:15:54,096 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:15:54,096 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:15:54,096 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:15:54,097 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:15:54,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:15:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1294727378, now seen corresponding path program 1 times [2022-04-08 04:15:54,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:15:54,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1860197542] [2022-04-08 04:15:59,719 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 04:15:59,721 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:15:59,729 INFO L85 PathProgramCache]: Analyzing trace with hash 508503026, now seen corresponding path program 1 times [2022-04-08 04:15:59,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:15:59,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767139231] [2022-04-08 04:15:59,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:15:59,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:15:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:00,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:16:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:00,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {330#(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; {318#true} is VALID [2022-04-08 04:16:00,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-08 04:16:00,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {318#true} {318#true} #86#return; {318#true} is VALID [2022-04-08 04:16:00,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {330#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:16:00,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {330#(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; {318#true} is VALID [2022-04-08 04:16:00,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-08 04:16:00,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #86#return; {318#true} is VALID [2022-04-08 04:16:00,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret5 := main(); {318#true} is VALID [2022-04-08 04:16:00,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {318#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;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {323#(and (= main_~v5~0 0) (= 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-08 04:16:00,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {323#(and (= main_~v5~0 0) (= 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); {323#(and (= main_~v5~0 0) (= 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-08 04:16:00,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {323#(and (= main_~v5~0 0) (= 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))} [90] L40-1-->L23_primed: Formula: (let ((.cse2 (= (mod (+ v_main_~v1~0_8 v_main_~v2~0_8 v_main_~v3~0_8 v_main_~v4~0_8 v_main_~v5~0_9 v_main_~i~0_8 v_main_~j~0_8 v_main_~k~0_8 1) 4294967296) (mod (+ v_main_~l~0_25 1) 4294967296))) (.cse4 (= (mod v_main_~l~0_25 8) 0)) (.cse3 (< (mod v_main_~l~0_25 4294967296) (mod v_main_~n~0_7 4294967296))) (.cse0 (= v_main_~v5~0_9 v_main_~v5~0_8)) (.cse1 (= v_main_~l~0_25 v_main_~l~0_24))) (or (and (= v_main_~v1~0_8 v_main_~v1~0_8) .cse0 (= v_main_~v4~0_8 v_main_~v4~0_8) (= v_main_~i~0_8 v_main_~i~0_8) (= v_main_~j~0_8 v_main_~j~0_8) .cse1 (= v_main_~v3~0_8 v_main_~v3~0_8) (= v_main_~n~0_7 v_main_~n~0_7) (= v_main_~v2~0_8 v_main_~v2~0_8) (= v_main_~k~0_8 v_main_~k~0_8)) (and (< v_main_~l~0_25 v_main_~l~0_24) .cse2 (< v_main_~l~0_24 (+ v_main_~l~0_25 2)) .cse3 .cse4 (= (+ v_main_~l~0_25 v_main_~v5~0_8) (+ v_main_~l~0_24 v_main_~v5~0_9))) (and (or (not .cse2) (not .cse4) (not .cse3)) .cse0 .cse1))) InVars {main_~l~0=v_main_~l~0_25, main_~v1~0=v_main_~v1~0_8, main_~v2~0=v_main_~v2~0_8, main_~k~0=v_main_~k~0_8, main_~v4~0=v_main_~v4~0_8, main_~j~0=v_main_~j~0_8, main_~v5~0=v_main_~v5~0_9, main_~i~0=v_main_~i~0_8, main_~v3~0=v_main_~v3~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_24, main_~v1~0=v_main_~v1~0_8, main_~v2~0=v_main_~v2~0_8, main_~k~0=v_main_~k~0_8, main_~v4~0=v_main_~v4~0_8, main_~j~0=v_main_~j~0_8, main_~v5~0=v_main_~v5~0_8, main_~i~0=v_main_~i~0_8, main_~v3~0=v_main_~v3~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~l~0, main_~v5~0] {324#(or (and (or (= main_~v5~0 0) (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))) (= 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 (<= (div main_~l~0 8) 0) (<= 1 main_~l~0)))} is VALID [2022-04-08 04:16:00,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {324#(or (and (or (= main_~v5~0 0) (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))) (= 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 (<= (div main_~l~0 8) 0) (<= 1 main_~l~0)))} [89] 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[] {325#(or (and (= main_~v5~0 0) (= 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 (<= (div main_~l~0 8) 0) (<= 1 main_~l~0)))} is VALID [2022-04-08 04:16:00,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {325#(or (and (= main_~v5~0 0) (= 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 (<= (div main_~l~0 8) 0) (<= 1 main_~l~0)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {326#(and (<= (+ main_~l~0 1) main_~v5~0) (= 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) (<= main_~v5~0 1))} is VALID [2022-04-08 04:16:00,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {326#(and (<= (+ main_~l~0 1) main_~v5~0) (= 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) (<= main_~v5~0 1))} ~l~0 := 1 + ~l~0; {327#(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_~v5~0 main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296)))) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 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_~v5~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_~v5~0 main_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:16:00,472 INFO L272 TraceCheckUtils]: 11: Hoare triple {327#(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_~v5~0 main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296)))) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 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_~v5~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_~v5~0 main_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {328#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:16:00,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {329#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:16:00,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {329#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {319#false} is VALID [2022-04-08 04:16:00,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {319#false} assume !false; {319#false} is VALID [2022-04-08 04:16:00,473 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-08 04:16:00,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:16:00,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767139231] [2022-04-08 04:16:00,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767139231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:00,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:00,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 04:16:01,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:16:01,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1860197542] [2022-04-08 04:16:01,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1860197542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:01,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:01,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 04:16:01,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078416225] [2022-04-08 04:16:01,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:16:01,611 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 3 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-08 04:16:01,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:16:01,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 3 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-08 04:16:01,618 WARN L143 InductivityCheck]: Transition 338#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) ( _ , assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); , 325#(or (and (= main_~v5~0 0) (= 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 (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))) ) not inductive [2022-04-08 04:16:01,618 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:16:01,619 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:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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-08 04:16:01,623 INFO L158 Benchmark]: Toolchain (without parser) took 56242.71ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 139.7MB in the beginning and 201.3MB in the end (delta: -61.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:16:01,624 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory was 156.1MB in the beginning and 155.9MB in the end (delta: 129.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:16:01,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.87ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 139.6MB in the beginning and 207.1MB in the end (delta: -67.5MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-08 04:16:01,625 INFO L158 Benchmark]: Boogie Preprocessor took 29.14ms. Allocated memory is still 230.7MB. Free memory was 207.1MB in the beginning and 205.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 04:16:01,625 INFO L158 Benchmark]: RCFGBuilder took 8992.80ms. Allocated memory is still 230.7MB. Free memory was 205.0MB in the beginning and 192.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 04:16:01,625 INFO L158 Benchmark]: TraceAbstraction took 46987.01ms. Allocated memory is still 230.7MB. Free memory was 191.9MB in the beginning and 201.3MB in the end (delta: -9.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:16:01,631 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.12ms. Allocated memory is still 191.9MB. Free memory was 156.1MB in the beginning and 155.9MB in the end (delta: 129.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.87ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 139.6MB in the beginning and 207.1MB in the end (delta: -67.5MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.14ms. Allocated memory is still 230.7MB. Free memory was 207.1MB in the beginning and 205.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 8992.80ms. Allocated memory is still 230.7MB. Free memory was 205.0MB in the beginning and 192.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 46987.01ms. Allocated memory is still 230.7MB. Free memory was 191.9MB in the beginning and 201.3MB in the end (delta: -9.4MB). There was no memory consumed. 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-08 04:16:01,663 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...