/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/sumt6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:00:30,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:00:30,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:00:30,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:00:30,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:00:30,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:00:30,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:00:30,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:00:30,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:00:30,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:00:30,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:00:31,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:00:31,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:00:31,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:00:31,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:00:31,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:00:31,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:00:31,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:00:31,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:00:31,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:00:31,023 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:00:31,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:00:31,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:00:31,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:00:31,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:00:31,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:00:31,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:00:31,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:00:31,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:00:31,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:00:31,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:00:31,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:00:31,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:00:31,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:00:31,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:00:31,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:00:31,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:00:31,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:00:31,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:00:31,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:00:31,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:00:31,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:00:31,049 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:00:31,061 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:00:31,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:00:31,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:00:31,063 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:00:31,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:00:31,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:00:31,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:00:31,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:00:31,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:00:31,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:00:31,065 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:00:31,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:00:31,065 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:00:31,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:00:31,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:00:31,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:00:31,065 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:00:31,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:00:31,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:00:31,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:00:31,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:00:31,066 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:00:31,066 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:00:31,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:00:31,066 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:00:31,066 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-28 04:00:31,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:00:31,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:00:31,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:00:31,326 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:00:31,326 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:00:31,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-28 04:00:31,384 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e913b74b/13d6a5c73c594bbfb24472890f349297/FLAGe422b829d [2022-04-28 04:00:31,803 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:00:31,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-28 04:00:31,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e913b74b/13d6a5c73c594bbfb24472890f349297/FLAGe422b829d [2022-04-28 04:00:32,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e913b74b/13d6a5c73c594bbfb24472890f349297 [2022-04-28 04:00:32,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:00:32,209 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:00:32,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:00:32,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:00:32,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:00:32,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:00:32" (1/1) ... [2022-04-28 04:00:32,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c631bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:00:32, skipping insertion in model container [2022-04-28 04:00:32,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:00:32" (1/1) ... [2022-04-28 04:00:32,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:00:32,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:00:32,428 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/sumt6.c[403,416] [2022-04-28 04:00:32,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:00:32,471 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:00:32,485 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/sumt6.c[403,416] [2022-04-28 04:00:32,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:00:32,517 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:00:32,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:00:32 WrapperNode [2022-04-28 04:00:32,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:00:32,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:00:32,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:00:32,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:00:32,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:00:32" (1/1) ... [2022-04-28 04:00:32,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:00:32" (1/1) ... [2022-04-28 04:00:32,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:00:32" (1/1) ... [2022-04-28 04:00:32,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:00:32" (1/1) ... [2022-04-28 04:00:32,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:00:32" (1/1) ... [2022-04-28 04:00:32,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:00:32" (1/1) ... [2022-04-28 04:00:32,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:00:32" (1/1) ... [2022-04-28 04:00:32,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:00:32,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:00:32,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:00:32,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:00:32,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:00:32" (1/1) ... [2022-04-28 04:00:32,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:00:32,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:00:32,588 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-28 04:00:32,612 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-28 04:00:32,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:00:32,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:00:32,632 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:00:32,632 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:00:32,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:00:32,633 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:00:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:00:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:00:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:00:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:00:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:00:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:00:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:00:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:00:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:00:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:00:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:00:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:00:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:00:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:00:32,695 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:00:32,697 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:00:39,362 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:00:39,369 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:00:39,369 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:00:39,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:00:39 BoogieIcfgContainer [2022-04-28 04:00:39,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:00:39,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:00:39,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:00:39,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:00:39,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:00:32" (1/3) ... [2022-04-28 04:00:39,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@861040c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:00:39, skipping insertion in model container [2022-04-28 04:00:39,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:00:32" (2/3) ... [2022-04-28 04:00:39,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@861040c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:00:39, skipping insertion in model container [2022-04-28 04:00:39,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:00:39" (3/3) ... [2022-04-28 04:00:39,378 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt6.c [2022-04-28 04:00:39,393 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:00:39,393 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:00:39,437 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:00:39,445 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@280d26cf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@30de221e [2022-04-28 04:00:39,446 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:00:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-28 04:00:39,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:00:39,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:00:39,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:00:39,465 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:00:39,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:00:39,469 INFO L85 PathProgramCache]: Analyzing trace with hash 503999003, now seen corresponding path program 1 times [2022-04-28 04:00:39,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:39,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1074388079] [2022-04-28 04:00:39,489 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:00:39,490 INFO L85 PathProgramCache]: Analyzing trace with hash 503999003, now seen corresponding path program 2 times [2022-04-28 04:00:39,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:00:39,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083885538] [2022-04-28 04:00:39,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:00:39,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:00:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:39,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:00:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:39,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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; {29#true} is VALID [2022-04-28 04:00:39,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 04:00:39,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #76#return; {29#true} is VALID [2022-04-28 04:00:39,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:00:39,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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; {29#true} is VALID [2022-04-28 04:00:39,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 04:00:39,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #76#return; {29#true} is VALID [2022-04-28 04:00:39,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2022-04-28 04:00:39,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {29#true} is VALID [2022-04-28 04:00:39,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {29#true} is VALID [2022-04-28 04:00:39,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-28 04:00:39,685 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-28 04:00:39,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-28 04:00:39,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-28 04:00:39,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-28 04:00:39,686 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-28 04:00:39,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:00:39,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083885538] [2022-04-28 04:00:39,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083885538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:00:39,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:00:39,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:00:39,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:00:39,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1074388079] [2022-04-28 04:00:39,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1074388079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:00:39,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:00:39,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:00:39,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064547480] [2022-04-28 04:00:39,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:00:39,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 04:00:39,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:00:39,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 04:00:39,723 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-28 04:00:39,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:00:39,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:39,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:00:39,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:00:39,743 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 04:00:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:46,371 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-28 04:00:46,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:00:46,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 04:00:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:00:46,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 04:00:46,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-28 04:00:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 04:00:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-28 04:00:46,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-28 04:00:46,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:00:46,476 INFO L225 Difference]: With dead ends: 38 [2022-04-28 04:00:46,476 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 04:00:46,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:00:46,481 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:00:46,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:00:46,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 04:00:46,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 04:00:46,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:00:46,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-28 04:00:46,523 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-28 04:00:46,523 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-28 04:00:46,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:46,537 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-28 04:00:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-28 04:00:46,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:00:46,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:00:46,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 04:00:46,538 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 04:00:46,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:46,540 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-28 04:00:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-28 04:00:46,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:00:46,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:00:46,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:00:46,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:00:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-28 04:00:46,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-28 04:00:46,544 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2022-04-28 04:00:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:00:46,545 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-28 04:00:46,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 04:00:46,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 24 transitions. [2022-04-28 04:00:46,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:00:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-28 04:00:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:00:46,596 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:00:46,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:00:46,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:00:46,597 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:00:46,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:00:46,598 INFO L85 PathProgramCache]: Analyzing trace with hash 475369852, now seen corresponding path program 1 times [2022-04-28 04:00:46,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:46,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [470434765] [2022-04-28 04:00:46,599 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:00:46,599 INFO L85 PathProgramCache]: Analyzing trace with hash 475369852, now seen corresponding path program 2 times [2022-04-28 04:00:46,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:00:46,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471998345] [2022-04-28 04:00:46,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:00:46,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:00:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:47,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:00:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:47,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {197#(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; {189#true} is VALID [2022-04-28 04:00:47,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2022-04-28 04:00:47,115 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #76#return; {189#true} is VALID [2022-04-28 04:00:47,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {197#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:00:47,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#(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; {189#true} is VALID [2022-04-28 04:00:47,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#true} assume true; {189#true} is VALID [2022-04-28 04:00:47,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189#true} {189#true} #76#return; {189#true} is VALID [2022-04-28 04:00:47,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {189#true} call #t~ret5 := main(); {189#true} is VALID [2022-04-28 04:00:47,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 04:00:47,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 04:00:47,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 04:00:47,124 INFO L272 TraceCheckUtils]: 8: Hoare triple {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:00:47,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {195#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {196#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:00:47,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {196#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {190#false} is VALID [2022-04-28 04:00:47,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#false} assume !false; {190#false} is VALID [2022-04-28 04:00:47,127 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-28 04:00:47,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:00:47,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471998345] [2022-04-28 04:00:47,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471998345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:00:47,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:00:47,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:00:47,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:00:47,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [470434765] [2022-04-28 04:00:47,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [470434765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:00:47,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:00:47,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:00:47,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508180643] [2022-04-28 04:00:47,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:00:47,131 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-28 04:00:47,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:00:47,131 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-28 04:00:47,146 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-28 04:00:47,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:00:47,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:47,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:00:47,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:00:47,150 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. 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-28 04:00:49,328 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-28 04:00:53,691 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-28 04:01:02,404 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-28 04:01:04,571 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-28 04:01:06,752 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-28 04:01:06,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:06,970 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-28 04:01:06,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:01:06,970 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-28 04:01:06,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:01:06,970 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-28 04:01:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 04:01:06,973 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-28 04:01:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 04:01:06,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-28 04:01:07,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:01:07,016 INFO L225 Difference]: With dead ends: 26 [2022-04-28 04:01:07,016 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 04:01:07,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:01:07,017 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:01:07,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 10.6s Time] [2022-04-28 04:01:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 04:01:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-28 04:01:07,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:01:07,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:07,027 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:07,027 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:07,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:07,031 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-28 04:01:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-28 04:01:07,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:01:07,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:01:07,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 04:01:07,033 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 04:01:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:07,036 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-28 04:01:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-28 04:01:07,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:01:07,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:01:07,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:01:07,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:01:07,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-04-28 04:01:07,042 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2022-04-28 04:01:07,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:01:07,042 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-04-28 04:01:07,042 INFO L496 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-28 04:01:07,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 25 transitions. [2022-04-28 04:01:07,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:01:07,076 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-28 04:01:07,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 04:01:07,077 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:01:07,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:01:07,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:01:07,077 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:01:07,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:01:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1279795021, now seen corresponding path program 1 times [2022-04-28 04:01:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:01:07,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1401009555] [2022-04-28 04:02:50,967 WARN L232 SmtUtils]: Spent 1.50m on a formula simplification. DAG size of input: 76 DAG size of output: 30 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-28 04:02:55,210 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:02:59,532 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:03:01,729 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-28 04:03:49,451 WARN L232 SmtUtils]: Spent 32.09s on a formula simplification. DAG size of input: 76 DAG size of output: 30 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-28 04:03:49,461 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-28 04:03:49,462 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:03:49,471 INFO L85 PathProgramCache]: Analyzing trace with hash -748417914, now seen corresponding path program 1 times [2022-04-28 04:03:49,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:03:49,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639637140] [2022-04-28 04:03:49,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:03:49,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:03:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:50,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:03:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:50,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {350#(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; {340#true} is VALID [2022-04-28 04:03:50,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 04:03:50,157 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {340#true} {340#true} #76#return; {340#true} is VALID [2022-04-28 04:03:50,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {350#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:03:50,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#(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; {340#true} is VALID [2022-04-28 04:03:50,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 04:03:50,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #76#return; {340#true} is VALID [2022-04-28 04:03:50,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret5 := main(); {340#true} is VALID [2022-04-28 04:03:50,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 04:03:50,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 04:03:50,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [80] L21-2-->L21-3_primed: Formula: (let ((.cse4 (mod v_main_~l~0_19 4294967296))) (let ((.cse2 (< .cse4 (mod v_main_~n~0_7 4294967296))) (.cse1 (= (mod (mod .cse4 6) 4294967296) 0)) (.cse0 (= v_main_~v2~0_7 v_main_~v2~0_6)) (.cse3 (= v_main_~l~0_19 v_main_~l~0_18))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3) (and (< v_main_~l~0_19 v_main_~l~0_18) (< v_main_~l~0_18 (+ v_main_~l~0_19 2)) (= (+ v_main_~l~0_19 v_main_~v2~0_6) (+ v_main_~l~0_18 v_main_~v2~0_7)) .cse2 .cse1) (and .cse0 (= v_main_~n~0_7 v_main_~n~0_7) .cse3)))) InVars {main_~l~0=v_main_~l~0_19, main_~n~0=v_main_~n~0_7, main_~v2~0=v_main_~v2~0_7} OutVars{main_~l~0=v_main_~l~0_18, main_~n~0=v_main_~n~0_7, main_~v2~0=v_main_~v2~0_6} AuxVars[] AssignedVars[main_~l~0, main_~v2~0] {346#(and (<= main_~v2~0 main_~l~0) (= main_~k~0 0) (or (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v2~0)) (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~j~0 0) (or (<= main_~l~0 main_~v2~0) (not (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 04:03:50,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {346#(and (<= main_~v2~0 main_~l~0) (= main_~k~0 0) (or (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v2~0)) (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~j~0 0) (or (<= main_~l~0 main_~v2~0) (not (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [79] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {347#(and (<= main_~v2~0 main_~l~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0))} is VALID [2022-04-28 04:03:50,167 INFO L272 TraceCheckUtils]: 9: Hoare triple {347#(and (<= main_~v2~0 main_~l~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {348#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:03:50,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {348#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {349#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:03:50,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {341#false} is VALID [2022-04-28 04:03:50,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-28 04:03:50,168 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-28 04:03:50,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:03:50,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639637140] [2022-04-28 04:03:50,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639637140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:03:50,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:03:50,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:03:58,987 WARN L232 SmtUtils]: Spent 8.48s on a formula simplification. DAG size of input: 34 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 04:03:59,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:03:59,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1401009555] [2022-04-28 04:03:59,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1401009555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:03:59,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:03:59,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 04:03:59,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201459623] [2022-04-28 04:03:59,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:03:59,031 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-28 04:03:59,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:03:59,032 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-28 04:04:01,164 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-28 04:04:01,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 04:04:01,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:04:01,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 04:04:01,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:04:01,166 INFO L87 Difference]: Start difference. First operand 20 states and 25 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-28 04:04:03,404 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-28 04:04:07,787 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-28 04:04:09,949 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-28 04:04:16,699 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-28 04:04:21,035 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-28 04:04:23,213 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-28 04:04:27,519 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-28 04:04:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:04:27,776 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-04-28 04:04:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 04:04:27,776 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-28 04:04:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:04:27,777 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-28 04:04:27,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-28 04:04:27,779 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-28 04:04:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-28 04:04:27,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 52 transitions. [2022-04-28 04:04:27,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:04:27,837 INFO L225 Difference]: With dead ends: 39 [2022-04-28 04:04:27,837 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 04:04:27,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-04-28 04:04:27,839 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 30 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:04:27,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 43 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 7 Unknown, 0 Unchecked, 14.8s Time] [2022-04-28 04:04:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 04:04:27,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 04:04:27,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:04:27,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:27,848 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:27,848 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:27,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:04:27,850 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-28 04:04:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-28 04:04:27,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:04:27,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:04:27,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 04:04:27,850 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 04:04:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:04:27,852 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-28 04:04:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-28 04:04:27,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:04:27,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:04:27,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:04:27,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:04:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-28 04:04:27,854 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2022-04-28 04:04:27,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:04:27,854 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-28 04:04:27,854 INFO L496 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-28 04:04:27,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 30 transitions. [2022-04-28 04:04:27,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:04:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-28 04:04:27,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 04:04:27,894 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:04:27,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:04:27,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 04:04:27,894 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:04:27,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:04:27,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1309439716, now seen corresponding path program 1 times [2022-04-28 04:04:27,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:04:27,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1281208925] [2022-04-28 04:06:29,258 WARN L232 SmtUtils]: Spent 1.72m on a formula simplification. DAG size of input: 94 DAG size of output: 35 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-28 04:06:33,606 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:06:37,951 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:06:40,327 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-28 04:08:48,863 WARN L232 SmtUtils]: Spent 1.79m on a formula simplification. DAG size of input: 94 DAG size of output: 35 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-28 04:08:48,869 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-28 04:08:48,870 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash -689312570, now seen corresponding path program 1 times [2022-04-28 04:08:48,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:48,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055868192] [2022-04-28 04:08:48,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:48,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:49,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:49,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {555#(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; {545#true} is VALID [2022-04-28 04:08:49,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#true} assume true; {545#true} is VALID [2022-04-28 04:08:49,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {545#true} {545#true} #76#return; {545#true} is VALID [2022-04-28 04:08:49,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {545#true} call ULTIMATE.init(); {555#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:49,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {555#(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; {545#true} is VALID [2022-04-28 04:08:49,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {545#true} assume true; {545#true} is VALID [2022-04-28 04:08:49,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {545#true} {545#true} #76#return; {545#true} is VALID [2022-04-28 04:08:49,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {545#true} call #t~ret5 := main(); {545#true} is VALID [2022-04-28 04:08:49,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {545#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {550#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 04:08:49,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {550#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {550#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 04:08:49,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [82] L21-2-->L21-3_primed: Formula: (let ((.cse5 (mod v_main_~l~0_26 4294967296))) (let ((.cse1 (= (mod (mod .cse5 6) 4294967296) 0)) (.cse2 (< .cse5 (mod v_main_~n~0_9 4294967296))) (.cse0 (= (mod (mod .cse5 5) 4294967296) 0)) (.cse3 (= v_main_~l~0_26 v_main_~l~0_25)) (.cse4 (= v_main_~v3~0_7 v_main_~v3~0_6))) (or (and .cse0 (not .cse1) (= (+ v_main_~l~0_25 v_main_~v3~0_7) (+ v_main_~l~0_26 v_main_~v3~0_6)) (< v_main_~l~0_26 v_main_~l~0_25) .cse2 (< v_main_~l~0_25 (+ v_main_~l~0_26 2))) (and (= v_main_~n~0_9 v_main_~n~0_9) .cse3 .cse4) (and (or .cse1 (not .cse2) (not .cse0)) .cse3 .cse4)))) InVars {main_~l~0=v_main_~l~0_26, main_~v3~0=v_main_~v3~0_7, main_~n~0=v_main_~n~0_9} OutVars{main_~l~0=v_main_~l~0_25, main_~v3~0=v_main_~v3~0_6, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~l~0, main_~v3~0] {551#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (or (<= (+ (* (div main_~n~0 4294967296) 4294967296) main_~v3~0) main_~n~0) (not (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)))) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)) (<= 0 main_~v3~0))} is VALID [2022-04-28 04:08:49,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {551#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (or (<= (+ (* (div main_~n~0 4294967296) 4294967296) main_~v3~0) main_~n~0) (not (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)))) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)) (<= 0 main_~v3~0))} [81] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {552#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1)) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)) (<= 0 main_~v3~0))} is VALID [2022-04-28 04:08:49,428 INFO L272 TraceCheckUtils]: 9: Hoare triple {552#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1)) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)) (<= 0 main_~v3~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:08:49,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {553#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {554#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:08:49,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {546#false} is VALID [2022-04-28 04:08:49,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {546#false} assume !false; {546#false} is VALID [2022-04-28 04:08:49,430 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-28 04:08:49,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:49,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055868192] [2022-04-28 04:08:49,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055868192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:49,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:49,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:08:51,764 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~l~0 4294967296))) (and (= c_main_~i~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= c_main_~v3~0 0) (= c_main_~j~0 0) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~k~0 0))) is different from false [2022-04-28 04:08:54,038 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~l~0 4294967296))) (and (= (mod (mod .cse0 5) 4294967296) 0) (= c_main_~i~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= (+ c_main_~v3~0 (- 1)) 0) (= c_main_~j~0 0) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~k~0 0))) is different from false [2022-04-28 04:08:54,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:54,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1281208925] [2022-04-28 04:08:54,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1281208925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:54,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:54,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 04:08:54,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434090636] [2022-04-28 04:08:54,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:54,063 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-28 04:08:54,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:54,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-28 04:08:56,353 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-28 04:08:56,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 04:08:56,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:56,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 04:08:56,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=53, Unknown=2, NotChecked=30, Total=110 [2022-04-28 04:08:56,355 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-28 04:08:58,590 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-28 04:09:03,206 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-28 04:09:05,459 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:09:07,681 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-28 04:09:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:10,306 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-04-28 04:09:10,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:09:10,307 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-28 04:09:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-28 04:09:10,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-28 04:09:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-28 04:09:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-28 04:09:10,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2022-04-28 04:09:12,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 47 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:12,636 INFO L225 Difference]: With dead ends: 39 [2022-04-28 04:09:12,636 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 04:09:12,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=39, Invalid=77, Unknown=2, NotChecked=38, Total=156 [2022-04-28 04:09:12,638 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:12,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 52 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 4 Unknown, 38 Unchecked, 8.6s Time] [2022-04-28 04:09:12,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 04:09:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-28 04:09:12,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:12,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:12,647 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:12,647 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:12,649 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-28 04:09:12,649 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-28 04:09:12,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:12,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:12,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 04:09:12,650 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 04:09:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:12,651 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-28 04:09:12,651 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-28 04:09:12,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:12,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:12,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:12,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-04-28 04:09:12,653 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2022-04-28 04:09:12,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:12,653 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-04-28 04:09:12,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-28 04:09:12,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 31 transitions. [2022-04-28 04:09:12,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-28 04:09:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 04:09:12,688 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:12,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:12,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 04:09:12,688 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:12,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:12,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1923990926, now seen corresponding path program 1 times [2022-04-28 04:09:12,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:12,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [188983433] [2022-04-28 04:13:00,651 WARN L232 SmtUtils]: Spent 3.40m on a formula simplification. DAG size of input: 92 DAG size of output: 88 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-28 04:13:05,226 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:09,756 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:12,083 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself.