/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/sumt7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:14:47,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:14:47,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:14:47,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:14:47,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:14:47,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:14:47,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:14:47,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:14:47,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:14:47,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:14:47,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:14:47,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:14:47,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:14:47,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:14:47,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:14:47,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:14:47,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:14:47,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:14:47,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:14:47,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:14:47,546 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:14:47,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:14:47,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:14:47,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:14:47,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:14:47,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:14:47,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:14:47,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:14:47,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:14:47,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:14:47,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:14:47,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:14:47,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:14:47,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:14:47,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:14:47,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:14:47,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:14:47,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:14:47,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:14:47,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:14:47,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:14:47,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:14:47,565 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:14:47,575 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:14:47,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:14:47,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:14:47,577 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:14:47,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:14:47,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:14:47,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:14:47,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:14:47,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:14:47,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:14:47,578 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:14:47,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:14:47,579 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:14:47,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:14:47,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:14:47,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:14:47,579 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:14:47,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:14:47,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:14:47,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:14:47,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:14:47,580 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:14:47,580 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:14:47,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:14:47,580 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:14:47,580 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:14:47,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:14:47,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:14:47,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:14:47,779 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:14:47,783 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:14:47,784 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-08 04:14:47,855 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e2a095e0/fd15540ed1664a8e97f1ead2525de062/FLAGce50399e8 [2022-04-08 04:14:48,162 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:14:48,162 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt7.c [2022-04-08 04:14:48,170 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e2a095e0/fd15540ed1664a8e97f1ead2525de062/FLAGce50399e8 [2022-04-08 04:14:48,600 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e2a095e0/fd15540ed1664a8e97f1ead2525de062 [2022-04-08 04:14:48,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:14:48,604 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:14:48,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:14:48,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:14:48,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:14:48,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:14:48" (1/1) ... [2022-04-08 04:14:48,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b04a972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:14:48, skipping insertion in model container [2022-04-08 04:14:48,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:14:48" (1/1) ... [2022-04-08 04:14:48,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:14:48,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:14:48,767 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-08 04:14:48,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:14:48,791 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:14:48,802 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-08 04:14:48,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:14:48,822 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:14:48,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:14:48 WrapperNode [2022-04-08 04:14:48,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:14:48,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:14:48,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:14:48,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:14:48,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:14:48" (1/1) ... [2022-04-08 04:14:48,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:14:48" (1/1) ... [2022-04-08 04:14:48,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:14:48" (1/1) ... [2022-04-08 04:14:48,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:14:48" (1/1) ... [2022-04-08 04:14:48,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:14:48" (1/1) ... [2022-04-08 04:14:48,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:14:48" (1/1) ... [2022-04-08 04:14:48,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:14:48" (1/1) ... [2022-04-08 04:14:48,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:14:48,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:14:48,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:14:48,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:14:48,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:14:48" (1/1) ... [2022-04-08 04:14:48,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:14:48,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:14:48,908 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:14:48,909 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:14:48,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:14:48,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:14:48,940 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:14:48,940 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:14:48,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:14:48,940 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:14:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:14:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:14:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:14:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:14:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:14:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:14:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 04:14:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:14:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:14:48,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:14:48,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:14:48,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:14:48,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:14:48,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:14:48,989 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:14:48,990 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:14:57,824 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:14:57,830 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:14:57,830 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:14:57,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:14:57 BoogieIcfgContainer [2022-04-08 04:14:57,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:14:57,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:14:57,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:14:57,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:14:57,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:14:48" (1/3) ... [2022-04-08 04:14:57,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b9186f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:14:57, skipping insertion in model container [2022-04-08 04:14:57,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:14:48" (2/3) ... [2022-04-08 04:14:57,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b9186f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:14:57, skipping insertion in model container [2022-04-08 04:14:57,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:14:57" (3/3) ... [2022-04-08 04:14:57,839 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt7.c [2022-04-08 04:14:57,843 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:14:57,843 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:14:57,879 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:14:57,884 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:14:57,884 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:14:57,898 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-08 04:14:57,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 04:14:57,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:14:57,904 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:14:57,905 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:14:57,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:14:57,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1555439542, now seen corresponding path program 1 times [2022-04-08 04:14:57,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:14:57,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [933367204] [2022-04-08 04:14:57,927 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:14:57,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1555439542, now seen corresponding path program 2 times [2022-04-08 04:14:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:14:57,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141936388] [2022-04-08 04:14:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:14:57,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:14:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:14:58,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:14:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:14:58,698 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-08 04:14:58,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-08 04:14:58,699 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #81#return; {30#true} is VALID [2022-04-08 04:14:58,701 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-08 04:14:58,701 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-08 04:14:58,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-08 04:14:58,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #81#return; {30#true} is VALID [2022-04-08 04:14:58,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID [2022-04-08 04:14:58,703 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-08 04:14:58,703 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-08 04:14:58,704 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-08 04:14:58,705 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-08 04:14:58,707 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-08 04:14:58,710 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-08 04:14:58,711 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-08 04:14:58,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {31#false} is VALID [2022-04-08 04:14:58,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-04-08 04:14:58,712 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:14:58,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:14:58,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141936388] [2022-04-08 04:14:58,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141936388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:14:58,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:14:58,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:14:58,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:14:58,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [933367204] [2022-04-08 04:14:58,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [933367204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:14:58,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:14:58,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:14:58,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576157361] [2022-04-08 04:14:58,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:14:58,722 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:14:58,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:14:58,725 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:14:58,746 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:14:58,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 04:14:58,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:14:58,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 04:14:58,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 04:14:58,772 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-08 04:15:01,080 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:07,689 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:12,024 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:14,271 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:18,551 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:20,726 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:22,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:15:25,099 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-08 04:15:29,535 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:31,704 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:33,869 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:36,036 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-08 04:15:38,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:15:38,619 INFO L93 Difference]: Finished difference Result 63 states and 89 transitions. [2022-04-08 04:15:38,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 04:15:38,620 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:38,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:15:38,621 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:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-04-08 04:15:38,630 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:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-04-08 04:15:38,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 89 transitions. [2022-04-08 04:15:38,748 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-08 04:15:38,756 INFO L225 Difference]: With dead ends: 63 [2022-04-08 04:15:38,756 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 04:15:38,758 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-08 04:15:38,761 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 53 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 12 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.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, 109 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:15:38,761 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 55 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 109 Invalid, 12 Unknown, 0 Unchecked, 25.0s Time] [2022-04-08 04:15:38,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 04:15:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-04-08 04:15:38,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:15:38,798 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-08 04:15:38,798 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-08 04:15:38,799 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-08 04:15:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:15:38,802 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-08 04:15:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-08 04:15:38,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:15:38,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:15:38,804 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-08 04:15:38,804 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-08 04:15:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:15:38,807 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-08 04:15:38,808 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-08 04:15:38,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:15:38,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:15:38,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:15:38,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:15:38,809 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-08 04:15:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-04-08 04:15:38,812 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2022-04-08 04:15:38,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:15:38,813 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-04-08 04:15:38,813 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:38,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 37 transitions. [2022-04-08 04:15:38,868 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-08 04:15:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-08 04:15:38,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 04:15:38,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:15:38,869 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:15:38,869 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:15:38,870 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:15:38,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:15:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2040977129, now seen corresponding path program 1 times [2022-04-08 04:15:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:15:38,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [201050493] [2022-04-08 04:15:38,872 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:15:38,872 INFO L85 PathProgramCache]: Analyzing trace with hash 2040977129, now seen corresponding path program 2 times [2022-04-08 04:15:38,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:15:38,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155155507] [2022-04-08 04:15:38,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:15:38,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:15:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:15:39,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:15:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:15:39,175 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-08 04:15:39,176 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-08 04:15:39,177 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-08 04:15:39,177 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-08 04:15:39,178 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-08 04:15:39,179 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-08 04:15:39,181 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-08 04:15:39,181 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-08 04:15:39,184 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-08 04:15:39,184 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-08 04:15:39,185 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-08 04:15:39,185 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-08 04:15:39,186 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-08 04:15:39,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {306#false} ~l~0 := 1 + ~l~0; {306#false} is VALID [2022-04-08 04:15:39,186 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-08 04:15:39,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {306#false} ~cond := #in~cond; {306#false} is VALID [2022-04-08 04:15:39,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {306#false} assume 0 == ~cond; {306#false} is VALID [2022-04-08 04:15:39,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {306#false} assume !false; {306#false} is VALID [2022-04-08 04:15:39,187 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:39,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:15:39,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155155507] [2022-04-08 04:15:39,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155155507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:15:39,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:15:39,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:15:39,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:15:39,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [201050493] [2022-04-08 04:15:39,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [201050493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:15:39,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:15:39,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:15:39,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589677548] [2022-04-08 04:15:39,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:15:39,194 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-08 04:15:39,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:15:39,195 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-08 04:15:41,395 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-08 04:15:41,395 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 04:15:41,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:15:41,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 04:15:41,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 04:15:41,396 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-08 04:15:45,808 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:56,763 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:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:15:56,981 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-08 04:15:56,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 04:15:56,982 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-08 04:15:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:15:56,982 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-08 04:15:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-08 04:15:56,985 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-08 04:15:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-08 04:15:56,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-08 04:15:59,213 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-08 04:15:59,215 INFO L225 Difference]: With dead ends: 45 [2022-04-08 04:15:59,215 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 04:15:59,215 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-08 04:15:59,219 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.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, 26 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:15:59,220 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 30 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 26 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2022-04-08 04:15:59,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 04:15:59,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 04:15:59,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:15:59,276 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-08 04:15:59,277 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-08 04:15:59,277 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-08 04:15:59,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:15:59,279 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 04:15:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 04:15:59,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:15:59,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:15:59,283 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-08 04:15:59,284 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-08 04:15:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:15:59,287 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 04:15:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 04:15:59,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:15:59,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:15:59,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:15:59,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:15:59,291 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-08 04:15:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-08 04:15:59,294 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 15 [2022-04-08 04:15:59,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:15:59,294 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-08 04:15:59,294 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-08 04:15:59,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-08 04:15:59,355 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-08 04:15:59,355 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 04:15:59,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 04:15:59,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:15:59,356 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:59,356 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:15:59,357 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:15:59,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:15:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1572266990, now seen corresponding path program 1 times [2022-04-08 04:15:59,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:15:59,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [151088941] [2022-04-08 04:18:06,860 WARN L232 SmtUtils]: Spent 1.77m on a formula simplification. DAG size of input: 154 DAG size of output: 151 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-08 04:18:11,158 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:18:15,282 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:18:17,447 WARN L1034 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains relation itself. [2022-04-08 04:18:21,888 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-08 04:20:54,209 WARN L232 SmtUtils]: Spent 2.20m on a formula simplification. DAG size of input: 154 DAG size of output: 151 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-08 04:20:54,250 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:20:54,268 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:20:54,281 INFO L85 PathProgramCache]: Analyzing trace with hash 738488328, now seen corresponding path program 1 times [2022-04-08 04:20:54,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:20:54,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639912507] [2022-04-08 04:20:54,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:20:54,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:20:54,307 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~l~0_5 (* 4294967295 main_~v4~0_5) (* 4294967295 main_~v2~0_5) (* 4294967295 main_~v1~0_5) (* 4294967295 main_~j~0_5) (* 4294967295 main_~k~0_5) (* 4294967295 main_~v3~0_5) (* 4294967295 main_~i~0_5) (* (- 4294967296) .aux_div_aux_mod_v_it_1_131_261.1) (* (- 1) .aux_mod_aux_mod_v_it_1_131_261.0)) 0)) [2022-04-08 04:20:54,308 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_aux_mod_v_it_1_131_261.1) .aux_mod_aux_mod_v_it_1_131_261.0 (* 4294967296 .aux_div_v_it_1_131.2) (* (- 4294967296) main_~v3~0_5) (* (- 1) main_~l~0_5) (* (- 4294967296) main_~i~0_5) (* (- 1) main_~v1~0_7) (* (- 4294967295) main_~v1~0_5) (* (- 4294967296) main_~k~0_5) (* (- 4294967296) main_~v4~0_5) (* (- 4294967296) main_~v2~0_5) (* (- 4294967296) main_~j~0_5)) 0)) [2022-04-08 04:20:54,308 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 main_~v3~0_5) main_~l~0_5 (* 4294967296 main_~i~0_5) (* 4294967296 main_~v1~0_5) (* 4294967296 main_~k~0_5) (* 4294967296 main_~v4~0_5) (* 4294967296 main_~v2~0_5) (* 4294967296 main_~j~0_5) (* (- 4294967296) .aux_div_aux_mod_v_it_1_131_261.1) (* (- 1) .aux_mod_aux_mod_v_it_1_131_261.0) (* (- 4294967296) .aux_div_v_it_1_131.2) 2) 0)) [2022-04-08 04:20:54,308 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~l~0_5) (* (- 4294967295) main_~v4~0_5) (* (- 4294967295) main_~v2~0_5) (* (- 4294967295) main_~v1~0_5) (* (- 4294967295) main_~j~0_5) (* (- 4294967295) main_~k~0_5) (* (- 4294967295) main_~v3~0_5) (* (- 4294967295) main_~i~0_5) (* 4294967296 .aux_div_aux_mod_v_it_1_131_261.1) .aux_mod_aux_mod_v_it_1_131_261.0 (- 4294967295)) 0)) [2022-04-08 04:20:54,308 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (= (* 4294967296 .aux_div_aux_mod_v_it_1_131_261.1) (+ main_~l~0_5 (* 4294967295 main_~v4~0_5) (* 4294967295 main_~v2~0_5) (* 4294967295 main_~v1~0_5) (* 4294967295 main_~j~0_5) (* 4294967295 main_~k~0_5) (* 4294967295 main_~v3~0_5) (* 4294967295 main_~i~0_5))) [2022-04-08 04:20:54,311 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) 4294967296) 0) [2022-04-08 04:20:54,311 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ main_~v1~0_5 (* (- 1) main_~v1~0_7) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.3)) (- 7)) 0) [2022-04-08 04:20:54,312 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) (- 4294967295)) (- 7)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) (- 4294967296)) 7)) (- 1)) 0) [2022-04-08 04:20:54,312 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ main_~v1~0_5 (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) (* (- 1) main_~v1~0_7) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.3) 1) (- 7)) 0) [2022-04-08 04:20:54,312 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~v1~0_5 (* (- 1) main_~v1~0_7) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.3)) (- 7)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.3) (- 6)) 7)) (- 1)) 0) [2022-04-08 04:20:54,312 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~v1~0_5 (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) (* (- 1) main_~v1~0_7) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.3) 1) (- 7)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.3) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) (- 4294967295)) 7)) (- 1)) 0) [2022-04-08 04:20:54,312 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~v1~0_5 (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) (* (- 1) main_~v1~0_7) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.3) 1) (- 7)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) (- 4294967296)) 7)) (- 1)) 0) [2022-04-08 04:20:54,312 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.3) (- 6)) 7)) 613566756) 0) [2022-04-08 04:20:54,313 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) (- 4294967295)) (- 7)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.3) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) (- 4294967295)) 7)) (- 1)) 0) [2022-04-08 04:20:54,313 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.3) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) (- 4294967295)) 7)) 613566756) 0) [2022-04-08 04:20:54,313 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~v1~0_5 (* (- 1) main_~v1~0_7) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.3)) (- 7)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) (- 4294967296)) 7)) (- 1)) 0) [2022-04-08 04:20:54,313 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~v1~0_5 (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) (* (- 1) main_~v1~0_7) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.3) 1) (- 7)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.3) (- 6)) 7)) (- 1)) 0) [2022-04-08 04:20:54,313 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) (- 4294967296)) 7)) 613566756) 0) [2022-04-08 04:20:54,313 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) (- 4294967295)) (- 7)) 0) [2022-04-08 04:20:54,314 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) 6) 0) [2022-04-08 04:20:54,314 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~v1~0_5 (* 4294967296 .aux_div_v_it_1_42.3) (* (- 1) main_~l~0_5) (* (- 1) main_~v1~0_7) 1) 0)) [2022-04-08 04:20:54,314 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_1_42.3) (* (- 1) main_~l~0_5) 4294967295) 0) [2022-04-08 04:20:54,314 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~v1~0_5 (* (- 1) main_~v1~0_7) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.3)) (- 7)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.3) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) (- 4294967295)) 7)) (- 1)) 0) [2022-04-08 04:20:54,314 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.4) (- 4294967295)) (- 7)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.3) (- 6)) 7)) (- 1)) 0) [2022-04-08 04:20:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:20:54,351 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~l~0_5 (* 4294967295 main_~v4~0_5) (* 4294967295 main_~v2~0_5) (* 4294967295 main_~v1~0_5) (* 4294967295 main_~j~0_5) (* 4294967295 main_~k~0_5) (* 4294967295 main_~v3~0_5) (* 4294967295 main_~i~0_5) (* (- 4294967296) .aux_div_aux_mod_v_it_1_131_261.6) (* (- 1) .aux_mod_aux_mod_v_it_1_131_261.5)) 0)) [2022-04-08 04:20:54,352 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_aux_mod_v_it_1_131_261.6) .aux_mod_aux_mod_v_it_1_131_261.5 (* 4294967296 .aux_div_v_it_1_131.7) (* (- 4294967296) main_~v3~0_5) (* (- 1) main_~l~0_5) (* (- 4294967296) main_~i~0_5) (* (- 1) main_~v1~0_7) (* (- 4294967295) main_~v1~0_5) (* (- 4294967296) main_~k~0_5) (* (- 4294967296) main_~v4~0_5) (* (- 4294967296) main_~v2~0_5) (* (- 4294967296) main_~j~0_5)) 0)) [2022-04-08 04:20:54,352 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 main_~v3~0_5) main_~l~0_5 (* 4294967296 main_~i~0_5) (* 4294967296 main_~v1~0_5) (* 4294967296 main_~k~0_5) (* 4294967296 main_~v4~0_5) (* 4294967296 main_~v2~0_5) (* 4294967296 main_~j~0_5) (* (- 4294967296) .aux_div_aux_mod_v_it_1_131_261.6) (* (- 1) .aux_mod_aux_mod_v_it_1_131_261.5) (* (- 4294967296) .aux_div_v_it_1_131.7) 2) 0)) [2022-04-08 04:20:54,352 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~l~0_5) (* (- 4294967295) main_~v4~0_5) (* (- 4294967295) main_~v2~0_5) (* (- 4294967295) main_~v1~0_5) (* (- 4294967295) main_~j~0_5) (* (- 4294967295) main_~k~0_5) (* (- 4294967295) main_~v3~0_5) (* (- 4294967295) main_~i~0_5) (* 4294967296 .aux_div_aux_mod_v_it_1_131_261.6) .aux_mod_aux_mod_v_it_1_131_261.5 (- 4294967295)) 0)) [2022-04-08 04:20:54,352 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (= (* 4294967296 .aux_div_aux_mod_v_it_1_131_261.6) (+ main_~l~0_5 (* 4294967295 main_~v4~0_5) (* 4294967295 main_~v2~0_5) (* 4294967295 main_~v1~0_5) (* 4294967295 main_~j~0_5) (* 4294967295 main_~k~0_5) (* 4294967295 main_~v3~0_5) (* 4294967295 main_~i~0_5))) [2022-04-08 04:20:54,353 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) 4294967296) 0) [2022-04-08 04:20:54,353 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ main_~v1~0_5 (* (- 1) main_~v1~0_7) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.8)) (- 7)) 0) [2022-04-08 04:20:54,354 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) (- 4294967295)) (- 7)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) (- 4294967296)) 7)) (- 1)) 0) [2022-04-08 04:20:54,354 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ main_~v1~0_5 (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) (* (- 1) main_~v1~0_7) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.8) 1) (- 7)) 0) [2022-04-08 04:20:54,354 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~v1~0_5 (* (- 1) main_~v1~0_7) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.8)) (- 7)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.8) (- 6)) 7)) (- 1)) 0) [2022-04-08 04:20:54,354 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~v1~0_5 (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) (* (- 1) main_~v1~0_7) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.8) 1) (- 7)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.8) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) (- 4294967295)) 7)) (- 1)) 0) [2022-04-08 04:20:54,354 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~v1~0_5 (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) (* (- 1) main_~v1~0_7) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.8) 1) (- 7)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) (- 4294967296)) 7)) (- 1)) 0) [2022-04-08 04:20:54,354 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.8) (- 6)) 7)) 613566756) 0) [2022-04-08 04:20:54,355 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) (- 4294967295)) (- 7)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.8) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) (- 4294967295)) 7)) (- 1)) 0) [2022-04-08 04:20:54,355 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.8) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) (- 4294967295)) 7)) 613566756) 0) [2022-04-08 04:20:54,355 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~v1~0_5 (* (- 1) main_~v1~0_7) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.8)) (- 7)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) (- 4294967296)) 7)) (- 1)) 0) [2022-04-08 04:20:54,355 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~v1~0_5 (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) (* (- 1) main_~v1~0_7) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.8) 1) (- 7)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.8) (- 6)) 7)) (- 1)) 0) [2022-04-08 04:20:54,355 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) (- 4294967296)) 7)) 613566756) 0) [2022-04-08 04:20:54,355 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) (- 4294967295)) (- 7)) 0) [2022-04-08 04:20:54,356 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) 6) 0) [2022-04-08 04:20:54,356 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~v1~0_5 (* 4294967296 .aux_div_v_it_1_42.8) (* (- 1) main_~l~0_5) (* (- 1) main_~v1~0_7) 1) 0)) [2022-04-08 04:20:54,356 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_1_42.8) (* (- 1) main_~l~0_5) 4294967295) 0) [2022-04-08 04:20:54,356 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~v1~0_5 (* (- 1) main_~v1~0_7) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.8)) (- 7)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.8) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) (- 4294967295)) 7)) (- 1)) 0) [2022-04-08 04:20:54,356 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.9) (- 4294967295)) (- 7)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.8) (- 6)) 7)) (- 1)) 0) [2022-04-08 04:20:54,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:20:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:20:54,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {542#(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; {531#true} is VALID [2022-04-08 04:20:54,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {531#true} assume true; {531#true} is VALID [2022-04-08 04:20:54,725 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {531#true} {531#true} #81#return; {531#true} is VALID [2022-04-08 04:20:54,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {531#true} call ULTIMATE.init(); {542#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:20:54,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#(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; {531#true} is VALID [2022-04-08 04:20:54,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {531#true} assume true; {531#true} is VALID [2022-04-08 04:20:54,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {531#true} {531#true} #81#return; {531#true} is VALID [2022-04-08 04:20:54,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {531#true} call #t~ret5 := main(); {531#true} is VALID [2022-04-08 04:20:54,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {531#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; {536#(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-08 04:20:54,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {536#(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); {536#(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-08 04:20:54,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {536#(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))} [85] L38-1-->L23_primed: Formula: (let ((.cse5 (mod v_main_~n~0_7 4294967296)) (.cse39 (mod v_main_~l~0_23 4294967296))) (let ((.cse0 (= v_main_~v1~0_9 v_main_~v1~0_8)) (.cse1 (= v_main_~l~0_23 v_main_~l~0_22)) (.cse3 (= (mod (+ v_main_~l~0_23 1) 4294967296) (mod (+ v_main_~v1~0_9 v_main_~v2~0_8 v_main_~v3~0_8 v_main_~v4~0_8 v_main_~i~0_8 v_main_~j~0_8 v_main_~k~0_8 1) 4294967296))) (.cse2 (= (mod (mod .cse39 7) 4294967296) 0)) (.cse4 (< .cse39 .cse5))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3) (not .cse4))) (and (= 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) .cse0 .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)) (let ((.cse6 (< v_main_~v1~0_8 (+ v_main_~v1~0_9 2)))) (and (or (<= (div (+ v_main_~v1~0_9 .cse5 (* (- 1) v_main_~v1~0_8) (* v_main_~l~0_23 (- 1))) (- 4294967296)) (+ (div (+ v_main_~l~0_23 (- 4294967295)) 4294967296) 1)) .cse6) .cse3 (or (forall ((aux_div_v_it_1_42 Int) (aux_div_aux_mod_aux_mod_v_it_1_42_25_45 Int)) (let ((.cse20 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296))) (.cse21 (* aux_div_v_it_1_42 (- 4294967296)))) (let ((.cse14 (div (+ v_main_~l~0_23 .cse21 (- 6)) 7)) (.cse15 (div (+ v_main_~l~0_23 .cse21 .cse20 (- 4294967295)) 7)) (.cse7 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296)) (.cse18 (* (- 1) v_main_~v1~0_8)) (.cse19 (* v_main_~l~0_23 (- 1))) (.cse17 (* aux_div_v_it_1_42 4294967296)) (.cse16 (div (+ .cse20 (- 4294967296)) 7))) (let ((.cse10 (+ .cse16 1)) (.cse11 (div (+ v_main_~v1~0_9 .cse7 .cse18 .cse19 .cse17 1) (- 7))) (.cse8 (div (+ v_main_~v1~0_9 .cse18 .cse19 .cse17) (- 7))) (.cse13 (+ .cse15 1)) (.cse9 (div (+ .cse7 (- 4294967295)) (- 7))) (.cse12 (+ .cse14 1))) (or (<= (+ .cse7 4294967296) 0) (<= .cse8 0) (<= .cse9 .cse10) (<= .cse11 0) (<= .cse8 .cse12) (<= .cse11 .cse13) (<= .cse11 .cse10) (<= 613566756 .cse14) (<= .cse9 .cse13) (<= 613566756 .cse15) (<= .cse8 .cse10) (<= .cse11 .cse12) (<= 613566756 .cse16) (<= .cse9 0) (<= 6 .cse7) (< (+ v_main_~l~0_23 v_main_~v1~0_8) (+ v_main_~v1~0_9 .cse17 1)) (<= (+ 4294967295 .cse17) v_main_~l~0_23) (<= .cse8 .cse13) (<= .cse9 .cse12)))))) .cse6) .cse2 .cse4 (= (+ v_main_~l~0_23 v_main_~v1~0_8) (+ v_main_~l~0_22 v_main_~v1~0_9)) (forall ((aux_mod_aux_mod_v_it_1_131_261 Int) (aux_div_aux_mod_v_it_1_131_261 Int) (aux_div_v_it_1_131 Int)) (let ((.cse32 (* v_main_~v4~0_8 4294967295)) (.cse33 (* v_main_~v2~0_8 4294967295)) (.cse27 (* v_main_~v1~0_9 4294967295)) (.cse34 (* v_main_~j~0_8 4294967295)) (.cse35 (* v_main_~k~0_8 4294967295)) (.cse36 (* v_main_~v3~0_8 4294967295)) (.cse37 (* v_main_~i~0_8 4294967295)) (.cse38 (* aux_div_aux_mod_v_it_1_131_261 4294967296))) (let ((.cse25 (* v_main_~v3~0_8 4294967296)) (.cse26 (* v_main_~i~0_8 4294967296)) (.cse28 (* v_main_~k~0_8 4294967296)) (.cse29 (* v_main_~v4~0_8 4294967296)) (.cse30 (* v_main_~v2~0_8 4294967296)) (.cse31 (* v_main_~j~0_8 4294967296)) (.cse24 (+ .cse38 aux_mod_aux_mod_v_it_1_131_261 (* aux_div_v_it_1_131 4294967296))) (.cse22 (+ .cse38 aux_mod_aux_mod_v_it_1_131_261)) (.cse23 (+ v_main_~l~0_23 .cse32 .cse33 .cse27 .cse34 .cse35 .cse36 .cse37))) (or (< .cse22 .cse23) (not (<= .cse24 (+ .cse25 v_main_~l~0_23 .cse26 v_main_~v1~0_8 .cse27 .cse28 .cse29 .cse30 .cse31))) (not (<= (+ .cse25 v_main_~l~0_23 .cse26 (* v_main_~v1~0_9 4294967296) 2 .cse28 .cse29 .cse30 .cse31) .cse24)) (<= (+ v_main_~l~0_23 .cse32 .cse33 .cse27 4294967296 .cse34 .cse35 .cse36 .cse37) .cse22) (<= 4294967296 aux_mod_aux_mod_v_it_1_131_261) (< aux_mod_aux_mod_v_it_1_131_261 0) (= .cse38 .cse23))))) (< v_main_~v1~0_9 v_main_~v1~0_8)))))) InVars {main_~l~0=v_main_~l~0_23, main_~v1~0=v_main_~v1~0_9, 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_~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_22, 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_~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_~v1~0] {537#(and (<= main_~v1~0 main_~l~0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (<= main_~l~0 main_~v1~0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:20:54,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {537#(and (<= main_~v1~0 main_~l~0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (<= main_~l~0 main_~v1~0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~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[] {537#(and (<= main_~v1~0 main_~l~0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (<= main_~l~0 main_~v1~0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:20:54,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {537#(and (<= main_~v1~0 main_~l~0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (<= main_~l~0 main_~v1~0) (= main_~i~0 0) (= main_~v4~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; {538#(and (<= main_~v1~0 (+ main_~l~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~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-08 04:20:54,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {538#(and (<= main_~v1~0 (+ main_~l~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~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; {539#(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-08 04:20:54,743 INFO L272 TraceCheckUtils]: 11: Hoare triple {539#(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)); {540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:20:54,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {540#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {541#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:20:54,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {541#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {532#false} is VALID [2022-04-08 04:20:54,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {532#false} assume !false; {532#false} is VALID [2022-04-08 04:20:54,748 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:20:54,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:20:54,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639912507] [2022-04-08 04:20:54,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639912507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:20:54,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:20:54,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 04:22:00,433 WARN L232 SmtUtils]: Spent 53.15s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 04:22:02,804 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 4294967295 c_main_~l~0) 4294967296))) (and (= c_main_~i~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (= (mod (mod .cse0 7) 4294967296) 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~v3~0 0) (= c_main_~j~0 0) (let ((.cse1 (+ (- 1) c_main_~v1~0)) (.cse2 (+ (- 1) c_main_~l~0))) (or (and (< 1 c_main_~v1~0) (= .cse1 .cse2) (forall ((aux_div_v_it_1_42 Int) (aux_div_aux_mod_aux_mod_v_it_1_42_25_45 Int)) (let ((.cse16 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296))) (.cse15 (* aux_div_v_it_1_42 (- 4294967296)))) (let ((.cse11 (div (+ .cse15 (- 6)) 7)) (.cse13 (div (+ .cse16 (- 4294967296)) 7)) (.cse4 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296)) (.cse14 (* (- 1) c_main_~v1~0)) (.cse12 (* aux_div_v_it_1_42 4294967296)) (.cse6 (div (+ .cse15 .cse16 (- 4294967295)) 7))) (let ((.cse8 (+ .cse6 1)) (.cse5 (div (+ 2 .cse4 .cse14 .cse12) (- 7))) (.cse7 (+ .cse13 1)) (.cse9 (div (+ .cse4 (- 4294967295)) (- 7))) (.cse3 (div (+ .cse14 .cse12 1) (- 7))) (.cse10 (+ .cse11 1))) (or (<= .cse3 0) (<= (+ .cse4 4294967296) 0) (<= .cse5 0) (<= 613566756 .cse6) (<= .cse3 .cse7) (<= .cse5 .cse8) (<= .cse9 .cse7) (<= .cse5 .cse10) (<= .cse9 .cse8) (<= 613566756 .cse11) (<= .cse3 .cse8) (< c_main_~v1~0 (+ 2 .cse12)) (<= (+ 4294967295 .cse12) 0) (<= 613566756 .cse13) (<= .cse9 0) (<= 6 .cse4) (<= .cse5 .cse7) (<= .cse9 .cse10) (<= .cse3 .cse10))))))) (and (= .cse1 0) (= .cse2 0)))) (= c_main_~k~0 0))) is different from false [2022-04-08 04:23:03,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:23:03,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [151088941] [2022-04-08 04:23:03,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [151088941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:23:03,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:23:03,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 04:23:03,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187073772] [2022-04-08 04:23:03,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:23:03,836 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:23:03,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:23:03,837 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:23:05,883 WARN L143 InductivityCheck]: Transition 550#(exists ((aux_div_v_main_~l~0_29_46 Int) (aux_div_aux_mod_aux_mod_v_main_~l~0_29_46_42_44 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_29_46_42_44_64 Int) (aux_div_aux_mod_v_main_~l~0_29_46_42 Int) (aux_mod_v_main_~n~0_BEFORE_RETURN_1_44 Int) (v_main_~v1~0_15 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_2 Int)) (and (<= 0 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_29_46_42_44_64 4294967296)) (< (+ (* aux_div_aux_mod_v_main_~l~0_29_46_42 4294967296) (* 7 aux_div_aux_mod_aux_mod_v_main_~l~0_29_46_42_44) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_29_46_42_44_64 4294967296)) aux_mod_v_main_~n~0_BEFORE_RETURN_1_44) (< aux_mod_v_main_~n~0_BEFORE_RETURN_1_44 4294967296) (< (+ (* aux_div_aux_mod_v_main_~l~0_29_46_42 4294967296) (* 7 aux_div_aux_mod_aux_mod_v_main_~l~0_29_46_42_44) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_29_46_42_44_64 4294967296)) 4294967296) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_29_46_42_44_64 4294967296) 7) (or (and (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1) (= (mod v_main_~v1~0_15 4294967296) (mod (+ (* 7 aux_div_aux_mod_aux_mod_v_main_~l~0_29_46_42_44) 1) 4294967296))) (and (not (= (mod v_main_~v1~0_15 4294967296) (mod (+ (* 7 aux_div_aux_mod_aux_mod_v_main_~l~0_29_46_42_44) 1) 4294967296))) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0))) (<= 0 (+ (* 7 aux_div_aux_mod_aux_mod_v_main_~l~0_29_46_42_44) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_29_46_42_44_64 4294967296))) (or (and (not (= (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))) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0)) (and (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1) (= (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)))) (<= 0 (+ (* aux_div_aux_mod_v_main_~l~0_29_46_42 4294967296) (* 7 aux_div_aux_mod_aux_mod_v_main_~l~0_29_46_42_44) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_29_46_42_44_64 4294967296))) (or (and (< 1 v_main_~v1~0_15) (= (+ (* aux_div_aux_mod_v_main_~l~0_29_46_42 4294967296) (* 7 aux_div_aux_mod_aux_mod_v_main_~l~0_29_46_42_44) (* aux_div_v_main_~l~0_29_46 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_29_46_42_44_64 4294967296)) (+ v_main_~v1~0_15 4294967295)) (forall ((aux_div_v_it_1_42 Int) (aux_div_aux_mod_aux_mod_v_it_1_42_25_45 Int)) (or (<= (+ (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296) 4294967296) 0) (<= (div (+ (* (- 1) v_main_~v1~0_15) (* aux_div_v_it_1_42 4294967296) 1) (- 7)) (+ (div (+ (* aux_div_v_it_1_42 (- 4294967296)) (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296)) (- 4294967295)) 7) 1)) (<= (div (+ (* (- 1) v_main_~v1~0_15) (* aux_div_v_it_1_42 4294967296) 1) (- 7)) 0) (<= (div (+ (* (- 1) v_main_~v1~0_15) (* aux_div_v_it_1_42 4294967296) 1) (- 7)) (+ (div (+ (* aux_div_v_it_1_42 (- 4294967296)) (- 6)) 7) 1)) (<= (div (+ (* (- 1) v_main_~v1~0_15) (* aux_div_v_it_1_42 4294967296) 1) (- 7)) (+ (div (+ (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296)) (- 4294967296)) 7) 1)) (<= 613566756 (div (+ (* aux_div_v_it_1_42 (- 4294967296)) (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296)) (- 4294967295)) 7)) (<= (div (+ (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296) (- 4294967295)) (- 7)) (+ (div (+ (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296)) (- 4294967296)) 7) 1)) (<= (div (+ (* (- 1) v_main_~v1~0_15) 2 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296) (* aux_div_v_it_1_42 4294967296)) (- 7)) (+ (div (+ (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296)) (- 4294967296)) 7) 1)) (<= (div (+ (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296) (- 4294967295)) (- 7)) (+ (div (+ (* aux_div_v_it_1_42 (- 4294967296)) (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296)) (- 4294967295)) 7) 1)) (<= (div (+ (* (- 1) v_main_~v1~0_15) 2 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296) (* aux_div_v_it_1_42 4294967296)) (- 7)) (+ (div (+ (* aux_div_v_it_1_42 (- 4294967296)) (- 6)) 7) 1)) (<= 613566756 (div (+ (* aux_div_v_it_1_42 (- 4294967296)) (- 6)) 7)) (<= (div (+ (* (- 1) v_main_~v1~0_15) 2 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296) (* aux_div_v_it_1_42 4294967296)) (- 7)) (+ (div (+ (* aux_div_v_it_1_42 (- 4294967296)) (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296)) (- 4294967295)) 7) 1)) (< v_main_~v1~0_15 (+ 2 (* aux_div_v_it_1_42 4294967296))) (<= (div (+ (* (- 1) v_main_~v1~0_15) 2 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296) (* aux_div_v_it_1_42 4294967296)) (- 7)) 0) (<= (+ 4294967295 (* aux_div_v_it_1_42 4294967296)) 0) (<= 613566756 (div (+ (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296)) (- 4294967296)) 7)) (<= (div (+ (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296) (- 4294967295)) (- 7)) 0) (<= 6 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296)) (<= (div (+ (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296) (- 4294967295)) (- 7)) (+ (div (+ (* aux_div_v_it_1_42 (- 4294967296)) (- 6)) 7) 1))))) (and (= v_main_~v1~0_15 1) (= (+ (* aux_div_aux_mod_v_main_~l~0_29_46_42 4294967296) (* 7 aux_div_aux_mod_aux_mod_v_main_~l~0_29_46_42_44) (* aux_div_v_main_~l~0_29_46 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_29_46_42_44_64 4294967296)) 4294967296))) (< (+ (* 7 aux_div_aux_mod_aux_mod_v_main_~l~0_29_46_42_44) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_29_46_42_44_64 4294967296)) 4294967296) (<= 0 aux_mod_v_main_~n~0_BEFORE_RETURN_1_44))) ( _ , assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); , 537#(and (<= main_~v1~0 main_~l~0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (<= main_~l~0 main_~v1~0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0)) ) not inductive [2022-04-08 04:23:05,884 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 04:23:05,884 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:23:05,888 INFO L158 Benchmark]: Toolchain (without parser) took 497284.11ms. Allocated memory was 192.9MB in the beginning and 250.6MB in the end (delta: 57.7MB). Free memory was 138.2MB in the beginning and 115.4MB in the end (delta: 22.8MB). Peak memory consumption was 81.5MB. Max. memory is 8.0GB. [2022-04-08 04:23:05,888 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory is still 154.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:23:05,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.41ms. Allocated memory was 192.9MB in the beginning and 250.6MB in the end (delta: 57.7MB). Free memory was 137.9MB in the beginning and 224.3MB in the end (delta: -86.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 04:23:05,888 INFO L158 Benchmark]: Boogie Preprocessor took 54.25ms. Allocated memory is still 250.6MB. Free memory was 224.3MB in the beginning and 222.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 04:23:05,889 INFO L158 Benchmark]: RCFGBuilder took 8953.83ms. Allocated memory is still 250.6MB. Free memory was 222.8MB in the beginning and 210.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 04:23:05,889 INFO L158 Benchmark]: TraceAbstraction took 488053.42ms. Allocated memory is still 250.6MB. Free memory was 209.6MB in the beginning and 115.4MB in the end (delta: 94.2MB). Peak memory consumption was 95.2MB. Max. memory is 8.0GB. [2022-04-08 04:23:05,890 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.11ms. Allocated memory is still 192.9MB. Free memory is still 154.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.41ms. Allocated memory was 192.9MB in the beginning and 250.6MB in the end (delta: 57.7MB). Free memory was 137.9MB in the beginning and 224.3MB in the end (delta: -86.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.25ms. Allocated memory is still 250.6MB. Free memory was 224.3MB in the beginning and 222.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 8953.83ms. Allocated memory is still 250.6MB. Free memory was 222.8MB in the beginning and 210.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 488053.42ms. Allocated memory is still 250.6MB. Free memory was 209.6MB in the beginning and 115.4MB in the end (delta: 94.2MB). Peak memory consumption was 95.2MB. 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:23:05,926 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...