/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:13:28,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:13:28,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:13:28,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:13:28,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:13:28,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:13:28,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:13:28,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:13:28,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:13:28,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:13:28,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:13:28,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:13:28,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:13:28,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:13:28,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:13:28,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:13:28,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:13:28,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:13:28,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:13:28,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:13:28,460 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:13:28,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:13:28,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:13:28,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:13:28,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:13:28,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:13:28,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:13:28,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:13:28,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:13:28,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:13:28,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:13:28,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:13:28,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:13:28,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:13:28,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:13:28,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:13:28,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:13:28,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:13:28,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:13:28,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:13:28,472 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:13:28,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:13:28,474 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:13:28,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:13:28,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:13:28,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:13:28,481 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:13:28,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:13:28,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:13:28,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:13:28,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:13:28,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:13:28,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:13:28,482 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:13:28,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:13:28,482 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:13:28,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:13:28,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:13:28,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:13:28,482 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:13:28,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:13:28,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:13:28,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:13:28,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:13:28,483 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:13:28,483 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:13:28,483 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:13:28,483 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:13:28,483 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:13:28,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:13:28,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:13:28,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:13:28,692 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:13:28,693 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:13:28,694 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c [2022-04-08 04:13:28,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d05b8272/06ddb749d7374fc4a2e10dcf2f7438f0/FLAGa91f58a78 [2022-04-08 04:13:29,098 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:13:29,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt5.c [2022-04-08 04:13:29,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d05b8272/06ddb749d7374fc4a2e10dcf2f7438f0/FLAGa91f58a78 [2022-04-08 04:13:29,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d05b8272/06ddb749d7374fc4a2e10dcf2f7438f0 [2022-04-08 04:13:29,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:13:29,114 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:13:29,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:13:29,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:13:29,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:13:29,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:13:29" (1/1) ... [2022-04-08 04:13:29,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e711860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:13:29, skipping insertion in model container [2022-04-08 04:13:29,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:13:29" (1/1) ... [2022-04-08 04:13:29,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:13:29,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:13:29,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt5.c[403,416] [2022-04-08 04:13:29,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:13:29,323 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:13:29,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/sumt5.c[403,416] [2022-04-08 04:13:29,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:13:29,361 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:13:29,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:13:29 WrapperNode [2022-04-08 04:13:29,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:13:29,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:13:29,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:13:29,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:13:29,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:13:29" (1/1) ... [2022-04-08 04:13:29,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:13:29" (1/1) ... [2022-04-08 04:13:29,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:13:29" (1/1) ... [2022-04-08 04:13:29,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:13:29" (1/1) ... [2022-04-08 04:13:29,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:13:29" (1/1) ... [2022-04-08 04:13:29,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:13:29" (1/1) ... [2022-04-08 04:13:29,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:13:29" (1/1) ... [2022-04-08 04:13:29,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:13:29,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:13:29,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:13:29,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:13:29,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:13:29" (1/1) ... [2022-04-08 04:13:29,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:13:29,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:13:29,420 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:13:29,421 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:13:29,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:13:29,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:13:29,448 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:13:29,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:13:29,448 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:13:29,448 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:13:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:13:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:13:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:13:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:13:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:13:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:13:29,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 04:13:29,449 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:13:29,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:13:29,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:13:29,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:13:29,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:13:29,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:13:29,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:13:29,490 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:13:29,491 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:13:34,023 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:13:34,028 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:13:34,028 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:13:34,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:13:34 BoogieIcfgContainer [2022-04-08 04:13:34,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:13:34,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:13:34,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:13:34,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:13:34,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:13:29" (1/3) ... [2022-04-08 04:13:34,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ad273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:13:34, skipping insertion in model container [2022-04-08 04:13:34,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:13:29" (2/3) ... [2022-04-08 04:13:34,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ad273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:13:34, skipping insertion in model container [2022-04-08 04:13:34,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:13:34" (3/3) ... [2022-04-08 04:13:34,034 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt5.c [2022-04-08 04:13:34,038 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:13:34,038 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:13:34,065 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:13:34,070 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:13:34,070 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:13:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:13:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 04:13:34,087 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:13:34,088 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:13:34,088 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:13:34,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:13:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1530412705, now seen corresponding path program 1 times [2022-04-08 04:13:34,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:13:34,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [787157400] [2022-04-08 04:13:34,107 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:13:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1530412705, now seen corresponding path program 2 times [2022-04-08 04:13:34,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:13:34,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382122810] [2022-04-08 04:13:34,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:13:34,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:13:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:13:34,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:13:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:13:34,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {28#true} is VALID [2022-04-08 04:13:34,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-08 04:13:34,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #71#return; {28#true} is VALID [2022-04-08 04:13:34,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {36#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:13:34,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {28#true} is VALID [2022-04-08 04:13:34,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-08 04:13:34,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #71#return; {28#true} is VALID [2022-04-08 04:13:34,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret5 := main(); {28#true} is VALID [2022-04-08 04:13:34,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:13:34,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:13:34,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:13:34,665 INFO L272 TraceCheckUtils]: 8: Hoare triple {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {34#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:13:34,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {35#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:13:34,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29#false} is VALID [2022-04-08 04:13:34,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-08 04:13:34,667 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:13:34,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:13:34,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382122810] [2022-04-08 04:13:34,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382122810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:13:34,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:13:34,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:13:34,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:13:34,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [787157400] [2022-04-08 04:13:34,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [787157400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:13:34,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:13:34,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:13:34,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589003245] [2022-04-08 04:13:34,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:13:34,676 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:13:34,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:13:34,680 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:13:34,695 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:13:34,696 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:13:34,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:13:34,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:13:34,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:13:34,714 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:13:36,888 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:13:41,346 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:13:43,510 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:13:45,693 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:13:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:13:46,079 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-04-08 04:13:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 04:13:46,080 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:13:46,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:13:46,091 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:13:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-08 04:13:46,098 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:13:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-08 04:13:46,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-08 04:13:46,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:13:46,163 INFO L225 Difference]: With dead ends: 47 [2022-04-08 04:13:46,163 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 04:13:46,165 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:13:46,167 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:13:46,168 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 46 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 4 Unknown, 0 Unchecked, 8.5s Time] [2022-04-08 04:13:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 04:13:46,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-08 04:13:46,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:13:46,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:13:46,188 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:13:46,189 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:13:46,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:13:46,191 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-08 04:13:46,191 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-08 04:13:46,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:13:46,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:13:46,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-08 04:13:46,193 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-08 04:13:46,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:13:46,195 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-08 04:13:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-08 04:13:46,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:13:46,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:13:46,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:13:46,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:13:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:13:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-04-08 04:13:46,199 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-04-08 04:13:46,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:13:46,199 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-04-08 04:13:46,200 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:13:46,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 23 transitions. [2022-04-08 04:13:46,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:13:46,226 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-08 04:13:46,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 04:13:46,226 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:13:46,226 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:13:46,226 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:13:46,227 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:13:46,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:13:46,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1637920365, now seen corresponding path program 1 times [2022-04-08 04:13:46,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:13:46,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1178267791] [2022-04-08 04:15:18,286 WARN L232 SmtUtils]: Spent 1.30m on a formula simplification. DAG size of input: 94 DAG size of output: 92 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-08 04:15:22,585 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:15:26,948 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:15:29,097 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-08 04:16:47,360 WARN L232 SmtUtils]: Spent 1.07m on a formula simplification. DAG size of input: 94 DAG size of output: 85 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-08 04:16:47,399 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:16:47,406 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:16:47,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1749993697, now seen corresponding path program 1 times [2022-04-08 04:16:47,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:16:47,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171707400] [2022-04-08 04:16:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:16:47,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:16:47,449 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) 4294967296) 0) [2022-04-08 04:16:47,449 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 5)) 0) [2022-04-08 04:16:47,449 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 5)) (- 1)) 0) [2022-04-08 04:16:47,449 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.0)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 4)) 5)) (- 1)) 0) [2022-04-08 04:16:47,449 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 5)) (- 1)) 0) [2022-04-08 04:16:47,450 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 5)) 858993459) 0) [2022-04-08 04:16:47,450 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 4)) 5)) (- 1)) 0) [2022-04-08 04:16:47,450 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.0)) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 5)) (- 1)) 0) [2022-04-08 04:16:47,450 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) 4) 0) [2022-04-08 04:16:47,450 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 5)) 858993459) 0) [2022-04-08 04:16:47,450 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 4)) 5)) 858993459) 0) [2022-04-08 04:16:47,450 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.0)) (- 5)) 0) [2022-04-08 04:16:47,450 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_1_42.0) (* (- 1) main_~l~0_7) 1) 0)) [2022-04-08 04:16:47,450 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.0)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 5)) (- 1)) 0) [2022-04-08 04:16:47,450 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_1_42.0) (* (- 1) main_~l~0_5) 4294967295) 0) [2022-04-08 04:16:47,451 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 4)) 5)) (- 1)) 0) [2022-04-08 04:16:47,451 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 5)) (- 1)) 0) [2022-04-08 04:16:47,451 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 5)) 0) [2022-04-08 04:16:47,452 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 5)) (- 1)) 0) [2022-04-08 04:16:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:47,501 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) 4294967296) 0) [2022-04-08 04:16:47,502 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (* 4294967296 .aux_div_v_it_1_42.2) 1) (- 5)) 0) [2022-04-08 04:16:47,502 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (* 4294967296 .aux_div_v_it_1_42.2) 1) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) 5)) (- 1)) 0) [2022-04-08 04:16:47,502 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.2)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (- 4)) 5)) (- 1)) 0) [2022-04-08 04:16:47,502 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) 5)) (- 1)) 0) [2022-04-08 04:16:47,502 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) 5)) 858993459) 0) [2022-04-08 04:16:47,502 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (* 4294967296 .aux_div_v_it_1_42.2) 1) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (- 4)) 5)) (- 1)) 0) [2022-04-08 04:16:47,502 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.2)) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967296)) 5)) (- 1)) 0) [2022-04-08 04:16:47,502 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) 4) 0) [2022-04-08 04:16:47,503 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967296)) 5)) 858993459) 0) [2022-04-08 04:16:47,503 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (- 4)) 5)) 858993459) 0) [2022-04-08 04:16:47,503 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.2)) (- 5)) 0) [2022-04-08 04:16:47,503 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_1_42.2) (* (- 1) main_~l~0_7) 1) 0)) [2022-04-08 04:16:47,503 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.2)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) 5)) (- 1)) 0) [2022-04-08 04:16:47,503 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_1_42.2) (* (- 1) main_~l~0_5) 4294967295) 0) [2022-04-08 04:16:47,503 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (- 4)) 5)) (- 1)) 0) [2022-04-08 04:16:47,503 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (* 4294967296 .aux_div_v_it_1_42.2) 1) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967296)) 5)) (- 1)) 0) [2022-04-08 04:16:47,504 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) (- 5)) 0) [2022-04-08 04:16:47,504 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967296)) 5)) (- 1)) 0) [2022-04-08 04:16:47,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:16:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:47,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {228#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {219#true} is VALID [2022-04-08 04:16:47,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} assume true; {219#true} is VALID [2022-04-08 04:16:47,906 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {219#true} {219#true} #71#return; {219#true} is VALID [2022-04-08 04:16:47,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {219#true} call ULTIMATE.init(); {228#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:16:47,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {219#true} is VALID [2022-04-08 04:16:47,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} assume true; {219#true} is VALID [2022-04-08 04:16:47,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {219#true} {219#true} #71#return; {219#true} is VALID [2022-04-08 04:16:47,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {219#true} call #t~ret5 := main(); {219#true} is VALID [2022-04-08 04:16:47,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:16:47,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:16:47,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [75] L21-2-->L21-3_primed: Formula: (let ((.cse18 (mod v_main_~l~0_17 4294967296))) (let ((.cse0 (< .cse18 (mod v_main_~n~0_7 4294967296))) (.cse1 (= (mod (mod .cse18 5) 4294967296) 0)) (.cse2 (= v_main_~l~0_17 v_main_~l~0_16)) (.cse3 (= v_main_~v3~0_7 v_main_~v3~0_6))) (or (and (or (not .cse0) (not .cse1)) .cse2 .cse3) (and (or (forall ((aux_div_v_it_1_42 Int) (aux_div_aux_mod_aux_mod_v_it_1_42_25_45 Int)) (let ((.cse16 (* aux_div_v_it_1_42 (- 4294967296))) (.cse17 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296)))) (let ((.cse12 (div (+ .cse17 (- 4294967296)) 5)) (.cse4 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296)) (.cse13 (div (+ v_main_~l~0_17 .cse16 (- 4)) 5)) (.cse10 (div (+ v_main_~l~0_17 .cse16 .cse17 (- 4294967295)) 5)) (.cse15 (* v_main_~l~0_16 (- 1))) (.cse14 (* aux_div_v_it_1_42 4294967296))) (let ((.cse7 (div (+ .cse15 .cse14) (- 5))) (.cse6 (+ 1 .cse10)) (.cse8 (+ .cse13 1)) (.cse5 (div (+ .cse15 .cse4 .cse14 1) (- 5))) (.cse9 (div (+ .cse4 (- 4294967295)) (- 5))) (.cse11 (+ .cse12 1))) (or (<= (+ .cse4 4294967296) 0) (<= .cse5 0) (<= .cse5 .cse6) (<= .cse7 .cse8) (<= .cse9 .cse6) (<= 858993459 .cse10) (<= .cse5 .cse8) (<= .cse7 .cse11) (<= 4 .cse4) (<= 858993459 .cse12) (<= 858993459 .cse13) (<= .cse7 0) (< v_main_~l~0_16 (+ .cse14 1)) (<= .cse7 .cse6) (<= (+ 4294967295 .cse14) v_main_~l~0_17) (<= .cse9 .cse8) (<= .cse5 .cse11) (<= .cse9 0) (<= .cse9 .cse11)))))) (< v_main_~l~0_16 (+ v_main_~l~0_17 2))) .cse0 .cse1 (< v_main_~l~0_17 v_main_~l~0_16) (= (+ v_main_~l~0_16 v_main_~v3~0_7) (+ v_main_~l~0_17 v_main_~v3~0_6))) (and .cse2 .cse3 (= v_main_~n~0_7 v_main_~n~0_7))))) InVars {main_~l~0=v_main_~l~0_17, main_~v3~0=v_main_~v3~0_7, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_6, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~l~0, main_~v3~0] {225#(and (= main_~k~0 0) (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)) (= main_~j~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0 1)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v3~0))} is VALID [2022-04-08 04:16:47,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {225#(and (= main_~k~0 0) (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)) (= main_~j~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0 1)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v3~0))} [74] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {225#(and (= main_~k~0 0) (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)) (= main_~j~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0 1)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v3~0))} is VALID [2022-04-08 04:16:47,916 INFO L272 TraceCheckUtils]: 9: Hoare triple {225#(and (= main_~k~0 0) (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)) (= main_~j~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0 1)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v3~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {226#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:16:47,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {226#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {227#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:16:47,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {227#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {220#false} is VALID [2022-04-08 04:16:47,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {220#false} assume !false; {220#false} is VALID [2022-04-08 04:16:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:16:47,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:16:47,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171707400] [2022-04-08 04:16:47,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171707400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:47,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:47,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 04:17:10,645 WARN L232 SmtUtils]: Spent 19.35s on a formula simplification. DAG size of input: 84 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 04:17:10,689 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:17:10,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1178267791] [2022-04-08 04:17:10,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1178267791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:17:10,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:17:10,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 04:17:10,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918326827] [2022-04-08 04:17:10,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:17:10,691 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:17:10,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:17:10,691 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:17:12,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 04:17:12,857 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 04:17:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:17:12,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 04:17:12,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=83, Unknown=1, NotChecked=0, Total=110 [2022-04-08 04:17:12,858 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:17:15,137 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:17:19,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:17:21,872 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:17:24,044 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:17:26,216 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:17:34,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:17:37,151 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:17:39,501 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:17:41,671 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:17:43,850 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:17:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:17:44,060 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-04-08 04:17:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 04:17:44,060 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:17:44,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:17:44,061 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:17:44,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-08 04:17:44,065 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:17:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-08 04:17:44,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-08 04:17:44,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:17:44,128 INFO L225 Difference]: With dead ends: 40 [2022-04-08 04:17:44,128 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 04:17:44,128 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=76, Invalid=265, Unknown=1, NotChecked=0, Total=342 [2022-04-08 04:17:44,129 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2022-04-08 04:17:44,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 10 Unknown, 5 Unchecked, 21.4s Time] [2022-04-08 04:17:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 04:17:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-04-08 04:17:44,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:17:44,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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:17:44,142 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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:17:44,142 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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:17:44,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:17:44,144 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2022-04-08 04:17:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-04-08 04:17:44,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:17:44,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:17:44,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-08 04:17:44,145 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-08 04:17:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:17:44,147 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2022-04-08 04:17:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-04-08 04:17:44,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:17:44,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:17:44,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:17:44,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:17:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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:17:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-08 04:17:44,149 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 15 [2022-04-08 04:17:44,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:17:44,149 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-08 04:17:44,150 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:17:44,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-08 04:17:44,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:17:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 04:17:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 04:17:44,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:17:44,183 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:17:44,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:17:44,183 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:17:44,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:17:44,184 INFO L85 PathProgramCache]: Analyzing trace with hash -469553554, now seen corresponding path program 1 times [2022-04-08 04:17:44,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:17:44,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [504797911] [2022-04-08 04:21:42,676 WARN L232 SmtUtils]: Spent 3.75m on a formula simplification. DAG size of input: 76 DAG size of output: 34 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-08 04:21:47,034 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:21:51,480 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:21:53,732 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-08 04:24:33,022 WARN L232 SmtUtils]: Spent 2.39m on a formula simplification. DAG size of input: 76 DAG size of output: 34 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-08 04:24:33,027 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:24:33,028 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:24:33,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1809099041, now seen corresponding path program 1 times [2022-04-08 04:24:33,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:24:33,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649440694] [2022-04-08 04:24:33,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:24:33,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:24:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:24:33,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:24:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:24:33,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {441#(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; {431#true} is VALID [2022-04-08 04:24:33,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-08 04:24:33,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {431#true} {431#true} #71#return; {431#true} is VALID [2022-04-08 04:24:33,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {431#true} call ULTIMATE.init(); {441#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:24:33,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#(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; {431#true} is VALID [2022-04-08 04:24:33,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-08 04:24:33,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {431#true} {431#true} #71#return; {431#true} is VALID [2022-04-08 04:24:33,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {431#true} call #t~ret5 := main(); {431#true} is VALID [2022-04-08 04:24:33,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {431#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {436#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:24:33,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {436#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {436#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:24:33,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {436#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [77] L21-2-->L21-3_primed: Formula: (let ((.cse5 (mod v_main_~l~0_24 4294967296))) (let ((.cse0 (= v_main_~v4~0_7 v_main_~v4~0_6)) (.cse1 (= v_main_~l~0_24 v_main_~l~0_23)) (.cse3 (= (mod v_main_~l~0_24 4) 0)) (.cse4 (= (mod (mod .cse5 5) 4294967296) 0)) (.cse2 (< .cse5 (mod v_main_~n~0_9 4294967296)))) (or (and .cse0 .cse1 (= v_main_~n~0_9 v_main_~n~0_9)) (and .cse0 .cse1 (or (not .cse2) (not .cse3) .cse4)) (and (< v_main_~l~0_23 (+ v_main_~l~0_24 2)) (< v_main_~l~0_24 v_main_~l~0_23) (= (+ v_main_~l~0_24 v_main_~v4~0_6) (+ v_main_~l~0_23 v_main_~v4~0_7)) .cse3 (not .cse4) .cse2)))) InVars {main_~l~0=v_main_~l~0_24, main_~n~0=v_main_~n~0_9, main_~v4~0=v_main_~v4~0_7} OutVars{main_~l~0=v_main_~l~0_23, main_~n~0=v_main_~n~0_9, main_~v4~0=v_main_~v4~0_6} AuxVars[] AssignedVars[main_~l~0, main_~v4~0] {437#(and (= main_~k~0 0) (or (and (= main_~l~0 0) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))) (and (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v4~0)) (<= main_~v4~0 main_~l~0)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))))) (= main_~j~0 0) (= main_~i~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:24:33,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {437#(and (= main_~k~0 0) (or (and (= main_~l~0 0) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))) (and (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v4~0)) (<= main_~v4~0 main_~l~0)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))))) (= main_~j~0 0) (= main_~i~0 0) (= main_~v3~0 0))} [76] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {438#(and (= main_~k~0 0) (= main_~j~0 0) (or (and (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))) (and (= main_~l~0 0) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0)))) (= main_~i~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:24:33,564 INFO L272 TraceCheckUtils]: 9: Hoare triple {438#(and (= main_~k~0 0) (= main_~j~0 0) (or (and (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))) (and (= main_~l~0 0) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0)))) (= main_~i~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {439#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:24:33,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {439#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {440#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:24:33,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {440#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {432#false} is VALID [2022-04-08 04:24:33,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {432#false} assume !false; {432#false} is VALID [2022-04-08 04:24:33,566 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:24:33,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:24:33,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649440694] [2022-04-08 04:24:33,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649440694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:24:33,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:24:33,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:24:33,619 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:24:33,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [504797911] [2022-04-08 04:24:33,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [504797911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:24:33,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:24:33,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:24:33,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094100483] [2022-04-08 04:24:33,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:24:33,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 04:24:33,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:24:33,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:24:35,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 04:24:35,873 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 04:24:35,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:24:35,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 04:24:35,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-08 04:24:35,874 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:24:40,260 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:24:42,469 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:24:44,684 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:24:46,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:24:49,116 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:24:53,625 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:24:55,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:24:58,006 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:25:00,240 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:25:02,455 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:25:02,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:25:02,769 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 04:25:02,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:25:02,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 04:25:02,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:25:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:25:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 04:25:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:25:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 04:25:02,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-08 04:25:05,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 04:25:05,013 INFO L225 Difference]: With dead ends: 34 [2022-04-08 04:25:05,013 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 04:25:05,013 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-08 04:25:05,014 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2022-04-08 04:25:05,014 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 10 Unknown, 0 Unchecked, 21.4s Time] [2022-04-08 04:25:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 04:25:05,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 04:25:05,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:25:05,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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:25:05,026 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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:25:05,027 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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:25:05,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:25:05,028 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-08 04:25:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-08 04:25:05,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:25:05,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:25:05,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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 23 states. [2022-04-08 04:25:05,031 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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 23 states. [2022-04-08 04:25:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:25:05,032 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-08 04:25:05,032 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-08 04:25:05,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:25:05,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:25:05,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:25:05,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:25:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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:25:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-08 04:25:05,034 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-04-08 04:25:05,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:25:05,034 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-08 04:25:05,034 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:25:05,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-08 04:25:05,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:25:05,063 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-08 04:25:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 04:25:05,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:25:05,063 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:25:05,064 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 04:25:05,064 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:25:05,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:25:05,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1646864326, now seen corresponding path program 1 times [2022-04-08 04:25:05,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:25:05,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [577264638] [2022-04-08 04:26:27,956 WARN L232 SmtUtils]: Spent 1.22m on a formula simplification. DAG size of input: 94 DAG size of output: 85 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-08 04:26:32,244 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:26:36,671 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:26:38,906 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself.