/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:00:22,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:00:22,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:00:22,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:00:22,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:00:22,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:00:22,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:00:22,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:00:22,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:00:22,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:00:22,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:00:22,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:00:22,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:00:22,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:00:22,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:00:22,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:00:22,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:00:22,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:00:22,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:00:22,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:00:22,629 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:00:22,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:00:22,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:00:22,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:00:22,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:00:22,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:00:22,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:00:22,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:00:22,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:00:22,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:00:22,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:00:22,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:00:22,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:00:22,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:00:22,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:00:22,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:00:22,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:00:22,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:00:22,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:00:22,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:00:22,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:00:22,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:00:22,648 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:00:22,658 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:00:22,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:00:22,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:00:22,659 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:00:22,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:00:22,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:00:22,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:00:22,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:00:22,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:00:22,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:00:22,661 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:00:22,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:00:22,661 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:00:22,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:00:22,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:00:22,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:00:22,662 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:00:22,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:00:22,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:00:22,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:00:22,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:00:22,662 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:00:22,663 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:00:22,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:00:22,663 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:00:22,663 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 07:00:22,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:00:22,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:00:22,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:00:22,902 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:00:22,907 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:00:22,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c [2022-04-15 07:00:22,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0c6f1d0/da3cbc9ae6e14a99aa226ad35c1ccdb0/FLAG62e073d3c [2022-04-15 07:00:23,316 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:00:23,317 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt5.c [2022-04-15 07:00:23,321 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0c6f1d0/da3cbc9ae6e14a99aa226ad35c1ccdb0/FLAG62e073d3c [2022-04-15 07:00:23,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0c6f1d0/da3cbc9ae6e14a99aa226ad35c1ccdb0 [2022-04-15 07:00:23,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:00:23,744 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:00:23,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:00:23,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:00:23,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:00:23,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:00:23" (1/1) ... [2022-04-15 07:00:23,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740e4728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:00:23, skipping insertion in model container [2022-04-15 07:00:23,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:00:23" (1/1) ... [2022-04-15 07:00:23,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:00:23,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:00:23,937 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/sumt5.c[403,416] [2022-04-15 07:00:23,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:00:23,978 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:00:23,992 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/sumt5.c[403,416] [2022-04-15 07:00:24,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:00:24,021 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:00:24,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:00:24 WrapperNode [2022-04-15 07:00:24,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:00:24,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:00:24,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:00:24,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:00:24,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:00:24" (1/1) ... [2022-04-15 07:00:24,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:00:24" (1/1) ... [2022-04-15 07:00:24,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:00:24" (1/1) ... [2022-04-15 07:00:24,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:00:24" (1/1) ... [2022-04-15 07:00:24,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:00:24" (1/1) ... [2022-04-15 07:00:24,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:00:24" (1/1) ... [2022-04-15 07:00:24,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:00:24" (1/1) ... [2022-04-15 07:00:24,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:00:24,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:00:24,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:00:24,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:00:24,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:00:24" (1/1) ... [2022-04-15 07:00:24,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:00:24,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:00:24,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 07:00:24,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:00:24,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:00:24,152 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:00:24,152 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:00:24,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:00:24,152 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:00:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:00:24,153 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:00:24,153 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:00:24,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:00:24,154 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:00:24,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:00:24,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:00:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:00:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:00:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:00:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:00:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:00:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:00:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:00:24,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 07:00:24,215 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:00:24,216 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:00:28,712 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:00:28,717 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:00:28,717 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:00:28,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:00:28 BoogieIcfgContainer [2022-04-15 07:00:28,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:00:28,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:00:28,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:00:28,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:00:28,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:00:23" (1/3) ... [2022-04-15 07:00:28,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ceb93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:00:28, skipping insertion in model container [2022-04-15 07:00:28,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:00:24" (2/3) ... [2022-04-15 07:00:28,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ceb93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:00:28, skipping insertion in model container [2022-04-15 07:00:28,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:00:28" (3/3) ... [2022-04-15 07:00:28,727 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt5.c [2022-04-15 07:00:28,730 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:00:28,731 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:00:28,763 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:00:28,768 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 07:00:28,768 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:00:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 07:00:28,792 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:00:28,792 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:00:28,793 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:00:28,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:00:28,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1530412705, now seen corresponding path program 1 times [2022-04-15 07:00:28,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:28,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [513051352] [2022-04-15 07:00:28,813 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:00:28,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1530412705, now seen corresponding path program 2 times [2022-04-15 07:00:28,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:00:28,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872239908] [2022-04-15 07:00:28,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:28,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:00:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:29,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:00:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:29,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(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; {28#true} is VALID [2022-04-15 07:00:29,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 07:00:29,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #71#return; {28#true} is VALID [2022-04-15 07:00:29,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {36#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:00:29,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(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; {28#true} is VALID [2022-04-15 07:00:29,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 07:00:29,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #71#return; {28#true} is VALID [2022-04-15 07:00:29,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret5 := main(); {28#true} is VALID [2022-04-15 07:00:29,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:00:29,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:00:29,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:00:29,421 INFO L272 TraceCheckUtils]: 8: Hoare triple {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {34#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:00:29,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {35#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:00:29,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29#false} is VALID [2022-04-15 07:00:29,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-15 07:00:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:00:29,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:00:29,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872239908] [2022-04-15 07:00:29,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872239908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:29,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:29,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:00:29,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:00:29,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [513051352] [2022-04-15 07:00:29,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [513051352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:29,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:29,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:00:29,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023909629] [2022-04-15 07:00:29,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:00:29,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 07:00:29,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:00:29,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:29,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:29,449 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:00:29,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:29,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:00:29,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:00:29,468 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:31,717 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:00:36,171 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:00:40,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:00:40,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:40,848 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-04-15 07:00:40,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:00:40,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 07:00:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:00:40,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-15 07:00:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-15 07:00:40,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-15 07:00:40,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:40,946 INFO L225 Difference]: With dead ends: 47 [2022-04-15 07:00:40,946 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 07:00:40,949 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:00:40,953 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:00:40,955 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 46 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 6.4s Time] [2022-04-15 07:00:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 07:00:40,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-15 07:00:40,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:00:40,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:40,986 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:40,986 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:40,994 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-15 07:00:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-15 07:00:40,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:40,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:40,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 07:00:40,995 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 07:00:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:41,000 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-15 07:00:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-15 07:00:41,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:41,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:41,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:00:41,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:00:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-04-15 07:00:41,013 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-04-15 07:00:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:00:41,018 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-04-15 07:00:41,018 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:41,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 23 transitions. [2022-04-15 07:00:41,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-15 07:00:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 07:00:41,047 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:00:41,047 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:00:41,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:00:41,048 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:00:41,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:00:41,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1637920365, now seen corresponding path program 1 times [2022-04-15 07:00:41,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:41,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1202765463] [2022-04-15 07:02:11,505 WARN L232 SmtUtils]: Spent 1.30m on a formula simplification. DAG size of input: 94 DAG size of output: 40 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-15 07:02:15,782 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:02:20,125 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:02:22,330 WARN L1034 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains relation itself. [2022-04-15 07:02:26,694 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-15 07:04:15,049 WARN L232 SmtUtils]: Spent 1.53m on a formula simplification. DAG size of input: 94 DAG size of output: 92 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 07:04:15,086 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:04:15,094 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:04:15,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1749993697, now seen corresponding path program 1 times [2022-04-15 07:04:15,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:04:15,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087029487] [2022-04-15 07:04:15,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:04:15,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:04:15,136 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) 4294967296) 0) [2022-04-15 07:04:15,136 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 5)) 0) [2022-04-15 07:04:15,136 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 5)) (- 1)) 0) [2022-04-15 07:04:15,136 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.0)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 4)) 5)) (- 1)) 0) [2022-04-15 07:04:15,137 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 5)) (- 1)) 0) [2022-04-15 07:04:15,137 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 5)) 858993459) 0) [2022-04-15 07:04:15,137 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 4)) 5)) (- 1)) 0) [2022-04-15 07:04:15,137 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.0)) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 5)) (- 1)) 0) [2022-04-15 07:04:15,137 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) 4) 0) [2022-04-15 07:04:15,137 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 5)) 858993459) 0) [2022-04-15 07:04:15,138 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 4)) 5)) 858993459) 0) [2022-04-15 07:04:15,138 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.0)) (- 5)) 0) [2022-04-15 07:04:15,138 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_1_42.0) (* (- 1) main_~l~0_7) 1) 0)) [2022-04-15 07:04:15,138 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.0)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 5)) (- 1)) 0) [2022-04-15 07:04:15,138 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_1_42.0) (* (- 1) main_~l~0_5) 4294967295) 0) [2022-04-15 07:04:15,138 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 4)) 5)) (- 1)) 0) [2022-04-15 07:04:15,139 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 5)) (- 1)) 0) [2022-04-15 07:04:15,139 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 5)) 0) [2022-04-15 07:04:15,139 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 5)) (- 1)) 0) [2022-04-15 07:04:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:15,191 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) 4294967296) 0) [2022-04-15 07:04:15,191 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (* 4294967296 .aux_div_v_it_1_42.2) 1) (- 5)) 0) [2022-04-15 07:04:15,192 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (* 4294967296 .aux_div_v_it_1_42.2) 1) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) 5)) (- 1)) 0) [2022-04-15 07:04:15,192 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.2)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (- 4)) 5)) (- 1)) 0) [2022-04-15 07:04:15,192 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) 5)) (- 1)) 0) [2022-04-15 07:04:15,192 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) 5)) 858993459) 0) [2022-04-15 07:04:15,192 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (* 4294967296 .aux_div_v_it_1_42.2) 1) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (- 4)) 5)) (- 1)) 0) [2022-04-15 07:04:15,193 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.2)) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967296)) 5)) (- 1)) 0) [2022-04-15 07:04:15,193 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) 4) 0) [2022-04-15 07:04:15,193 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967296)) 5)) 858993459) 0) [2022-04-15 07:04:15,193 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (- 4)) 5)) 858993459) 0) [2022-04-15 07:04:15,193 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.2)) (- 5)) 0) [2022-04-15 07:04:15,193 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_1_42.2) (* (- 1) main_~l~0_7) 1) 0)) [2022-04-15 07:04:15,194 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.2)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) 5)) (- 1)) 0) [2022-04-15 07:04:15,194 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_1_42.2) (* (- 1) main_~l~0_5) 4294967295) 0) [2022-04-15 07:04:15,194 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (- 4)) 5)) (- 1)) 0) [2022-04-15 07:04:15,194 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (* 4294967296 .aux_div_v_it_1_42.2) 1) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967296)) 5)) (- 1)) 0) [2022-04-15 07:04:15,194 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) (- 5)) 0) [2022-04-15 07:04:15,194 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967296)) 5)) (- 1)) 0) [2022-04-15 07:04:15,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:04:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:15,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {229#(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; {219#true} is VALID [2022-04-15 07:04:15,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} assume true; {219#true} is VALID [2022-04-15 07:04:15,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {219#true} {219#true} #71#return; {219#true} is VALID [2022-04-15 07:04:15,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {219#true} call ULTIMATE.init(); {229#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:04:15,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#(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; {219#true} is VALID [2022-04-15 07:04:15,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} assume true; {219#true} is VALID [2022-04-15 07:04:15,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {219#true} {219#true} #71#return; {219#true} is VALID [2022-04-15 07:04:15,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {219#true} call #t~ret5 := main(); {219#true} is VALID [2022-04-15 07:04:15,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:04:15,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:04:15,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [75] L21-2-->L21-3_primed: Formula: (let ((.cse20 (mod v_main_~l~0_17 4294967296)) (.cse19 (mod v_main_~n~0_7 4294967296))) (let ((.cse0 (< .cse20 .cse19)) (.cse1 (= (mod (mod .cse20 5) 4294967296) 0)) (.cse2 (= v_main_~l~0_17 v_main_~l~0_16)) (.cse3 (= v_main_~v3~0_7 v_main_~v3~0_6))) (or (and (or (not .cse0) (not .cse1)) .cse2 .cse3) (let ((.cse18 (< v_main_~l~0_16 (+ v_main_~l~0_17 2)))) (and (or (forall ((aux_div_v_it_1_42 Int) (aux_div_aux_mod_aux_mod_v_it_1_42_25_45 Int)) (let ((.cse16 (* aux_div_v_it_1_42 (- 4294967296))) (.cse17 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296)))) (let ((.cse12 (div (+ .cse17 (- 4294967296)) 5)) (.cse4 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296)) (.cse13 (div (+ v_main_~l~0_17 .cse16 (- 4)) 5)) (.cse10 (div (+ v_main_~l~0_17 .cse16 .cse17 (- 4294967295)) 5)) (.cse15 (* v_main_~l~0_16 (- 1))) (.cse14 (* aux_div_v_it_1_42 4294967296))) (let ((.cse7 (div (+ .cse15 .cse14) (- 5))) (.cse6 (+ 1 .cse10)) (.cse8 (+ .cse13 1)) (.cse5 (div (+ .cse15 .cse4 .cse14 1) (- 5))) (.cse9 (div (+ .cse4 (- 4294967295)) (- 5))) (.cse11 (+ .cse12 1))) (or (<= (+ .cse4 4294967296) 0) (<= .cse5 0) (<= .cse5 .cse6) (<= .cse7 .cse8) (<= .cse9 .cse6) (<= 858993459 .cse10) (<= .cse5 .cse8) (<= .cse7 .cse11) (<= 4 .cse4) (<= 858993459 .cse12) (<= 858993459 .cse13) (<= .cse7 0) (< v_main_~l~0_16 (+ .cse14 1)) (<= .cse7 .cse6) (<= (+ 4294967295 .cse14) v_main_~l~0_17) (<= .cse9 .cse8) (<= .cse5 .cse11) (<= .cse9 0) (<= .cse9 .cse11)))))) .cse18) (or (<= (div (+ (* v_main_~l~0_16 (- 1)) .cse19) (- 4294967296)) (+ (div (+ v_main_~l~0_17 (- 4294967295)) 4294967296) 1)) .cse18) .cse0 .cse1 (< v_main_~l~0_17 v_main_~l~0_16) (= (+ v_main_~l~0_16 v_main_~v3~0_7) (+ v_main_~l~0_17 v_main_~v3~0_6)))) (and .cse2 .cse3 (= v_main_~n~0_7 v_main_~n~0_7))))) InVars {main_~l~0=v_main_~l~0_17, main_~v3~0=v_main_~v3~0_7, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_6, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~l~0, main_~v3~0] {225#(and (or (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v3~0))) (= main_~k~0 0) (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)) (or (<= main_~v3~0 main_~l~0) (not (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0 1) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)))) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 07:04:15,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {225#(and (or (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v3~0))) (= main_~k~0 0) (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)) (or (<= main_~v3~0 main_~l~0) (not (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0 1) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)))) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [74] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {226#(and (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (= main_~k~0 0) (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)) (= main_~j~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0 1)) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 07:04:15,701 INFO L272 TraceCheckUtils]: 9: Hoare triple {226#(and (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (= main_~k~0 0) (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)) (= main_~j~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0 1)) (= main_~i~0 0) (= main_~v4~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {227#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:04:15,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {227#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {228#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:04:15,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {228#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {220#false} is VALID [2022-04-15 07:04:15,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {220#false} assume !false; {220#false} is VALID [2022-04-15 07:04:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:04:15,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:04:15,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087029487] [2022-04-15 07:04:15,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087029487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:04:15,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:04:15,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:04:34,238 WARN L232 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 84 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 07:04:34,285 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:04:34,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1202765463] [2022-04-15 07:04:34,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1202765463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:04:34,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:04:34,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:04:34,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648057231] [2022-04-15 07:04:34,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:04:34,287 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 07:04:34,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:04:34,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:34,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:04:34,334 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:04:34,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:04:34,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:04:34,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=94, Unknown=5, NotChecked=0, Total=132 [2022-04-15 07:04:34,338 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:36,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:04:41,189 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:04:45,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:04:47,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:04:50,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:04:56,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:04:58,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:05:01,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:05:03,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:05:05,579 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:05:07,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:05:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:08,066 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-15 07:05:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 07:05:08,066 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 07:05:08,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:05:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-15 07:05:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-15 07:05:08,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2022-04-15 07:05:08,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:08,132 INFO L225 Difference]: With dead ends: 41 [2022-04-15 07:05:08,132 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 07:05:08,133 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=79, Invalid=258, Unknown=5, NotChecked=0, Total=342 [2022-04-15 07:05:08,134 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 11 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:05:08,134 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 62 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 103 Invalid, 11 Unknown, 39 Unchecked, 23.4s Time] [2022-04-15 07:05:08,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 07:05:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-15 07:05:08,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:05:08,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:08,152 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:08,153 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:08,155 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-15 07:05:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 07:05:08,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:05:08,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:05:08,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 07:05:08,156 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 07:05:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:08,157 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-15 07:05:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 07:05:08,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:05:08,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:05:08,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:05:08,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:05:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-15 07:05:08,160 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2022-04-15 07:05:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:05:08,160 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-15 07:05:08,160 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:08,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-15 07:05:08,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 07:05:08,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 07:05:08,204 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:05:08,204 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:05:08,205 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:05:08,205 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:05:08,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:05:08,205 INFO L85 PathProgramCache]: Analyzing trace with hash -469553554, now seen corresponding path program 1 times [2022-04-15 07:05:08,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:05:08,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1543985444] [2022-04-15 07:09:09,577 WARN L232 SmtUtils]: Spent 3.79m on a formula simplification. DAG size of input: 76 DAG size of output: 59 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-15 07:09:13,991 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:16,142 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:18,350 WARN L1034 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains relation itself. [2022-04-15 07:09:22,779 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-15 07:11:28,477 WARN L232 SmtUtils]: Spent 1.83m on a formula simplification. DAG size of input: 76 DAG size of output: 34 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 07:11:28,482 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:28,490 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:28,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1809099041, now seen corresponding path program 1 times [2022-04-15 07:11:28,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:28,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684640659] [2022-04-15 07:11:28,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:28,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:28,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:29,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {450#(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; {440#true} is VALID [2022-04-15 07:11:29,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {440#true} assume true; {440#true} is VALID [2022-04-15 07:11:29,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {440#true} {440#true} #71#return; {440#true} is VALID [2022-04-15 07:11:29,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {440#true} call ULTIMATE.init(); {450#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:29,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#(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; {440#true} is VALID [2022-04-15 07:11:29,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {440#true} assume true; {440#true} is VALID [2022-04-15 07:11:29,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {440#true} {440#true} #71#return; {440#true} is VALID [2022-04-15 07:11:29,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {440#true} call #t~ret5 := main(); {440#true} is VALID [2022-04-15 07:11:29,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {440#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {445#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:11:29,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {445#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {445#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:11:29,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {445#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [77] L21-2-->L21-3_primed: Formula: (let ((.cse5 (mod v_main_~l~0_24 4294967296))) (let ((.cse0 (= v_main_~v4~0_7 v_main_~v4~0_6)) (.cse1 (= v_main_~l~0_24 v_main_~l~0_23)) (.cse3 (= (mod v_main_~l~0_24 4) 0)) (.cse4 (= (mod (mod .cse5 5) 4294967296) 0)) (.cse2 (< .cse5 (mod v_main_~n~0_9 4294967296)))) (or (and .cse0 .cse1 (= v_main_~n~0_9 v_main_~n~0_9)) (and .cse0 .cse1 (or (not .cse2) (not .cse3) .cse4)) (and (< v_main_~l~0_23 (+ v_main_~l~0_24 2)) (< v_main_~l~0_24 v_main_~l~0_23) (= (+ v_main_~l~0_24 v_main_~v4~0_6) (+ v_main_~l~0_23 v_main_~v4~0_7)) .cse3 (not .cse4) .cse2)))) InVars {main_~l~0=v_main_~l~0_24, main_~n~0=v_main_~n~0_9, main_~v4~0=v_main_~v4~0_7} OutVars{main_~l~0=v_main_~l~0_23, main_~n~0=v_main_~n~0_9, main_~v4~0=v_main_~v4~0_6} AuxVars[] AssignedVars[main_~l~0, main_~v4~0] {446#(and (= main_~k~0 0) (or (and (= main_~l~0 0) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))) (and (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v4~0)) (<= main_~v4~0 main_~l~0)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))))) (= main_~j~0 0) (= main_~i~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:11:29,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {446#(and (= main_~k~0 0) (or (and (= main_~l~0 0) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))) (and (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v4~0)) (<= main_~v4~0 main_~l~0)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))))) (= main_~j~0 0) (= main_~i~0 0) (= main_~v3~0 0))} [76] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {447#(and (= main_~k~0 0) (= main_~j~0 0) (or (and (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))) (and (= main_~l~0 0) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0)))) (= main_~i~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:11:29,015 INFO L272 TraceCheckUtils]: 9: Hoare triple {447#(and (= main_~k~0 0) (= main_~j~0 0) (or (and (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))) (and (= main_~l~0 0) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0)))) (= main_~i~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:11:29,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {448#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {449#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:11:29,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {449#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {441#false} is VALID [2022-04-15 07:11:29,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {441#false} assume !false; {441#false} is VALID [2022-04-15 07:11:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:11:29,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:29,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684640659] [2022-04-15 07:11:29,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684640659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:29,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:29,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:11:29,076 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:29,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1543985444] [2022-04-15 07:11:29,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1543985444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:29,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:29,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:11:29,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732672087] [2022-04-15 07:11:29,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:29,077 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 16 [2022-04-15 07:11:29,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:29,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:31,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:31,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:11:31,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:31,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:11:31,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:11:31,300 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:35,657 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:11:37,861 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:11:42,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:11:44,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:11:48,972 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:11:53,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:11:55,588 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:11:57,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:11:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:58,127 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-15 07:11:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:11:58,127 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 16 [2022-04-15 07:11:58,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 07:11:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 07:11:58,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-15 07:12:00,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:00,380 INFO L225 Difference]: With dead ends: 37 [2022-04-15 07:12:00,380 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 07:12:00,380 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:12:00,381 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:00,381 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 8 Unknown, 0 Unchecked, 17.3s Time] [2022-04-15 07:12:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 07:12:00,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 07:12:00,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:00,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:12:00,394 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:12:00,394 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:12:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:00,395 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 07:12:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 07:12:00,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:00,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:00,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 07:12:00,397 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 07:12:00,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:00,398 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 07:12:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 07:12:00,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:00,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:00,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:00,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:00,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:12:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-15 07:12:00,402 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2022-04-15 07:12:00,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:00,402 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-15 07:12:00,403 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:12:00,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2022-04-15 07:12:00,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 07:12:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 07:12:00,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:00,437 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:00,437 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 07:12:00,438 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:00,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:00,438 INFO L85 PathProgramCache]: Analyzing trace with hash 930365569, now seen corresponding path program 1 times [2022-04-15 07:12:00,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:00,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [220033887] [2022-04-15 07:14:51,990 WARN L232 SmtUtils]: Spent 2.40m on a formula simplification. DAG size of input: 97 DAG size of output: 48 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-15 07:14:56,490 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:15:00,985 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:15:03,304 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself.