/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/sumt4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:11:56,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:11:56,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:11:56,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:11:56,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:11:56,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:11:56,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:11:56,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:11:56,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:11:56,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:11:56,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:11:56,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:11:56,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:11:56,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:11:56,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:11:56,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:11:56,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:11:56,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:11:56,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:11:56,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:11:56,354 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:11:56,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:11:56,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:11:56,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:11:56,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:11:56,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:11:56,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:11:56,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:11:56,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:11:56,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:11:56,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:11:56,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:11:56,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:11:56,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:11:56,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:11:56,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:11:56,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:11:56,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:11:56,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:11:56,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:11:56,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:11:56,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:11:56,381 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:11:56,388 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:11:56,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:11:56,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:11:56,390 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:11:56,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:11:56,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:11:56,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:11:56,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:11:56,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:11:56,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:11:56,391 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:11:56,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:11:56,391 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:11:56,391 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:11:56,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:11:56,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:11:56,392 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:11:56,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:11:56,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:11:56,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:11:56,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:11:56,392 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:11:56,392 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:11:56,392 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:11:56,392 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:11:56,392 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 04:11:56,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:11:56,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:11:56,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:11:56,614 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:11:56,615 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:11:56,616 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt4.c [2022-04-08 04:11:56,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0ee14764/ada07943ad0e45c8b9f62b05c3fe2671/FLAGfe79caaaf [2022-04-08 04:11:57,056 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:11:57,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt4.c [2022-04-08 04:11:57,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0ee14764/ada07943ad0e45c8b9f62b05c3fe2671/FLAGfe79caaaf [2022-04-08 04:11:57,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0ee14764/ada07943ad0e45c8b9f62b05c3fe2671 [2022-04-08 04:11:57,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:11:57,078 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:11:57,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:11:57,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:11:57,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:11:57,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:11:57" (1/1) ... [2022-04-08 04:11:57,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180f5c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:57, skipping insertion in model container [2022-04-08 04:11:57,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:11:57" (1/1) ... [2022-04-08 04:11:57,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:11:57,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:11:57,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt4.c[403,416] [2022-04-08 04:11:57,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:11:57,327 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:11:57,336 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/sumt4.c[403,416] [2022-04-08 04:11:57,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:11:57,359 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:11:57,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:57 WrapperNode [2022-04-08 04:11:57,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:11:57,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:11:57,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:11:57,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:11:57,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:57" (1/1) ... [2022-04-08 04:11:57,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:57" (1/1) ... [2022-04-08 04:11:57,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:57" (1/1) ... [2022-04-08 04:11:57,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:57" (1/1) ... [2022-04-08 04:11:57,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:57" (1/1) ... [2022-04-08 04:11:57,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:57" (1/1) ... [2022-04-08 04:11:57,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:57" (1/1) ... [2022-04-08 04:11:57,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:11:57,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:11:57,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:11:57,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:11:57,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:57" (1/1) ... [2022-04-08 04:11:57,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:11:57,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:11:57,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 04:11:57,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 04:11:57,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:11:57,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:11:57,508 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:11:57,508 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:11:57,508 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:11:57,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:11:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:11:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:11:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:11:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:11:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:11:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:11:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 04:11:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:11:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:11:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:11:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:11:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:11:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:11:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:11:57,587 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:11:57,588 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:11:59,926 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:11:59,942 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:11:59,942 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:11:59,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:11:59 BoogieIcfgContainer [2022-04-08 04:11:59,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:11:59,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:11:59,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:11:59,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:11:59,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:11:57" (1/3) ... [2022-04-08 04:11:59,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1123f1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:11:59, skipping insertion in model container [2022-04-08 04:11:59,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:57" (2/3) ... [2022-04-08 04:11:59,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1123f1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:11:59, skipping insertion in model container [2022-04-08 04:11:59,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:11:59" (3/3) ... [2022-04-08 04:11:59,967 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt4.c [2022-04-08 04:11:59,970 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:11:59,970 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:12:00,024 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:12:00,028 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 04:12:00,029 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:12:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:12:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 04:12:00,047 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:12:00,047 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:12:00,048 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:12:00,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:12:00,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1709511738, now seen corresponding path program 1 times [2022-04-08 04:12:00,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:12:00,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1180315582] [2022-04-08 04:12:00,071 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:12:00,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1709511738, now seen corresponding path program 2 times [2022-04-08 04:12:00,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:12:00,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032547661] [2022-04-08 04:12:00,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:12:00,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:12:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:12:00,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:12:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:12:00,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(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; {27#true} is VALID [2022-04-08 04:12:00,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 04:12:00,500 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #66#return; {27#true} is VALID [2022-04-08 04:12:00,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {35#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:12:00,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(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; {27#true} is VALID [2022-04-08 04:12:00,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 04:12:00,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #66#return; {27#true} is VALID [2022-04-08 04:12:00,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-08 04:12:00,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 04:12:00,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 04:12:00,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 04:12:00,506 INFO L272 TraceCheckUtils]: 8: Hoare triple {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:12:00,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:12:00,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28#false} is VALID [2022-04-08 04:12:00,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-08 04:12:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:12:00,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:12:00,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032547661] [2022-04-08 04:12:00,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032547661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:12:00,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:12:00,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:12:00,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:12:00,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1180315582] [2022-04-08 04:12:00,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1180315582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:12:00,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:12:00,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:12:00,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268283562] [2022-04-08 04:12:00,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:12:00,517 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-08 04:12:00,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:12:00,520 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-08 04:12:00,535 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-08 04:12:00,535 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:12:00,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:12:00,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:12:00,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:12:00,556 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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-08 04:12:05,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:12:07,170 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:12:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:12:09,730 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-08 04:12:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 04:12:09,731 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-08 04:12:09,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:12:09,732 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-08 04:12:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 04:12:09,755 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-08 04:12:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 04:12:09,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-08 04:12:09,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:12:09,843 INFO L225 Difference]: With dead ends: 51 [2022-04-08 04:12:09,843 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 04:12:09,845 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-08 04:12:09,848 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:12:09,849 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 41 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-04-08 04:12:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 04:12:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-08 04:12:09,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:12:09,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:12:09,873 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:12:09,873 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:12:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:12:09,878 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-08 04:12:09,878 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 04:12:09,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:12:09,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:12:09,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 19 states. [2022-04-08 04:12:09,879 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 19 states. [2022-04-08 04:12:09,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:12:09,888 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-08 04:12:09,888 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 04:12:09,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:12:09,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:12:09,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:12:09,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:12:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:12:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-08 04:12:09,892 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-04-08 04:12:09,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:12:09,893 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-08 04:12:09,893 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-08 04:12:09,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-08 04:12:09,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:12:09,913 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 04:12:09,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 04:12:09,914 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:12:09,914 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:12:09,914 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:12:09,914 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:12:09,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:12:09,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1996045709, now seen corresponding path program 1 times [2022-04-08 04:12:09,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:12:09,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [8032245] [2022-04-08 04:12:10,690 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 04:12:10,691 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:12:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash -46561988, now seen corresponding path program 1 times [2022-04-08 04:12:10,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:12:10,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965273790] [2022-04-08 04:12:10,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:12:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:12:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:12:11,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:12:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:12:11,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#(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; {224#true} is VALID [2022-04-08 04:12:11,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-08 04:12:11,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {224#true} {224#true} #66#return; {224#true} is VALID [2022-04-08 04:12:11,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {234#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:12:11,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#(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; {224#true} is VALID [2022-04-08 04:12:11,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-08 04:12:11,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #66#return; {224#true} is VALID [2022-04-08 04:12:11,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret5 := main(); {224#true} is VALID [2022-04-08 04:12:11,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 04:12:11,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 04:12:11,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [70] L21-2-->L21-3_primed: Formula: (let ((.cse0 (= v_main_~v4~0_7 v_main_~v4~0_6)) (.cse1 (= v_main_~l~0_15 v_main_~l~0_14)) (.cse3 (< (mod v_main_~l~0_15 4294967296) (mod v_main_~n~0_7 4294967296))) (.cse2 (= (mod v_main_~l~0_15 4) 0))) (or (and .cse0 .cse1 (= v_main_~n~0_7 v_main_~n~0_7)) (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and (< v_main_~l~0_15 v_main_~l~0_14) .cse3 (< v_main_~l~0_14 (+ v_main_~l~0_15 2)) .cse2 (= (+ v_main_~l~0_15 v_main_~v4~0_6) (+ v_main_~l~0_14 v_main_~v4~0_7))))) InVars {main_~l~0=v_main_~l~0_15, main_~n~0=v_main_~n~0_7, main_~v4~0=v_main_~v4~0_7} OutVars{main_~l~0=v_main_~l~0_14, main_~n~0=v_main_~n~0_7, main_~v4~0=v_main_~v4~0_6} AuxVars[] AssignedVars[main_~l~0, main_~v4~0] {230#(and (= main_~k~0 0) (= main_~j~0 0) (or (and (or (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v4~0))) (or (and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1))) (not (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))))) (= main_~l~0 0)) (= main_~i~0 0) (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (not (= main_~l~0 0))))} is VALID [2022-04-08 04:12:11,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {230#(and (= main_~k~0 0) (= main_~j~0 0) (or (and (or (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v4~0))) (or (and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1))) (not (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))))) (= main_~l~0 0)) (= main_~i~0 0) (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (not (= main_~l~0 0))))} [69] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {231#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (or (= main_~l~0 0) (and (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-08 04:12:11,222 INFO L272 TraceCheckUtils]: 9: Hoare triple {231#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (or (= main_~l~0 0) (and (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:12:11,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {232#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {233#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:12:11,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {233#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {225#false} is VALID [2022-04-08 04:12:11,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-08 04:12:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:12:11,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:12:11,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965273790] [2022-04-08 04:12:11,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965273790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:12:11,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:12:11,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:12:11,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:12:11,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [8032245] [2022-04-08 04:12:11,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [8032245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:12:11,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:12:11,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 04:12:11,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331356908] [2022-04-08 04:12:11,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:12:11,468 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-08 04:12:11,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:12:11,469 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-08 04:12:11,483 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-08 04:12:11,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 04:12:11,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:12:11,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 04:12:11,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-08 04:12:11,484 INFO L87 Difference]: Start difference. First operand 19 states and 22 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-08 04:12:13,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:12:16,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:12:16,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:12:16,303 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-08 04:12:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 04:12:16,303 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-08 04:12:16,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:12:16,304 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-08 04:12:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2022-04-08 04:12:16,305 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-08 04:12:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2022-04-08 04:12:16,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 46 transitions. [2022-04-08 04:12:16,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:12:16,350 INFO L225 Difference]: With dead ends: 37 [2022-04-08 04:12:16,350 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 04:12:16,350 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-04-08 04:12:16,351 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-08 04:12:16,352 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 42 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 82 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-04-08 04:12:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 04:12:16,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-04-08 04:12:16,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:12:16,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:12:16,360 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:12:16,360 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:12:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:12:16,362 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-08 04:12:16,362 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-08 04:12:16,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:12:16,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:12:16,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 24 states. [2022-04-08 04:12:16,379 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 24 states. [2022-04-08 04:12:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:12:16,387 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-08 04:12:16,387 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-08 04:12:16,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:12:16,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:12:16,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:12:16,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:12:16,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:12:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-08 04:12:16,391 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 15 [2022-04-08 04:12:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:12:16,391 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-08 04:12:16,392 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-08 04:12:16,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 25 transitions. [2022-04-08 04:12:16,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:12:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-08 04:12:16,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 04:12:16,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:12:16,458 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:12:16,458 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:12:16,458 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:12:16,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:12:16,459 INFO L85 PathProgramCache]: Analyzing trace with hash 943455295, now seen corresponding path program 1 times [2022-04-08 04:12:16,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:12:16,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [565308788] [2022-04-08 04:12:17,243 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 04:14:41,488 WARN L232 SmtUtils]: Spent 2.28m on a formula simplification. DAG size of input: 105 DAG size of output: 102 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-08 04:14:45,866 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:14:50,336 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:14:52,554 WARN L1034 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains relation itself. [2022-04-08 04:14:56,994 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-08 04:17:31,688 WARN L232 SmtUtils]: Spent 2.40m on a formula simplification. DAG size of input: 105 DAG size of output: 103 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-08 04:17:31,724 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:17:31,732 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:17:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1276973435, now seen corresponding path program 1 times [2022-04-08 04:17:31,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:17:31,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852693426] [2022-04-08 04:17:31,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:17:31,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:17:31,822 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (- 4294967295)) (- 3)) (* (- 1) (div (+ main_~l~0_7 (* (- 4294967296) .aux_div_v_it_3_42.1) (- 2)) 3)) (- 1)) 0) [2022-04-08 04:17:31,822 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_7 (* (- 4294967296) .aux_div_v_it_3_42.1) (- 2)) 3)) 1431655765) 0) [2022-04-08 04:17:31,822 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (- 4294967295)) (- 3)) (* (- 1) (div (+ main_~l~0_7 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (* (- 4294967296) .aux_div_v_it_3_42.1) (- 4294967295)) 3)) (- 1)) 0) [2022-04-08 04:17:31,822 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~i~0_9) (* (- 1) main_~l~0_7)) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (- 4294967296)) 3)) (- 1)) 0) [2022-04-08 04:17:31,822 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~i~0_9) (* (- 1) main_~l~0_7)) (- 3)) 0) [2022-04-08 04:17:31,822 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) 2) 0) [2022-04-08 04:17:31,823 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~i~0_9) (* (- 1) main_~l~0_7)) (- 3)) (* (- 1) (div (+ main_~l~0_7 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (* (- 4294967296) .aux_div_v_it_3_42.1) (- 4294967295)) 3)) (- 1)) 0) [2022-04-08 04:17:31,823 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~i~0_9) (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) 1) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (- 4294967296)) 3)) (- 1)) 0) [2022-04-08 04:17:31,823 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (- 4294967295)) (- 3)) 0) [2022-04-08 04:17:31,823 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~l~0_7) (* (- 1) main_~i~0_9) 1) 0)) [2022-04-08 04:17:31,823 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~l~0_7) 4294967295) 0) [2022-04-08 04:17:31,823 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~i~0_9) (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) 1) (- 3)) 0) [2022-04-08 04:17:31,823 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (- 4294967295)) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (- 4294967296)) 3)) (- 1)) 0) [2022-04-08 04:17:31,823 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_7 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (* (- 4294967296) .aux_div_v_it_3_42.1) (- 4294967295)) 3)) 1431655765) 0) [2022-04-08 04:17:31,823 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~i~0_9) (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) 1) (- 3)) (* (- 1) (div (+ main_~l~0_7 (* (- 4294967296) .aux_div_v_it_3_42.1) (- 2)) 3)) (- 1)) 0) [2022-04-08 04:17:31,823 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) 4294967296) 0) [2022-04-08 04:17:31,824 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (- 4294967296)) 3)) 1431655765) 0) [2022-04-08 04:17:31,824 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~i~0_9) (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) 1) (- 3)) (* (- 1) (div (+ main_~l~0_7 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (* (- 4294967296) .aux_div_v_it_3_42.1) (- 4294967295)) 3)) (- 1)) 0) [2022-04-08 04:17:31,824 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~i~0_9) (* (- 1) main_~l~0_7)) (- 3)) (* (- 1) (div (+ main_~l~0_7 (* (- 4294967296) .aux_div_v_it_3_42.1) (- 2)) 3)) (- 1)) 0) [2022-04-08 04:17:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:17:32,048 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) (- 4294967295)) (- 3)) (* (- 1) (div (+ main_~l~0_7 (* (- 4294967296) .aux_div_v_it_3_42.5) (- 2)) 3)) (- 1)) 0) [2022-04-08 04:17:32,049 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_7 (* (- 4294967296) .aux_div_v_it_3_42.5) (- 2)) 3)) 1431655765) 0) [2022-04-08 04:17:32,049 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) (- 4294967295)) (- 3)) (* (- 1) (div (+ main_~l~0_7 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) (* (- 4294967296) .aux_div_v_it_3_42.5) (- 4294967295)) 3)) (- 1)) 0) [2022-04-08 04:17:32,049 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.5) (* (- 1) main_~i~0_9) (* (- 1) main_~l~0_7)) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) (- 4294967296)) 3)) (- 1)) 0) [2022-04-08 04:17:32,049 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.5) (* (- 1) main_~i~0_9) (* (- 1) main_~l~0_7)) (- 3)) 0) [2022-04-08 04:17:32,049 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) 2) 0) [2022-04-08 04:17:32,049 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.5) (* (- 1) main_~i~0_9) (* (- 1) main_~l~0_7)) (- 3)) (* (- 1) (div (+ main_~l~0_7 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) (* (- 4294967296) .aux_div_v_it_3_42.5) (- 4294967295)) 3)) (- 1)) 0) [2022-04-08 04:17:32,049 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.5) (* (- 1) main_~i~0_9) (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) 1) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) (- 4294967296)) 3)) (- 1)) 0) [2022-04-08 04:17:32,049 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) (- 4294967295)) (- 3)) 0) [2022-04-08 04:17:32,049 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.5) (* (- 1) main_~l~0_7) (* (- 1) main_~i~0_9) 1) 0)) [2022-04-08 04:17:32,050 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_3_42.5) (* (- 1) main_~l~0_7) 4294967295) 0) [2022-04-08 04:17:32,050 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.5) (* (- 1) main_~i~0_9) (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) 1) (- 3)) 0) [2022-04-08 04:17:32,050 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) (- 4294967295)) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) (- 4294967296)) 3)) (- 1)) 0) [2022-04-08 04:17:32,050 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_7 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) (* (- 4294967296) .aux_div_v_it_3_42.5) (- 4294967295)) 3)) 1431655765) 0) [2022-04-08 04:17:32,050 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.5) (* (- 1) main_~i~0_9) (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) 1) (- 3)) (* (- 1) (div (+ main_~l~0_7 (* (- 4294967296) .aux_div_v_it_3_42.5) (- 2)) 3)) (- 1)) 0) [2022-04-08 04:17:32,050 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) 4294967296) 0) [2022-04-08 04:17:32,050 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) (- 4294967296)) 3)) 1431655765) 0) [2022-04-08 04:17:32,050 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.5) (* (- 1) main_~i~0_9) (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) 1) (- 3)) (* (- 1) (div (+ main_~l~0_7 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) (* (- 4294967296) .aux_div_v_it_3_42.5) (- 4294967295)) 3)) (- 1)) 0) [2022-04-08 04:17:32,050 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_5 (* 4294967296 .aux_div_v_it_3_42.5) (* (- 1) main_~i~0_9) (* (- 1) main_~l~0_7)) (- 3)) (* (- 1) (div (+ main_~l~0_7 (* (- 4294967296) .aux_div_v_it_3_42.5) (- 2)) 3)) (- 1)) 0) [2022-04-08 04:17:32,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:17:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:17:32,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {434#(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; {435#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 04:17:32,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {435#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 04:17:32,914 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {435#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {421#true} #66#return; {426#(and (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-08 04:17:32,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {421#true} call ULTIMATE.init(); {434#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:17:32,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#(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; {435#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 04:17:32,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {435#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 04:17:32,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {435#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {421#true} #66#return; {426#(and (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-08 04:17:32,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {426#(and (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (div ~SIZE~0 4294967296) 0))} call #t~ret5 := main(); {426#(and (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-08 04:17:32,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {426#(and (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (div ~SIZE~0 4294967296) 0))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {427#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 04:17:32,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {427#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {428#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 04:17:32,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [72] L21-2-->L21-3_primed: Formula: (let ((.cse0 (= v_main_~l~0_22 v_main_~l~0_21)) (.cse1 (= v_main_~v4~0_14 v_main_~v4~0_13)) (.cse3 (< (mod v_main_~l~0_22 4294967296) (mod v_main_~n~0_9 4294967296))) (.cse2 (= (mod v_main_~l~0_22 4) 0))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse0 (= v_main_~n~0_9 v_main_~n~0_9) .cse1) (and (= (+ v_main_~l~0_22 v_main_~v4~0_13) (+ v_main_~l~0_21 v_main_~v4~0_14)) (< v_main_~v4~0_14 v_main_~v4~0_13) (< v_main_~v4~0_13 (+ v_main_~v4~0_14 2)) .cse3 .cse2))) InVars {main_~l~0=v_main_~l~0_22, main_~n~0=v_main_~n~0_9, main_~v4~0=v_main_~v4~0_14} OutVars{main_~l~0=v_main_~l~0_21, main_~n~0=v_main_~n~0_9, main_~v4~0=v_main_~v4~0_13} AuxVars[] AssignedVars[main_~l~0, main_~v4~0] {429#(and (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) main_~v4~0) (+ main_~n~0 (* (div (+ (- 1) main_~l~0) 4294967296) 4294967296) (* (div (+ (* (- 1) main_~l~0) (* (div (+ (- 1) main_~l~0) 4294967296) 4294967296) main_~v4~0) 4294967296) 4294967296) 1)) (<= 1 main_~v4~0)) (= main_~v4~0 0)) (= main_~k~0 0) (= main_~j~0 0) (<= (+ (* (div main_~l~0 4294967296) 1431655765) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 1431655765)) 0) (<= main_~l~0 (+ (* (div (+ (* (- 1) main_~v4~0) main_~l~0) 4294967296) 4294967296) main_~v4~0)) (= main_~i~0 0) (<= main_~v4~0 main_~l~0))} is VALID [2022-04-08 04:17:32,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {429#(and (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) main_~v4~0) (+ main_~n~0 (* (div (+ (- 1) main_~l~0) 4294967296) 4294967296) (* (div (+ (* (- 1) main_~l~0) (* (div (+ (- 1) main_~l~0) 4294967296) 4294967296) main_~v4~0) 4294967296) 4294967296) 1)) (<= 1 main_~v4~0)) (= main_~v4~0 0)) (= main_~k~0 0) (= main_~j~0 0) (<= (+ (* (div main_~l~0 4294967296) 1431655765) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 1431655765)) 0) (<= main_~l~0 (+ (* (div (+ (* (- 1) main_~v4~0) main_~l~0) 4294967296) 4294967296) main_~v4~0)) (= main_~i~0 0) (<= main_~v4~0 main_~l~0))} [73] L21-3_primed-->L21-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {429#(and (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) main_~v4~0) (+ main_~n~0 (* (div (+ (- 1) main_~l~0) 4294967296) 4294967296) (* (div (+ (* (- 1) main_~l~0) (* (div (+ (- 1) main_~l~0) 4294967296) 4294967296) main_~v4~0) 4294967296) 4294967296) 1)) (<= 1 main_~v4~0)) (= main_~v4~0 0)) (= main_~k~0 0) (= main_~j~0 0) (<= (+ (* (div main_~l~0 4294967296) 1431655765) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 1431655765)) 0) (<= main_~l~0 (+ (* (div (+ (* (- 1) main_~v4~0) main_~l~0) 4294967296) 4294967296) main_~v4~0)) (= main_~i~0 0) (<= main_~v4~0 main_~l~0))} is VALID [2022-04-08 04:17:32,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {429#(and (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) main_~v4~0) (+ main_~n~0 (* (div (+ (- 1) main_~l~0) 4294967296) 4294967296) (* (div (+ (* (- 1) main_~l~0) (* (div (+ (- 1) main_~l~0) 4294967296) 4294967296) main_~v4~0) 4294967296) 4294967296) 1)) (<= 1 main_~v4~0)) (= main_~v4~0 0)) (= main_~k~0 0) (= main_~j~0 0) (<= (+ (* (div main_~l~0 4294967296) 1431655765) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 1431655765)) 0) (<= main_~l~0 (+ (* (div (+ (* (- 1) main_~v4~0) main_~l~0) 4294967296) 4294967296) main_~v4~0)) (= main_~i~0 0) (<= main_~v4~0 main_~l~0))} [74] L21-2-->L21-3_primed: Formula: (let ((.cse24 (mod v_main_~l~0_24 4294967296)) (.cse23 (mod v_main_~n~0_10 4294967296))) (let ((.cse0 (= v_main_~l~0_24 v_main_~l~0_23)) (.cse3 (< .cse24 .cse23)) (.cse20 (= (mod v_main_~l~0_24 4) 0)) (.cse2 (= (mod (mod .cse24 3) 4294967296) 0)) (.cse1 (= v_main_~i~0_7 v_main_~i~0_6))) (or (and .cse0 (= v_main_~n~0_10 v_main_~n~0_10) .cse1) (let ((.cse19 (< v_main_~i~0_6 (+ v_main_~i~0_7 2))) (.cse21 (* (- 1) v_main_~i~0_6)) (.cse22 (* v_main_~l~0_24 (- 1)))) (and .cse2 .cse3 (or (forall ((aux_div_aux_mod_aux_mod_v_it_3_42_25_45 Int) (aux_div_v_it_3_42 Int)) (let ((.cse17 (* aux_div_aux_mod_aux_mod_v_it_3_42_25_45 (- 4294967296))) (.cse18 (* aux_div_v_it_3_42 (- 4294967296)))) (let ((.cse6 (div (+ v_main_~l~0_24 (- 2) .cse18) 3)) (.cse13 (div (+ v_main_~l~0_24 .cse17 (- 4294967295) .cse18) 3)) (.cse12 (* aux_div_v_it_3_42 4294967296)) (.cse15 (* (- 1) v_main_~i~0_6)) (.cse16 (* v_main_~l~0_24 (- 1))) (.cse14 (div (+ .cse17 (- 4294967296)) 3)) (.cse10 (* aux_div_aux_mod_aux_mod_v_it_3_42_25_45 4294967296))) (let ((.cse4 (div (+ (- 4294967295) .cse10) (- 3))) (.cse9 (+ .cse14 1)) (.cse11 (div (+ v_main_~i~0_7 .cse12 .cse15 .cse16 .cse10 1) (- 3))) (.cse7 (+ .cse13 1)) (.cse8 (div (+ v_main_~i~0_7 .cse12 .cse15 .cse16) (- 3))) (.cse5 (+ .cse6 1))) (or (<= .cse4 .cse5) (<= 1431655765 .cse6) (<= .cse4 .cse7) (<= .cse8 .cse9) (<= .cse8 0) (<= 2 .cse10) (<= .cse8 .cse7) (<= .cse11 .cse9) (<= .cse4 0) (< (+ v_main_~l~0_24 v_main_~i~0_6) (+ v_main_~i~0_7 .cse12 1)) (<= (+ 4294967295 .cse12) v_main_~l~0_24) (<= .cse11 0) (<= .cse4 .cse9) (<= 1431655765 .cse13) (<= .cse11 .cse5) (<= (+ 4294967296 .cse10) 0) (<= 1431655765 .cse14) (<= .cse11 .cse7) (<= .cse8 .cse5)))))) .cse19) (not .cse20) (< v_main_~i~0_7 v_main_~i~0_6) (< (div (+ v_main_~i~0_7 .cse21 .cse22) (- 4)) (+ 2 (div v_main_~l~0_24 4))) (or .cse19 (<= (div (+ .cse23 v_main_~i~0_7 .cse21 .cse22) (- 4294967296)) (+ (div (+ v_main_~l~0_24 (- 4294967295)) 4294967296) 1))) (= (+ v_main_~l~0_24 v_main_~i~0_6) (+ v_main_~l~0_23 v_main_~i~0_7)))) (and .cse0 (or (not .cse3) .cse20 (not .cse2)) .cse1)))) InVars {main_~i~0=v_main_~i~0_7, main_~l~0=v_main_~l~0_24, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_23, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[main_~l~0, main_~i~0] {430#(and (= main_~k~0 0) (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296) main_~v4~0) (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))))) (= main_~j~0 0) (= main_~i~0 0) (not (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))))))} is VALID [2022-04-08 04:17:32,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {430#(and (= main_~k~0 0) (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296) main_~v4~0) (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))))) (= main_~j~0 0) (= main_~i~0 0) (not (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))))))} [71] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {431#(and (<= (+ main_~i~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (not (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))))))} is VALID [2022-04-08 04:17:32,948 INFO L272 TraceCheckUtils]: 11: Hoare triple {431#(and (<= (+ main_~i~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (not (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))))))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:17:32,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {432#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {433#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:17:32,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {433#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {422#false} is VALID [2022-04-08 04:17:32,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {422#false} assume !false; {422#false} is VALID [2022-04-08 04:17:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:17:32,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:17:32,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852693426] [2022-04-08 04:17:32,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852693426] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:17:32,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886179327] [2022-04-08 04:17:32,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:17:32,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:17:32,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:17:32,951 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:17:32,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 04:17:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:17:33,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 04:17:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:17:33,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:17:49,820 WARN L232 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 9 DAG size of output: 1 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-08 04:17:59,174 WARN L232 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 15 DAG size of output: 1 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-08 04:19:51,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {421#true} call ULTIMATE.init(); {421#true} is VALID [2022-04-08 04:19:51,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {421#true} is VALID [2022-04-08 04:19:51,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {421#true} assume true; {421#true} is VALID [2022-04-08 04:19:51,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {421#true} {421#true} #66#return; {421#true} is VALID [2022-04-08 04:19:51,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {421#true} call #t~ret5 := main(); {421#true} is VALID [2022-04-08 04:19:51,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {421#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {428#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 04:19:51,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {428#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 04:19:51,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [72] L21-2-->L21-3_primed: Formula: (let ((.cse0 (= v_main_~l~0_22 v_main_~l~0_21)) (.cse1 (= v_main_~v4~0_14 v_main_~v4~0_13)) (.cse3 (< (mod v_main_~l~0_22 4294967296) (mod v_main_~n~0_9 4294967296))) (.cse2 (= (mod v_main_~l~0_22 4) 0))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse0 (= v_main_~n~0_9 v_main_~n~0_9) .cse1) (and (= (+ v_main_~l~0_22 v_main_~v4~0_13) (+ v_main_~l~0_21 v_main_~v4~0_14)) (< v_main_~v4~0_14 v_main_~v4~0_13) (< v_main_~v4~0_13 (+ v_main_~v4~0_14 2)) .cse3 .cse2))) InVars {main_~l~0=v_main_~l~0_22, main_~n~0=v_main_~n~0_9, main_~v4~0=v_main_~v4~0_14} OutVars{main_~l~0=v_main_~l~0_21, main_~n~0=v_main_~n~0_9, main_~v4~0=v_main_~v4~0_13} AuxVars[] AssignedVars[main_~l~0, main_~v4~0] {460#(and (= main_~k~0 0) (or (and (= main_~l~0 main_~v4~0) (< main_~v4~0 2) (< 0 main_~v4~0) (< 0 (mod main_~n~0 4294967296))) (and (= main_~l~0 0) (= main_~v4~0 0))) (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-08 04:19:51,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {460#(and (= main_~k~0 0) (or (and (= main_~l~0 main_~v4~0) (< main_~v4~0 2) (< 0 main_~v4~0) (< 0 (mod main_~n~0 4294967296))) (and (= main_~l~0 0) (= main_~v4~0 0))) (= main_~j~0 0) (= main_~i~0 0))} [73] L21-3_primed-->L21-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#(and (= main_~k~0 0) (or (and (= main_~l~0 main_~v4~0) (< main_~v4~0 2) (< 0 main_~v4~0) (< 0 (mod main_~n~0 4294967296))) (and (= main_~l~0 0) (= main_~v4~0 0))) (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-08 04:19:54,037 WARN L290 TraceCheckUtils]: 9: Hoare triple {460#(and (= main_~k~0 0) (or (and (= main_~l~0 main_~v4~0) (< main_~v4~0 2) (< 0 main_~v4~0) (< 0 (mod main_~n~0 4294967296))) (and (= main_~l~0 0) (= main_~v4~0 0))) (= main_~j~0 0) (= main_~i~0 0))} [74] L21-2-->L21-3_primed: Formula: (let ((.cse24 (mod v_main_~l~0_24 4294967296)) (.cse23 (mod v_main_~n~0_10 4294967296))) (let ((.cse0 (= v_main_~l~0_24 v_main_~l~0_23)) (.cse3 (< .cse24 .cse23)) (.cse20 (= (mod v_main_~l~0_24 4) 0)) (.cse2 (= (mod (mod .cse24 3) 4294967296) 0)) (.cse1 (= v_main_~i~0_7 v_main_~i~0_6))) (or (and .cse0 (= v_main_~n~0_10 v_main_~n~0_10) .cse1) (let ((.cse19 (< v_main_~i~0_6 (+ v_main_~i~0_7 2))) (.cse21 (* (- 1) v_main_~i~0_6)) (.cse22 (* v_main_~l~0_24 (- 1)))) (and .cse2 .cse3 (or (forall ((aux_div_aux_mod_aux_mod_v_it_3_42_25_45 Int) (aux_div_v_it_3_42 Int)) (let ((.cse17 (* aux_div_aux_mod_aux_mod_v_it_3_42_25_45 (- 4294967296))) (.cse18 (* aux_div_v_it_3_42 (- 4294967296)))) (let ((.cse6 (div (+ v_main_~l~0_24 (- 2) .cse18) 3)) (.cse13 (div (+ v_main_~l~0_24 .cse17 (- 4294967295) .cse18) 3)) (.cse12 (* aux_div_v_it_3_42 4294967296)) (.cse15 (* (- 1) v_main_~i~0_6)) (.cse16 (* v_main_~l~0_24 (- 1))) (.cse14 (div (+ .cse17 (- 4294967296)) 3)) (.cse10 (* aux_div_aux_mod_aux_mod_v_it_3_42_25_45 4294967296))) (let ((.cse4 (div (+ (- 4294967295) .cse10) (- 3))) (.cse9 (+ .cse14 1)) (.cse11 (div (+ v_main_~i~0_7 .cse12 .cse15 .cse16 .cse10 1) (- 3))) (.cse7 (+ .cse13 1)) (.cse8 (div (+ v_main_~i~0_7 .cse12 .cse15 .cse16) (- 3))) (.cse5 (+ .cse6 1))) (or (<= .cse4 .cse5) (<= 1431655765 .cse6) (<= .cse4 .cse7) (<= .cse8 .cse9) (<= .cse8 0) (<= 2 .cse10) (<= .cse8 .cse7) (<= .cse11 .cse9) (<= .cse4 0) (< (+ v_main_~l~0_24 v_main_~i~0_6) (+ v_main_~i~0_7 .cse12 1)) (<= (+ 4294967295 .cse12) v_main_~l~0_24) (<= .cse11 0) (<= .cse4 .cse9) (<= 1431655765 .cse13) (<= .cse11 .cse5) (<= (+ 4294967296 .cse10) 0) (<= 1431655765 .cse14) (<= .cse11 .cse7) (<= .cse8 .cse5)))))) .cse19) (not .cse20) (< v_main_~i~0_7 v_main_~i~0_6) (< (div (+ v_main_~i~0_7 .cse21 .cse22) (- 4)) (+ 2 (div v_main_~l~0_24 4))) (or .cse19 (<= (div (+ .cse23 v_main_~i~0_7 .cse21 .cse22) (- 4294967296)) (+ (div (+ v_main_~l~0_24 (- 4294967295)) 4294967296) 1))) (= (+ v_main_~l~0_24 v_main_~i~0_6) (+ v_main_~l~0_23 v_main_~i~0_7)))) (and .cse0 (or (not .cse3) .cse20 (not .cse2)) .cse1)))) InVars {main_~i~0=v_main_~i~0_7, main_~l~0=v_main_~l~0_24, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_23, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[main_~l~0, main_~i~0] {467#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (or (and (= main_~l~0 0) (= main_~v4~0 0)) (and (= main_~l~0 main_~v4~0) (< main_~v4~0 2) (< 0 main_~v4~0))))} is UNKNOWN [2022-04-08 04:19:54,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {467#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (or (and (= main_~l~0 0) (= main_~v4~0 0)) (and (= main_~l~0 main_~v4~0) (< main_~v4~0 2) (< 0 main_~v4~0))))} [71] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {467#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (or (and (= main_~l~0 0) (= main_~v4~0 0)) (and (= main_~l~0 main_~v4~0) (< main_~v4~0 2) (< 0 main_~v4~0))))} is VALID [2022-04-08 04:19:54,045 INFO L272 TraceCheckUtils]: 11: Hoare triple {467#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (or (and (= main_~l~0 0) (= main_~v4~0 0)) (and (= main_~l~0 main_~v4~0) (< main_~v4~0 2) (< 0 main_~v4~0))))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {474#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:19:54,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {474#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {478#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:19:54,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {478#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {422#false} is VALID [2022-04-08 04:19:54,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {422#false} assume !false; {422#false} is VALID [2022-04-08 04:19:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:19:54,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:21:07,469 WARN L232 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 8 DAG size of output: 1 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-08 04:23:09,349 WARN L232 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 7 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-08 04:23:50,883 WARN L232 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-08 04:24:13,090 WARN L232 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 28 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-08 04:25:05,470 WARN L232 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 23 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-08 04:25:40,453 WARN L232 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 21 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)