/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:27:08,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:27:08,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:27:08,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:27:08,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:27:08,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:27:08,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:27:08,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:27:08,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:27:08,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:27:08,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:27:08,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:27:08,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:27:08,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:27:08,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:27:08,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:27:08,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:27:08,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:27:08,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:27:08,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:27:08,737 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:27:08,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:27:08,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:27:08,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:27:08,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:27:08,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:27:08,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:27:08,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:27:08,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:27:08,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:27:08,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:27:08,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:27:08,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:27:08,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:27:08,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:27:08,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:27:08,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:27:08,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:27:08,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:27:08,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:27:08,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:27:08,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:27:08,756 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:27:08,766 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:27:08,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:27:08,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:27:08,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:27:08,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:27:08,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:27:08,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:27:08,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:27:08,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:27:08,768 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:27:08,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:27:08,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:27:08,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:27:08,769 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:27:08,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:27:08,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:27:08,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:27:08,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:27:08,769 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:27:08,769 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:27:08,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:27:08,770 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:27:08,770 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 10:27:09,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:27:09,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:27:09,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:27:09,071 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:27:09,072 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:27:09,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt8.c [2022-04-08 10:27:09,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5cdb082/8cc09b58a039433295564c3fa0d57fb0/FLAG3f1c30a15 [2022-04-08 10:27:09,584 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:27:09,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt8.c [2022-04-08 10:27:09,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5cdb082/8cc09b58a039433295564c3fa0d57fb0/FLAG3f1c30a15 [2022-04-08 10:27:09,615 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5cdb082/8cc09b58a039433295564c3fa0d57fb0 [2022-04-08 10:27:09,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:27:09,620 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:27:09,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:27:09,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:27:09,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:27:09,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:27:09" (1/1) ... [2022-04-08 10:27:09,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65cdd7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:27:09, skipping insertion in model container [2022-04-08 10:27:09,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:27:09" (1/1) ... [2022-04-08 10:27:09,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:27:09,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:27:09,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt8.c[403,416] [2022-04-08 10:27:09,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:27:09,837 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:27:09,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt8.c[403,416] [2022-04-08 10:27:09,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:27:09,869 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:27:09,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:27:09 WrapperNode [2022-04-08 10:27:09,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:27:09,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:27:09,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:27:09,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:27:09,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:27:09" (1/1) ... [2022-04-08 10:27:09,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:27:09" (1/1) ... [2022-04-08 10:27:09,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:27:09" (1/1) ... [2022-04-08 10:27:09,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:27:09" (1/1) ... [2022-04-08 10:27:09,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:27:09" (1/1) ... [2022-04-08 10:27:09,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:27:09" (1/1) ... [2022-04-08 10:27:09,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:27:09" (1/1) ... [2022-04-08 10:27:09,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:27:09,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:27:09,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:27:09,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:27:09,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:27:09" (1/1) ... [2022-04-08 10:27:09,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:27:09,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:27:09,941 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 10:27:09,944 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 10:27:09,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:27:09,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:27:09,976 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:27:09,976 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:27:09,976 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:27:09,977 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:27:09,977 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:27:09,977 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:27:09,977 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:27:09,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:27:09,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:27:09,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:27:09,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 10:27:09,978 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:27:09,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:27:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:27:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:27:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:27:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:27:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:27:10,046 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:27:10,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:27:18,953 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:27:18,960 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:27:18,961 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 10:27:18,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:27:18 BoogieIcfgContainer [2022-04-08 10:27:18,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:27:18,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:27:18,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:27:18,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:27:18,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:27:09" (1/3) ... [2022-04-08 10:27:18,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8335674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:27:18, skipping insertion in model container [2022-04-08 10:27:18,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:27:09" (2/3) ... [2022-04-08 10:27:18,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8335674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:27:18, skipping insertion in model container [2022-04-08 10:27:18,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:27:18" (3/3) ... [2022-04-08 10:27:18,970 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt8.c [2022-04-08 10:27:18,976 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:27:18,976 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:27:19,015 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:27:19,021 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 10:27:19,022 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:27:19,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:27:19,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 10:27:19,047 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:27:19,048 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:27:19,048 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:27:19,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:27:19,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1128394070, now seen corresponding path program 1 times [2022-04-08 10:27:19,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:27:19,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [222293645] [2022-04-08 10:27:19,083 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:27:19,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1128394070, now seen corresponding path program 2 times [2022-04-08 10:27:19,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:27:19,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256744286] [2022-04-08 10:27:19,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:27:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:27:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:19,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:27:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:19,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {31#true} is VALID [2022-04-08 10:27:19,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 10:27:19,988 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #86#return; {31#true} is VALID [2022-04-08 10:27:19,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {41#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:27:19,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {31#true} is VALID [2022-04-08 10:27:19,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 10:27:19,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #86#return; {31#true} is VALID [2022-04-08 10:27:19,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-08 10:27:19,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:19,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:19,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:19,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {37#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (<= 1 main_~v5~0) (= main_~v3~0 0) (<= main_~v5~0 1))} is VALID [2022-04-08 10:27:19,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (<= 1 main_~v5~0) (= main_~v3~0 0) (<= main_~v5~0 1))} ~l~0 := 1 + ~l~0; {38#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296)))) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:19,998 INFO L272 TraceCheckUtils]: 10: Hoare triple {38#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296)))) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {39#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:27:20,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {40#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:27:20,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32#false} is VALID [2022-04-08 10:27:20,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-08 10:27:20,003 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 10:27:20,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:27:20,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256744286] [2022-04-08 10:27:20,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256744286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:27:20,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:27:20,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:27:20,006 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:27:20,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [222293645] [2022-04-08 10:27:20,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [222293645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:27:20,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:27:20,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:27:20,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900469712] [2022-04-08 10:27:20,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:27:20,013 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 10:27:20,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:27:20,017 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 10:27:20,036 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 10:27:20,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:27:20,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:27:20,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:27:20,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 10:27:20,059 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:22,752 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 10:27:27,168 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 10:27:31,475 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 10:27:38,028 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 10:27:40,199 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 10:27:42,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:27:48,926 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 10:27:53,239 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 10:27:55,404 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 10:27:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:55,680 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2022-04-08 10:27:55,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:27:55,681 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 10:27:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:27:55,682 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 10:27:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 10:27:55,694 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 10:27:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 10:27:55,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-08 10:27:55,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:27:55,834 INFO L225 Difference]: With dead ends: 66 [2022-04-08 10:27:55,834 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 10:27:55,836 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:27:55,839 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 57 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 14 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:27:55,840 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 55 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 123 Invalid, 9 Unknown, 0 Unchecked, 19.4s Time] [2022-04-08 10:27:55,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 10:27:55,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-08 10:27:55,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:27:55,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:27:55,883 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:27:55,883 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:27:55,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:55,886 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 10:27:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 10:27:55,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:27:55,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:27:55,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-08 10:27:55,888 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-08 10:27:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:55,891 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 10:27:55,891 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 10:27:55,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:27:55,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:27:55,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:27:55,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:27:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:27:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-04-08 10:27:55,895 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 14 [2022-04-08 10:27:55,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:27:55,896 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-04-08 10:27:55,896 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 10:27:55,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 38 transitions. [2022-04-08 10:27:55,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:27:55,943 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-08 10:27:55,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:27:55,944 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:27:55,944 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 10:27:55,944 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:27:55,945 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:27:55,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:27:55,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1294727378, now seen corresponding path program 1 times [2022-04-08 10:27:55,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:27:55,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1826676977] [2022-04-08 10:27:57,950 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:27:57,951 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:27:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1294727378, now seen corresponding path program 2 times [2022-04-08 10:27:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:27:57,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10244156] [2022-04-08 10:27:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:27:57,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:27:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:58,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:27:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:58,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {329#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {318#true} is VALID [2022-04-08 10:27:58,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-08 10:27:58,058 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {318#true} {318#true} #86#return; {318#true} is VALID [2022-04-08 10:27:58,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-08 10:27:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:58,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {318#true} ~cond := #in~cond; {318#true} is VALID [2022-04-08 10:27:58,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#true} assume !(0 == ~cond); {318#true} is VALID [2022-04-08 10:27:58,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-08 10:27:58,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {318#true} {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} #84#return; {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-08 10:27:58,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {329#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:27:58,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {329#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {318#true} is VALID [2022-04-08 10:27:58,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-08 10:27:58,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #86#return; {318#true} is VALID [2022-04-08 10:27:58,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret5 := main(); {318#true} is VALID [2022-04-08 10:27:58,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {318#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {323#(= main_~l~0 0)} is VALID [2022-04-08 10:27:58,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {323#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {323#(= main_~l~0 0)} is VALID [2022-04-08 10:27:58,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {323#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {323#(= main_~l~0 0)} is VALID [2022-04-08 10:27:58,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {323#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {323#(= main_~l~0 0)} is VALID [2022-04-08 10:27:58,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {323#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-08 10:27:58,071 INFO L272 TraceCheckUtils]: 10: Hoare triple {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {318#true} is VALID [2022-04-08 10:27:58,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {318#true} ~cond := #in~cond; {318#true} is VALID [2022-04-08 10:27:58,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {318#true} assume !(0 == ~cond); {318#true} is VALID [2022-04-08 10:27:58,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-08 10:27:58,073 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {318#true} {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} #84#return; {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-08 10:27:58,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-08 10:27:58,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {319#false} is VALID [2022-04-08 10:27:58,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {319#false} ~l~0 := 1 + ~l~0; {319#false} is VALID [2022-04-08 10:27:58,075 INFO L272 TraceCheckUtils]: 18: Hoare triple {319#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {319#false} is VALID [2022-04-08 10:27:58,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {319#false} ~cond := #in~cond; {319#false} is VALID [2022-04-08 10:27:58,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {319#false} assume 0 == ~cond; {319#false} is VALID [2022-04-08 10:27:58,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {319#false} assume !false; {319#false} is VALID [2022-04-08 10:27:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:27:58,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:27:58,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10244156] [2022-04-08 10:27:58,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10244156] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:27:58,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617434447] [2022-04-08 10:27:58,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:27:58,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:27:58,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:27:58,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:27:58,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 10:27:58,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:27:58,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:27:58,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:27:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:58,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:27:58,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {318#true} is VALID [2022-04-08 10:27:58,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {318#true} is VALID [2022-04-08 10:27:58,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-08 10:27:58,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #86#return; {318#true} is VALID [2022-04-08 10:27:58,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret5 := main(); {318#true} is VALID [2022-04-08 10:27:58,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {318#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {348#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:58,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {348#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {348#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:58,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {348#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {348#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:58,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {348#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {358#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:58,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {358#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {362#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) 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 10:27:58,898 INFO L272 TraceCheckUtils]: 10: Hoare triple {362#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {318#true} is VALID [2022-04-08 10:27:58,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {318#true} ~cond := #in~cond; {318#true} is VALID [2022-04-08 10:27:58,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {318#true} assume !(0 == ~cond); {318#true} is VALID [2022-04-08 10:27:58,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-08 10:27:58,900 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {318#true} {362#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {362#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) 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 10:27:58,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {362#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) 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); {362#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) 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 10:27:58,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {362#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {384#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= 2 main_~v5~0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:58,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {384#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= 2 main_~v5~0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {388#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= 2 main_~v5~0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:58,903 INFO L272 TraceCheckUtils]: 18: Hoare triple {388#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= 2 main_~v5~0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {392#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:27:58,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {392#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {396#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:27:58,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {396#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {319#false} is VALID [2022-04-08 10:27:58,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {319#false} assume !false; {319#false} is VALID [2022-04-08 10:27:58,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:27:58,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:27:59,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {319#false} assume !false; {319#false} is VALID [2022-04-08 10:27:59,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {396#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {319#false} is VALID [2022-04-08 10:27:59,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {392#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {396#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:27:59,186 INFO L272 TraceCheckUtils]: 18: Hoare triple {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {392#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:27:59,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {416#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:27:59,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {416#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-08 10:27:59,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:27:59,334 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {318#true} {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:27:59,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-08 10:27:59,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {318#true} assume !(0 == ~cond); {318#true} is VALID [2022-04-08 10:27:59,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {318#true} ~cond := #in~cond; {318#true} is VALID [2022-04-08 10:27:59,335 INFO L272 TraceCheckUtils]: 10: Hoare triple {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {318#true} is VALID [2022-04-08 10:27:59,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {416#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:27:59,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {416#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-08 10:27:59,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:27:59,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:27:59,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {318#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:27:59,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret5 := main(); {318#true} is VALID [2022-04-08 10:27:59,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #86#return; {318#true} is VALID [2022-04-08 10:27:59,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-08 10:27:59,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {318#true} is VALID [2022-04-08 10:27:59,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {318#true} is VALID [2022-04-08 10:27:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:27:59,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617434447] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:27:59,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:27:59,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-08 10:27:59,354 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:27:59,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1826676977] [2022-04-08 10:27:59,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1826676977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:27:59,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:27:59,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:27:59,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204379733] [2022-04-08 10:27:59,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:27:59,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-08 10:27:59,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:27:59,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 10:27:59,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:27:59,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:27:59,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:27:59,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:27:59,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:27:59,393 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 10:28:01,603 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 10:28:03,803 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 10:28:10,308 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 10:28:12,465 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 10:28:21,144 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 10:28:23,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:28:31,982 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 10:28:34,845 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:28:39,258 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 10:28:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:28:39,261 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-08 10:28:39,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:28:39,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-08 10:28:39,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:28:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 10:28:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-08 10:28:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 10:28:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-08 10:28:39,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-08 10:28:39,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:28:39,523 INFO L225 Difference]: With dead ends: 42 [2022-04-08 10:28:39,523 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 10:28:39,523 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:28:39,525 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:28:39,525 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 83 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 9 Unknown, 0 Unchecked, 19.6s Time] [2022-04-08 10:28:39,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 10:28:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2022-04-08 10:28:39,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:28:39,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:28:39,576 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:28:39,576 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:28:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:28:39,586 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-08 10:28:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-08 10:28:39,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:28:39,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:28:39,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-08 10:28:39,587 INFO L87 Difference]: Start difference. First operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-08 10:28:39,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:28:39,590 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-08 10:28:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-08 10:28:39,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:28:39,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:28:39,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:28:39,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:28:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:28:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-04-08 10:28:39,596 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 22 [2022-04-08 10:28:39,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:28:39,597 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-04-08 10:28:39,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 10:28:39,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 41 transitions. [2022-04-08 10:28:39,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:28:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-08 10:28:39,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:28:39,724 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:28:39,724 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:28:39,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 10:28:39,925 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:28:39,925 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:28:39,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:28:39,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1889278409, now seen corresponding path program 1 times [2022-04-08 10:28:39,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:28:39,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1544025244] [2022-04-08 10:28:41,565 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:28:41,565 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:28:41,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1889278409, now seen corresponding path program 2 times [2022-04-08 10:28:41,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:28:41,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400755022] [2022-04-08 10:28:41,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:28:41,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:28:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:28:41,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:28:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:28:41,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {713#(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; {702#true} is VALID [2022-04-08 10:28:41,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {702#true} assume true; {702#true} is VALID [2022-04-08 10:28:41,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {702#true} {702#true} #86#return; {702#true} is VALID [2022-04-08 10:28:41,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-08 10:28:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:28:41,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {702#true} ~cond := #in~cond; {702#true} is VALID [2022-04-08 10:28:41,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {702#true} assume !(0 == ~cond); {702#true} is VALID [2022-04-08 10:28:41,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2022-04-08 10:28:41,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {702#true} {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} #84#return; {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-08 10:28:41,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {713#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:28:41,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {713#(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; {702#true} is VALID [2022-04-08 10:28:41,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2022-04-08 10:28:41,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {702#true} {702#true} #86#return; {702#true} is VALID [2022-04-08 10:28:41,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {702#true} call #t~ret5 := main(); {702#true} is VALID [2022-04-08 10:28:41,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {702#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {707#(= main_~l~0 0)} is VALID [2022-04-08 10:28:41,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {707#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {707#(= main_~l~0 0)} is VALID [2022-04-08 10:28:41,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {707#(= main_~l~0 0)} is VALID [2022-04-08 10:28:41,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {707#(= main_~l~0 0)} is VALID [2022-04-08 10:28:41,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-08 10:28:41,738 INFO L272 TraceCheckUtils]: 10: Hoare triple {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {702#true} is VALID [2022-04-08 10:28:41,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {702#true} ~cond := #in~cond; {702#true} is VALID [2022-04-08 10:28:41,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {702#true} assume !(0 == ~cond); {702#true} is VALID [2022-04-08 10:28:41,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {702#true} assume true; {702#true} is VALID [2022-04-08 10:28:41,739 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {702#true} {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} #84#return; {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-08 10:28:41,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-08 10:28:41,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-08 10:28:41,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~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; {703#false} is VALID [2022-04-08 10:28:41,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {703#false} ~l~0 := 1 + ~l~0; {703#false} is VALID [2022-04-08 10:28:41,744 INFO L272 TraceCheckUtils]: 19: Hoare triple {703#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {703#false} is VALID [2022-04-08 10:28:41,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {703#false} ~cond := #in~cond; {703#false} is VALID [2022-04-08 10:28:41,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {703#false} assume 0 == ~cond; {703#false} is VALID [2022-04-08 10:28:41,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {703#false} assume !false; {703#false} is VALID [2022-04-08 10:28:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:28:41,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:28:41,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400755022] [2022-04-08 10:28:41,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400755022] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:28:41,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864387001] [2022-04-08 10:28:41,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:28:41,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:28:41,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:28:41,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:28:41,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process