/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:20:47,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:20:47,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:20:47,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:20:47,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:20:47,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:20:47,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:20:47,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:20:47,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:20:47,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:20:47,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:20:47,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:20:47,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:20:47,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:20:47,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:20:47,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:20:47,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:20:47,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:20:47,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:20:47,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:20:47,634 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:20:47,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:20:47,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:20:47,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:20:47,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:20:47,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:20:47,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:20:47,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:20:47,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:20:47,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:20:47,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:20:47,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:20:47,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:20:47,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:20:47,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:20:47,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:20:47,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:20:47,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:20:47,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:20:47,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:20:47,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:20:47,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:20:47,653 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:20:47,662 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:20:47,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:20:47,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:20:47,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:20:47,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:20:47,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:20:47,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:20:47,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:20:47,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:20:47,666 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:20:47,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:20:47,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:20:47,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:20:47,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:20:47,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:20:47,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:20:47,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:20:47,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:20:47,667 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:20:47,667 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:20:47,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:20:47,667 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:20:47,668 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 10:20:47,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:20:47,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:20:47,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:20:47,925 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:20:47,926 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:20:47,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2022-04-28 10:20:47,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adc809340/292a9837b3b248b3ab5040e4a3f8089b/FLAG2ecc6e99f [2022-04-28 10:20:48,314 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:20:48,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2022-04-28 10:20:48,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adc809340/292a9837b3b248b3ab5040e4a3f8089b/FLAG2ecc6e99f [2022-04-28 10:20:48,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adc809340/292a9837b3b248b3ab5040e4a3f8089b [2022-04-28 10:20:48,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:20:48,330 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:20:48,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:20:48,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:20:48,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:20:48,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:20:48" (1/1) ... [2022-04-28 10:20:48,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5999797c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:20:48, skipping insertion in model container [2022-04-28 10:20:48,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:20:48" (1/1) ... [2022-04-28 10:20:48,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:20:48,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:20:48,471 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/nested5-1.c[321,334] [2022-04-28 10:20:48,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:20:48,518 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:20:48,528 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/nested5-1.c[321,334] [2022-04-28 10:20:48,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:20:48,544 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:20:48,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:20:48 WrapperNode [2022-04-28 10:20:48,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:20:48,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:20:48,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:20:48,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:20:48,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:20:48" (1/1) ... [2022-04-28 10:20:48,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:20:48" (1/1) ... [2022-04-28 10:20:48,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:20:48" (1/1) ... [2022-04-28 10:20:48,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:20:48" (1/1) ... [2022-04-28 10:20:48,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:20:48" (1/1) ... [2022-04-28 10:20:48,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:20:48" (1/1) ... [2022-04-28 10:20:48,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:20:48" (1/1) ... [2022-04-28 10:20:48,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:20:48,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:20:48,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:20:48,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:20:48,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:20:48" (1/1) ... [2022-04-28 10:20:48,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:20:48,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:20:48,600 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 10:20:48,601 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 10:20:48,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:20:48,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:20:48,630 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:20:48,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:20:48,631 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:20:48,631 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:20:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:20:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:20:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:20:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:20:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:20:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:20:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:20:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:20:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:20:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:20:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:20:48,683 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:20:48,684 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:20:48,815 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:20:48,836 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:20:48,837 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-28 10:20:48,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:20:48 BoogieIcfgContainer [2022-04-28 10:20:48,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:20:48,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:20:48,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:20:48,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:20:48,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:20:48" (1/3) ... [2022-04-28 10:20:48,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9cba9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:20:48, skipping insertion in model container [2022-04-28 10:20:48,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:20:48" (2/3) ... [2022-04-28 10:20:48,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9cba9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:20:48, skipping insertion in model container [2022-04-28 10:20:48,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:20:48" (3/3) ... [2022-04-28 10:20:48,849 INFO L111 eAbstractionObserver]: Analyzing ICFG nested5-1.c [2022-04-28 10:20:48,876 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:20:48,876 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:20:48,923 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:20:48,929 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@7275b222, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@25516b1b [2022-04-28 10:20:48,929 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:20:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:20:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:20:48,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:20:48,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:20:48,944 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:20:48,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:20:48,948 INFO L85 PathProgramCache]: Analyzing trace with hash -531959740, now seen corresponding path program 1 times [2022-04-28 10:20:48,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:48,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2131427476] [2022-04-28 10:20:48,962 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:20:48,962 INFO L85 PathProgramCache]: Analyzing trace with hash -531959740, now seen corresponding path program 2 times [2022-04-28 10:20:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:20:48,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059391049] [2022-04-28 10:20:48,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:20:48,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:20:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:49,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:20:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:49,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(and (= |#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(12, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-28 10:20:49,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 10:20:49,185 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #85#return; {31#true} is VALID [2022-04-28 10:20:49,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:20:49,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(and (= |#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(12, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-28 10:20:49,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 10:20:49,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #85#return; {31#true} is VALID [2022-04-28 10:20:49,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret9 := main(); {31#true} is VALID [2022-04-28 10:20:49,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {31#true} is VALID [2022-04-28 10:20:49,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {31#true} is VALID [2022-04-28 10:20:49,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {31#true} is VALID [2022-04-28 10:20:49,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {31#true} is VALID [2022-04-28 10:20:49,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {31#true} is VALID [2022-04-28 10:20:49,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#true} assume !true; {32#false} is VALID [2022-04-28 10:20:49,190 INFO L272 TraceCheckUtils]: 11: Hoare triple {32#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {32#false} is VALID [2022-04-28 10:20:49,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-28 10:20:49,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-28 10:20:49,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-28 10:20:49,193 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 10:20:49,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:20:49,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059391049] [2022-04-28 10:20:49,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059391049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:20:49,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:20:49,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:20:49,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:20:49,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2131427476] [2022-04-28 10:20:49,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2131427476] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:20:49,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:20:49,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:20:49,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094890002] [2022-04-28 10:20:49,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:20:49,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 10:20:49,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:20:49,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 10:20:49,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:49,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:20:49,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:49,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:20:49,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:20:49,272 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 10:20:49,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:49,394 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-04-28 10:20:49,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:20:49,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 10:20:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:20:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 10:20:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-28 10:20:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 10:20:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-28 10:20:49,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-04-28 10:20:49,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:49,498 INFO L225 Difference]: With dead ends: 50 [2022-04-28 10:20:49,499 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 10:20:49,502 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 10:20:49,505 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:20:49,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:20:49,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 10:20:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 10:20:49,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:20:49,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:49,538 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:49,538 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:49,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:49,541 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-28 10:20:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 10:20:49,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:49,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:49,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-28 10:20:49,542 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-28 10:20:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:49,552 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-28 10:20:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 10:20:49,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:49,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:49,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:20:49,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:20:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-28 10:20:49,557 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2022-04-28 10:20:49,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:20:49,558 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-28 10:20:49,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 10:20:49,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-28 10:20:49,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:49,595 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 10:20:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:20:49,598 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:20:49,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:20:49,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:20:49,602 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:20:49,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:20:49,602 INFO L85 PathProgramCache]: Analyzing trace with hash -537500866, now seen corresponding path program 1 times [2022-04-28 10:20:49,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:49,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1184874475] [2022-04-28 10:20:49,603 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:20:49,604 INFO L85 PathProgramCache]: Analyzing trace with hash -537500866, now seen corresponding path program 2 times [2022-04-28 10:20:49,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:20:49,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482144622] [2022-04-28 10:20:49,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:20:49,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:20:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:49,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:20:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:49,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#(and (= |#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(12, 2);call #Ultimate.allocInit(12, 3); {231#true} is VALID [2022-04-28 10:20:49,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-28 10:20:49,729 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {231#true} {231#true} #85#return; {231#true} is VALID [2022-04-28 10:20:49,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:20:49,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#(and (= |#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(12, 2);call #Ultimate.allocInit(12, 3); {231#true} is VALID [2022-04-28 10:20:49,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-28 10:20:49,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #85#return; {231#true} is VALID [2022-04-28 10:20:49,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret9 := main(); {231#true} is VALID [2022-04-28 10:20:49,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {231#true} is VALID [2022-04-28 10:20:49,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {231#true} is VALID [2022-04-28 10:20:49,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {231#true} is VALID [2022-04-28 10:20:49,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {231#true} is VALID [2022-04-28 10:20:49,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {236#(= main_~v~0 0)} is VALID [2022-04-28 10:20:49,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {236#(= main_~v~0 0)} assume !(~v~0 % 4294967296 < 10); {232#false} is VALID [2022-04-28 10:20:49,734 INFO L272 TraceCheckUtils]: 11: Hoare triple {232#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {232#false} is VALID [2022-04-28 10:20:49,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#false} ~cond := #in~cond; {232#false} is VALID [2022-04-28 10:20:49,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {232#false} assume 0 == ~cond; {232#false} is VALID [2022-04-28 10:20:49,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-28 10:20:49,735 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 10:20:49,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:20:49,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482144622] [2022-04-28 10:20:49,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482144622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:20:49,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:20:49,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:20:49,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:20:49,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1184874475] [2022-04-28 10:20:49,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1184874475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:20:49,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:20:49,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:20:49,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621776201] [2022-04-28 10:20:49,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:20:49,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 10:20:49,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:20:49,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 10:20:49,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:49,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:20:49,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:49,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:20:49,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:20:49,756 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 10:20:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:49,875 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-28 10:20:49,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:20:49,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 10:20:49,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:20:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 10:20:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-28 10:20:49,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 10:20:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-28 10:20:49,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-04-28 10:20:49,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:49,945 INFO L225 Difference]: With dead ends: 49 [2022-04-28 10:20:49,945 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 10:20:49,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:20:49,948 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:20:49,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:20:49,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 10:20:49,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-04-28 10:20:49,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:20:49,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:49,958 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:49,959 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:49,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:49,961 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-28 10:20:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-28 10:20:49,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:49,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:49,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-28 10:20:49,964 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-28 10:20:49,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:49,968 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-28 10:20:49,968 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-28 10:20:49,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:49,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:49,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:20:49,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:20:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-28 10:20:49,976 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2022-04-28 10:20:49,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:20:49,976 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-28 10:20:49,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 10:20:49,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 28 transitions. [2022-04-28 10:20:50,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-28 10:20:50,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:20:50,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:20:50,008 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 10:20:50,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:20:50,009 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:20:50,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:20:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash -509289700, now seen corresponding path program 1 times [2022-04-28 10:20:50,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:50,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1741367932] [2022-04-28 10:20:50,026 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:20:50,026 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:20:50,026 INFO L85 PathProgramCache]: Analyzing trace with hash -509289700, now seen corresponding path program 2 times [2022-04-28 10:20:50,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:20:50,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868566689] [2022-04-28 10:20:50,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:20:50,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:20:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:50,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:20:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:50,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#(and (= |#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(12, 2);call #Ultimate.allocInit(12, 3); {453#true} is VALID [2022-04-28 10:20:50,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-28 10:20:50,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {453#true} {453#true} #85#return; {453#true} is VALID [2022-04-28 10:20:50,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {460#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:20:50,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#(and (= |#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(12, 2);call #Ultimate.allocInit(12, 3); {453#true} is VALID [2022-04-28 10:20:50,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-28 10:20:50,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #85#return; {453#true} is VALID [2022-04-28 10:20:50,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret9 := main(); {453#true} is VALID [2022-04-28 10:20:50,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {453#true} is VALID [2022-04-28 10:20:50,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {453#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {453#true} is VALID [2022-04-28 10:20:50,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {453#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {453#true} is VALID [2022-04-28 10:20:50,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {453#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {453#true} is VALID [2022-04-28 10:20:50,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {453#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {458#(= main_~v~0 0)} is VALID [2022-04-28 10:20:50,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 10); {458#(= main_~v~0 0)} is VALID [2022-04-28 10:20:50,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {459#(and (<= main_~v~0 1) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:20:50,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(and (<= main_~v~0 1) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} assume !(~v~0 % 4294967296 < 10); {454#false} is VALID [2022-04-28 10:20:50,150 INFO L272 TraceCheckUtils]: 13: Hoare triple {454#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {454#false} is VALID [2022-04-28 10:20:50,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2022-04-28 10:20:50,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#false} assume 0 == ~cond; {454#false} is VALID [2022-04-28 10:20:50,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-28 10:20:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:20:50,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:20:50,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868566689] [2022-04-28 10:20:50,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868566689] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:20:50,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184219513] [2022-04-28 10:20:50,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:20:50,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:20:50,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:20:50,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:20:50,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 10:20:50,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:20:50,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:20:50,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 10:20:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:50,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:20:50,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {453#true} is VALID [2022-04-28 10:20:50,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {453#true} is VALID [2022-04-28 10:20:50,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-28 10:20:50,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #85#return; {453#true} is VALID [2022-04-28 10:20:50,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret9 := main(); {453#true} is VALID [2022-04-28 10:20:50,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {453#true} is VALID [2022-04-28 10:20:50,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {453#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {453#true} is VALID [2022-04-28 10:20:50,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {453#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {453#true} is VALID [2022-04-28 10:20:50,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {453#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {453#true} is VALID [2022-04-28 10:20:50,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {453#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {458#(= main_~v~0 0)} is VALID [2022-04-28 10:20:50,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 10); {458#(= main_~v~0 0)} is VALID [2022-04-28 10:20:50,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {497#(= (+ (- 1) main_~v~0) 0)} is VALID [2022-04-28 10:20:50,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {497#(= (+ (- 1) main_~v~0) 0)} assume !(~v~0 % 4294967296 < 10); {454#false} is VALID [2022-04-28 10:20:50,365 INFO L272 TraceCheckUtils]: 13: Hoare triple {454#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {454#false} is VALID [2022-04-28 10:20:50,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2022-04-28 10:20:50,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#false} assume 0 == ~cond; {454#false} is VALID [2022-04-28 10:20:50,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-28 10:20:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:20:50,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:20:50,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-28 10:20:50,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#false} assume 0 == ~cond; {454#false} is VALID [2022-04-28 10:20:50,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2022-04-28 10:20:50,464 INFO L272 TraceCheckUtils]: 13: Hoare triple {454#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {454#false} is VALID [2022-04-28 10:20:50,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {525#(< (mod main_~v~0 4294967296) 10)} assume !(~v~0 % 4294967296 < 10); {454#false} is VALID [2022-04-28 10:20:50,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {529#(< (mod (+ main_~v~0 1) 4294967296) 10)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {525#(< (mod main_~v~0 4294967296) 10)} is VALID [2022-04-28 10:20:50,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {529#(< (mod (+ main_~v~0 1) 4294967296) 10)} assume !!(~v~0 % 4294967296 < 10); {529#(< (mod (+ main_~v~0 1) 4294967296) 10)} is VALID [2022-04-28 10:20:50,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {453#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {529#(< (mod (+ main_~v~0 1) 4294967296) 10)} is VALID [2022-04-28 10:20:50,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {453#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {453#true} is VALID [2022-04-28 10:20:50,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {453#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {453#true} is VALID [2022-04-28 10:20:50,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {453#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {453#true} is VALID [2022-04-28 10:20:50,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {453#true} is VALID [2022-04-28 10:20:50,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret9 := main(); {453#true} is VALID [2022-04-28 10:20:50,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #85#return; {453#true} is VALID [2022-04-28 10:20:50,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-28 10:20:50,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {453#true} is VALID [2022-04-28 10:20:50,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {453#true} is VALID [2022-04-28 10:20:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:20:50,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184219513] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:20:50,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:20:50,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 10:20:50,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:20:50,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1741367932] [2022-04-28 10:20:50,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1741367932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:20:50,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:20:50,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:20:50,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473898713] [2022-04-28 10:20:50,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:20:50,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-28 10:20:50,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:20:50,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 10:20:50,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:50,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:20:50,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:50,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:20:50,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:20:50,485 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 10:20:50,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:50,658 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-28 10:20:50,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:20:50,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-28 10:20:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:20:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 10:20:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-28 10:20:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 10:20:50,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-28 10:20:50,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-28 10:20:50,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:50,729 INFO L225 Difference]: With dead ends: 52 [2022-04-28 10:20:50,730 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 10:20:50,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:20:50,734 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 43 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:20:50,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 36 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:20:50,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 10:20:50,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2022-04-28 10:20:50,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:20:50,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:50,754 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:50,755 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:50,757 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-28 10:20:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-28 10:20:50,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:50,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:50,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 34 states. [2022-04-28 10:20:50,760 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 34 states. [2022-04-28 10:20:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:50,764 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-28 10:20:50,764 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-28 10:20:50,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:50,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:50,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:20:50,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:20:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-28 10:20:50,768 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 17 [2022-04-28 10:20:50,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:20:50,769 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-28 10:20:50,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 10:20:50,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2022-04-28 10:20:50,807 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 10:20:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 10:20:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:20:50,808 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:20:50,808 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:20:50,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 10:20:51,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:20:51,024 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:20:51,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:20:51,024 INFO L85 PathProgramCache]: Analyzing trace with hash 831837050, now seen corresponding path program 3 times [2022-04-28 10:20:51,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:51,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [90414082] [2022-04-28 10:20:51,042 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:20:51,042 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:20:51,042 INFO L85 PathProgramCache]: Analyzing trace with hash 831837050, now seen corresponding path program 4 times [2022-04-28 10:20:51,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:20:51,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857507945] [2022-04-28 10:20:51,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:20:51,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:20:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:51,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:20:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:51,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {802#(and (= |#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(12, 2);call #Ultimate.allocInit(12, 3); {794#true} is VALID [2022-04-28 10:20:51,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {794#true} assume true; {794#true} is VALID [2022-04-28 10:20:51,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {794#true} {794#true} #85#return; {794#true} is VALID [2022-04-28 10:20:51,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {794#true} call ULTIMATE.init(); {802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:20:51,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {802#(and (= |#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(12, 2);call #Ultimate.allocInit(12, 3); {794#true} is VALID [2022-04-28 10:20:51,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {794#true} assume true; {794#true} is VALID [2022-04-28 10:20:51,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {794#true} {794#true} #85#return; {794#true} is VALID [2022-04-28 10:20:51,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {794#true} call #t~ret9 := main(); {794#true} is VALID [2022-04-28 10:20:51,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {794#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {794#true} is VALID [2022-04-28 10:20:51,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {794#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {794#true} is VALID [2022-04-28 10:20:51,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {794#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {794#true} is VALID [2022-04-28 10:20:51,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {794#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {794#true} is VALID [2022-04-28 10:20:51,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {794#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {799#(= main_~v~0 0)} is VALID [2022-04-28 10:20:51,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {799#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 10); {799#(= main_~v~0 0)} is VALID [2022-04-28 10:20:51,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {799#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {800#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-28 10:20:51,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {800#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {800#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-28 10:20:51,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {800#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {801#(and (not (<= (+ (div main_~v~0 4294967296) 1) 0)) (<= main_~v~0 2))} is VALID [2022-04-28 10:20:51,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {801#(and (not (<= (+ (div main_~v~0 4294967296) 1) 0)) (<= main_~v~0 2))} assume !(~v~0 % 4294967296 < 10); {795#false} is VALID [2022-04-28 10:20:51,157 INFO L272 TraceCheckUtils]: 15: Hoare triple {795#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {795#false} is VALID [2022-04-28 10:20:51,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {795#false} ~cond := #in~cond; {795#false} is VALID [2022-04-28 10:20:51,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {795#false} assume 0 == ~cond; {795#false} is VALID [2022-04-28 10:20:51,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {795#false} assume !false; {795#false} is VALID [2022-04-28 10:20:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:20:51,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:20:51,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857507945] [2022-04-28 10:20:51,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857507945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:20:51,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573822910] [2022-04-28 10:20:51,159 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:20:51,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:20:51,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:20:51,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:20:51,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 10:20:51,197 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:20:51,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:20:51,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:20:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:51,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:20:51,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {794#true} call ULTIMATE.init(); {794#true} is VALID [2022-04-28 10:20:51,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {794#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {794#true} is VALID [2022-04-28 10:20:51,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {794#true} assume true; {794#true} is VALID [2022-04-28 10:20:51,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {794#true} {794#true} #85#return; {794#true} is VALID [2022-04-28 10:20:51,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {794#true} call #t~ret9 := main(); {794#true} is VALID [2022-04-28 10:20:51,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {794#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {794#true} is VALID [2022-04-28 10:20:51,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {794#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {794#true} is VALID [2022-04-28 10:20:51,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {794#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {794#true} is VALID [2022-04-28 10:20:51,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {794#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {794#true} is VALID [2022-04-28 10:20:51,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {794#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {799#(= main_~v~0 0)} is VALID [2022-04-28 10:20:51,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {799#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 10); {799#(= main_~v~0 0)} is VALID [2022-04-28 10:20:51,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {799#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {800#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-28 10:20:51,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {800#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {800#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-28 10:20:51,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {800#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {845#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-28 10:20:51,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {845#(and (<= 2 main_~v~0) (<= main_~v~0 2))} assume !(~v~0 % 4294967296 < 10); {795#false} is VALID [2022-04-28 10:20:51,479 INFO L272 TraceCheckUtils]: 15: Hoare triple {795#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {795#false} is VALID [2022-04-28 10:20:51,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {795#false} ~cond := #in~cond; {795#false} is VALID [2022-04-28 10:20:51,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {795#false} assume 0 == ~cond; {795#false} is VALID [2022-04-28 10:20:51,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {795#false} assume !false; {795#false} is VALID [2022-04-28 10:20:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:20:51,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:20:51,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {795#false} assume !false; {795#false} is VALID [2022-04-28 10:20:51,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {795#false} assume 0 == ~cond; {795#false} is VALID [2022-04-28 10:20:51,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {795#false} ~cond := #in~cond; {795#false} is VALID [2022-04-28 10:20:51,588 INFO L272 TraceCheckUtils]: 15: Hoare triple {795#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {795#false} is VALID [2022-04-28 10:20:51,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#(< (mod main_~v~0 4294967296) 10)} assume !(~v~0 % 4294967296 < 10); {795#false} is VALID [2022-04-28 10:20:51,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#(< (mod (+ main_~v~0 1) 4294967296) 10)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {873#(< (mod main_~v~0 4294967296) 10)} is VALID [2022-04-28 10:20:51,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#(< (mod (+ main_~v~0 1) 4294967296) 10)} assume !!(~v~0 % 4294967296 < 10); {877#(< (mod (+ main_~v~0 1) 4294967296) 10)} is VALID [2022-04-28 10:20:51,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#(< (mod (+ main_~v~0 2) 4294967296) 10)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {877#(< (mod (+ main_~v~0 1) 4294967296) 10)} is VALID [2022-04-28 10:20:51,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#(< (mod (+ main_~v~0 2) 4294967296) 10)} assume !!(~v~0 % 4294967296 < 10); {884#(< (mod (+ main_~v~0 2) 4294967296) 10)} is VALID [2022-04-28 10:20:51,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {794#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {884#(< (mod (+ main_~v~0 2) 4294967296) 10)} is VALID [2022-04-28 10:20:51,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {794#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {794#true} is VALID [2022-04-28 10:20:51,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {794#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {794#true} is VALID [2022-04-28 10:20:51,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {794#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {794#true} is VALID [2022-04-28 10:20:51,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {794#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {794#true} is VALID [2022-04-28 10:20:51,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {794#true} call #t~ret9 := main(); {794#true} is VALID [2022-04-28 10:20:51,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {794#true} {794#true} #85#return; {794#true} is VALID [2022-04-28 10:20:51,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {794#true} assume true; {794#true} is VALID [2022-04-28 10:20:51,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {794#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {794#true} is VALID [2022-04-28 10:20:51,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {794#true} call ULTIMATE.init(); {794#true} is VALID [2022-04-28 10:20:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:20:51,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573822910] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:20:51,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:20:51,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 10:20:51,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:20:51,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [90414082] [2022-04-28 10:20:51,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [90414082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:20:51,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:20:51,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:20:51,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289461935] [2022-04-28 10:20:51,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:20:51,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 19 [2022-04-28 10:20:51,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:20:51,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 10:20:51,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:51,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:20:51,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:51,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:20:51,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:20:51,613 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 10:20:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:51,793 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-04-28 10:20:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:20:51,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 19 [2022-04-28 10:20:51,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:20:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 10:20:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-28 10:20:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 10:20:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-28 10:20:51,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-04-28 10:20:51,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:51,859 INFO L225 Difference]: With dead ends: 56 [2022-04-28 10:20:51,859 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 10:20:51,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:20:51,861 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 54 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:20:51,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 31 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:20:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 10:20:51,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-04-28 10:20:51,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:20:51,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:51,875 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:51,876 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:51,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:51,878 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-28 10:20:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-28 10:20:51,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:51,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:51,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 36 states. [2022-04-28 10:20:51,880 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 36 states. [2022-04-28 10:20:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:51,882 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-28 10:20:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-28 10:20:51,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:51,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:51,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:20:51,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:20:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-28 10:20:51,885 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2022-04-28 10:20:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:20:51,885 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-28 10:20:51,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 10:20:51,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-28 10:20:51,920 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 10:20:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 10:20:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:20:51,921 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:20:51,921 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:20:51,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 10:20:52,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 10:20:52,144 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:20:52,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:20:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1164455000, now seen corresponding path program 5 times [2022-04-28 10:20:52,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:52,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [620822665] [2022-04-28 10:20:52,148 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:20:52,148 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:20:52,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1164455000, now seen corresponding path program 6 times [2022-04-28 10:20:52,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:20:52,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158115801] [2022-04-28 10:20:52,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:20:52,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:20:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:52,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:20:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:52,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {1176#(and (= |#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(12, 2);call #Ultimate.allocInit(12, 3); {1167#true} is VALID [2022-04-28 10:20:52,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {1167#true} assume true; {1167#true} is VALID [2022-04-28 10:20:52,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1167#true} {1167#true} #85#return; {1167#true} is VALID [2022-04-28 10:20:52,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {1167#true} call ULTIMATE.init(); {1176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:20:52,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {1176#(and (= |#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(12, 2);call #Ultimate.allocInit(12, 3); {1167#true} is VALID [2022-04-28 10:20:52,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {1167#true} assume true; {1167#true} is VALID [2022-04-28 10:20:52,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1167#true} {1167#true} #85#return; {1167#true} is VALID [2022-04-28 10:20:52,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {1167#true} call #t~ret9 := main(); {1167#true} is VALID [2022-04-28 10:20:52,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {1167#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {1167#true} is VALID [2022-04-28 10:20:52,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {1167#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {1167#true} is VALID [2022-04-28 10:20:52,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {1167#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {1167#true} is VALID [2022-04-28 10:20:52,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {1167#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {1167#true} is VALID [2022-04-28 10:20:52,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {1167#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {1172#(= main_~v~0 0)} is VALID [2022-04-28 10:20:52,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {1172#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 10); {1172#(= main_~v~0 0)} is VALID [2022-04-28 10:20:52,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {1172#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1173#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-28 10:20:52,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {1173#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {1173#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-28 10:20:52,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {1173#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1174#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-28 10:20:52,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {1174#(and (<= 2 main_~v~0) (<= main_~v~0 2))} assume !!(~v~0 % 4294967296 < 10); {1174#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-28 10:20:52,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {1174#(and (<= 2 main_~v~0) (<= main_~v~0 2))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1175#(and (not (<= (+ (div main_~v~0 4294967296) 1) 0)) (<= main_~v~0 3))} is VALID [2022-04-28 10:20:52,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {1175#(and (not (<= (+ (div main_~v~0 4294967296) 1) 0)) (<= main_~v~0 3))} assume !(~v~0 % 4294967296 < 10); {1168#false} is VALID [2022-04-28 10:20:52,269 INFO L272 TraceCheckUtils]: 17: Hoare triple {1168#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {1168#false} is VALID [2022-04-28 10:20:52,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {1168#false} ~cond := #in~cond; {1168#false} is VALID [2022-04-28 10:20:52,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {1168#false} assume 0 == ~cond; {1168#false} is VALID [2022-04-28 10:20:52,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {1168#false} assume !false; {1168#false} is VALID [2022-04-28 10:20:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:20:52,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:20:52,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158115801] [2022-04-28 10:20:52,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158115801] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:20:52,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222905468] [2022-04-28 10:20:52,270 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:20:52,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:20:52,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:20:52,272 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:20:52,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 10:20:52,332 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:20:52,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:20:52,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:20:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:52,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:20:52,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {1167#true} call ULTIMATE.init(); {1167#true} is VALID [2022-04-28 10:20:52,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {1167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1167#true} is VALID [2022-04-28 10:20:52,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {1167#true} assume true; {1167#true} is VALID [2022-04-28 10:20:52,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1167#true} {1167#true} #85#return; {1167#true} is VALID [2022-04-28 10:20:52,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {1167#true} call #t~ret9 := main(); {1167#true} is VALID [2022-04-28 10:20:52,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {1167#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {1167#true} is VALID [2022-04-28 10:20:52,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {1167#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {1167#true} is VALID [2022-04-28 10:20:52,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {1167#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {1167#true} is VALID [2022-04-28 10:20:52,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {1167#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {1167#true} is VALID [2022-04-28 10:20:52,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {1167#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {1167#true} is VALID [2022-04-28 10:20:52,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {1167#true} assume !!(~v~0 % 4294967296 < 10); {1167#true} is VALID [2022-04-28 10:20:52,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {1167#true} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1167#true} is VALID [2022-04-28 10:20:52,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {1167#true} assume !!(~v~0 % 4294967296 < 10); {1216#(< (mod main_~v~0 4294967296) 10)} is VALID [2022-04-28 10:20:52,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {1216#(< (mod main_~v~0 4294967296) 10)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1220#(< (mod (+ main_~v~0 4294967295) 4294967296) 10)} is VALID [2022-04-28 10:20:52,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {1220#(< (mod (+ main_~v~0 4294967295) 4294967296) 10)} assume !!(~v~0 % 4294967296 < 10); {1220#(< (mod (+ main_~v~0 4294967295) 4294967296) 10)} is VALID [2022-04-28 10:20:52,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {1220#(< (mod (+ main_~v~0 4294967295) 4294967296) 10)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1227#(< (mod (+ main_~v~0 4294967294) 4294967296) 10)} is VALID [2022-04-28 10:20:52,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {1227#(< (mod (+ main_~v~0 4294967294) 4294967296) 10)} assume !(~v~0 % 4294967296 < 10); {1231#(and (< (mod (+ main_~v~0 4294967294) 4294967296) 10) (not (< (mod main_~v~0 4294967296) 10)))} is VALID [2022-04-28 10:20:52,883 INFO L272 TraceCheckUtils]: 17: Hoare triple {1231#(and (< (mod (+ main_~v~0 4294967294) 4294967296) 10) (not (< (mod main_~v~0 4294967296) 10)))} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {1235#(and (<= 0 |__VERIFIER_assert_#in~cond|) (< (div (+ (* (- 1) (div (+ (- 2) |__VERIFIER_assert_#in~cond|) (- 4))) (div (+ 4294967295 (* (- 1) |__VERIFIER_assert_#in~cond|)) 4)) (- 1073741824)) (+ (div (+ (div (+ (* (- 1) |__VERIFIER_assert_#in~cond|) 11) 4) (* (- 1) (div (+ |__VERIFIER_assert_#in~cond| (- 10)) (- 4)))) 1073741824) 1)) (< |__VERIFIER_assert_#in~cond| 4))} is VALID [2022-04-28 10:20:52,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {1235#(and (<= 0 |__VERIFIER_assert_#in~cond|) (< (div (+ (* (- 1) (div (+ (- 2) |__VERIFIER_assert_#in~cond|) (- 4))) (div (+ 4294967295 (* (- 1) |__VERIFIER_assert_#in~cond|)) 4)) (- 1073741824)) (+ (div (+ (div (+ (* (- 1) |__VERIFIER_assert_#in~cond|) 11) 4) (* (- 1) (div (+ |__VERIFIER_assert_#in~cond| (- 10)) (- 4)))) 1073741824) 1)) (< |__VERIFIER_assert_#in~cond| 4))} ~cond := #in~cond; {1239#(and (< __VERIFIER_assert_~cond 4) (< (div (+ (* (- 1) (div (+ (- 2) __VERIFIER_assert_~cond) (- 4))) (div (+ 4294967295 (* (- 1) __VERIFIER_assert_~cond)) 4)) (- 1073741824)) (+ (div (+ (div (+ 11 (* (- 1) __VERIFIER_assert_~cond)) 4) (* (- 1) (div (+ (- 10) __VERIFIER_assert_~cond) (- 4)))) 1073741824) 1)) (<= 0 __VERIFIER_assert_~cond))} is VALID [2022-04-28 10:20:52,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {1239#(and (< __VERIFIER_assert_~cond 4) (< (div (+ (* (- 1) (div (+ (- 2) __VERIFIER_assert_~cond) (- 4))) (div (+ 4294967295 (* (- 1) __VERIFIER_assert_~cond)) 4)) (- 1073741824)) (+ (div (+ (div (+ 11 (* (- 1) __VERIFIER_assert_~cond)) 4) (* (- 1) (div (+ (- 10) __VERIFIER_assert_~cond) (- 4)))) 1073741824) 1)) (<= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1168#false} is VALID [2022-04-28 10:20:52,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {1168#false} assume !false; {1168#false} is VALID [2022-04-28 10:20:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:20:52,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:20:53,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {1168#false} assume !false; {1168#false} is VALID [2022-04-28 10:20:53,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {1249#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1168#false} is VALID [2022-04-28 10:20:53,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {1253#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1249#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:20:53,321 INFO L272 TraceCheckUtils]: 17: Hoare triple {1257#(not (= (mod main_~v~0 4) 0))} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {1253#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:20:53,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {1261#(or (< (mod main_~v~0 4294967296) 10) (not (= (mod main_~v~0 4) 0)))} assume !(~v~0 % 4294967296 < 10); {1257#(not (= (mod main_~v~0 4) 0))} is VALID [2022-04-28 10:20:53,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {1265#(or (< (mod (+ main_~v~0 1) 4294967296) 10) (not (= (mod (+ main_~v~0 1) 4) 0)))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1261#(or (< (mod main_~v~0 4294967296) 10) (not (= (mod main_~v~0 4) 0)))} is VALID [2022-04-28 10:20:53,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {1265#(or (< (mod (+ main_~v~0 1) 4294967296) 10) (not (= (mod (+ main_~v~0 1) 4) 0)))} assume !!(~v~0 % 4294967296 < 10); {1265#(or (< (mod (+ main_~v~0 1) 4294967296) 10) (not (= (mod (+ main_~v~0 1) 4) 0)))} is VALID [2022-04-28 10:20:53,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {1272#(or (< (mod (+ main_~v~0 2) 4294967296) 10) (not (= (mod (+ main_~v~0 2) 4) 0)))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1265#(or (< (mod (+ main_~v~0 1) 4294967296) 10) (not (= (mod (+ main_~v~0 1) 4) 0)))} is VALID [2022-04-28 10:20:53,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {1167#true} assume !!(~v~0 % 4294967296 < 10); {1272#(or (< (mod (+ main_~v~0 2) 4294967296) 10) (not (= (mod (+ main_~v~0 2) 4) 0)))} is VALID [2022-04-28 10:20:53,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {1167#true} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1167#true} is VALID [2022-04-28 10:20:53,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {1167#true} assume !!(~v~0 % 4294967296 < 10); {1167#true} is VALID [2022-04-28 10:20:53,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {1167#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {1167#true} is VALID [2022-04-28 10:20:53,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {1167#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {1167#true} is VALID [2022-04-28 10:20:53,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {1167#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {1167#true} is VALID [2022-04-28 10:20:53,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {1167#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {1167#true} is VALID [2022-04-28 10:20:53,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {1167#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {1167#true} is VALID [2022-04-28 10:20:53,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {1167#true} call #t~ret9 := main(); {1167#true} is VALID [2022-04-28 10:20:53,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1167#true} {1167#true} #85#return; {1167#true} is VALID [2022-04-28 10:20:53,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {1167#true} assume true; {1167#true} is VALID [2022-04-28 10:20:53,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {1167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1167#true} is VALID [2022-04-28 10:20:53,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {1167#true} call ULTIMATE.init(); {1167#true} is VALID [2022-04-28 10:20:53,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:20:53,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222905468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:20:53,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:20:53,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2022-04-28 10:20:53,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:20:53,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [620822665] [2022-04-28 10:20:53,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [620822665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:20:53,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:20:53,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:20:53,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423443369] [2022-04-28 10:20:53,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:20:53,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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 21 [2022-04-28 10:20:53,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:20:53,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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 10:20:53,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:53,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:20:53,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:53,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:20:53,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:20:53,364 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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 10:20:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:53,624 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-04-28 10:20:53,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:20:53,624 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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 21 [2022-04-28 10:20:53,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:20:53,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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 10:20:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-28 10:20:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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 10:20:53,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-28 10:20:53,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-28 10:20:53,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:53,688 INFO L225 Difference]: With dead ends: 60 [2022-04-28 10:20:53,688 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 10:20:53,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:20:53,689 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 56 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:20:53,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 41 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:20:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 10:20:53,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-04-28 10:20:53,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:20:53,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:53,705 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:53,705 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:53,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:53,707 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-28 10:20:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-28 10:20:53,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:53,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:53,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 38 states. [2022-04-28 10:20:53,708 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 38 states. [2022-04-28 10:20:53,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:53,709 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-28 10:20:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-28 10:20:53,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:53,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:53,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:20:53,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:20:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-28 10:20:53,710 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 21 [2022-04-28 10:20:53,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:20:53,711 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-28 10:20:53,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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 10:20:53,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2022-04-28 10:20:53,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-28 10:20:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:20:53,750 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:20:53,750 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:20:53,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 10:20:53,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:20:53,954 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:20:53,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:20:53,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1312242250, now seen corresponding path program 7 times [2022-04-28 10:20:53,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:53,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [592227192] [2022-04-28 10:20:53,961 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:20:53,961 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:20:53,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1312242250, now seen corresponding path program 8 times [2022-04-28 10:20:53,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:20:53,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917108838] [2022-04-28 10:20:53,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:20:53,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:20:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:54,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:20:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:54,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {1589#(and (= |#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(12, 2);call #Ultimate.allocInit(12, 3); {1579#true} is VALID [2022-04-28 10:20:54,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {1579#true} assume true; {1579#true} is VALID [2022-04-28 10:20:54,058 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1579#true} {1579#true} #85#return; {1579#true} is VALID [2022-04-28 10:20:54,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {1579#true} call ULTIMATE.init(); {1589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:20:54,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {1589#(and (= |#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(12, 2);call #Ultimate.allocInit(12, 3); {1579#true} is VALID [2022-04-28 10:20:54,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {1579#true} assume true; {1579#true} is VALID [2022-04-28 10:20:54,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1579#true} {1579#true} #85#return; {1579#true} is VALID [2022-04-28 10:20:54,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {1579#true} call #t~ret9 := main(); {1579#true} is VALID [2022-04-28 10:20:54,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {1579#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {1579#true} is VALID [2022-04-28 10:20:54,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {1579#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {1579#true} is VALID [2022-04-28 10:20:54,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {1579#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {1579#true} is VALID [2022-04-28 10:20:54,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {1579#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {1579#true} is VALID [2022-04-28 10:20:54,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {1579#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {1584#(= main_~v~0 0)} is VALID [2022-04-28 10:20:54,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {1584#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 10); {1584#(= main_~v~0 0)} is VALID [2022-04-28 10:20:54,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {1584#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1585#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-28 10:20:54,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {1585#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {1585#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-28 10:20:54,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {1585#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1586#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-28 10:20:54,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {1586#(and (<= 2 main_~v~0) (<= main_~v~0 2))} assume !!(~v~0 % 4294967296 < 10); {1586#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-28 10:20:54,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {1586#(and (<= 2 main_~v~0) (<= main_~v~0 2))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1587#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-28 10:20:54,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {1587#(and (<= main_~v~0 3) (<= 3 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {1587#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-28 10:20:54,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {1587#(and (<= main_~v~0 3) (<= 3 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1588#(and (<= main_~v~0 4) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:20:54,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {1588#(and (<= main_~v~0 4) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} assume !(~v~0 % 4294967296 < 10); {1580#false} is VALID [2022-04-28 10:20:54,064 INFO L272 TraceCheckUtils]: 19: Hoare triple {1580#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {1580#false} is VALID [2022-04-28 10:20:54,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {1580#false} ~cond := #in~cond; {1580#false} is VALID [2022-04-28 10:20:54,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {1580#false} assume 0 == ~cond; {1580#false} is VALID [2022-04-28 10:20:54,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {1580#false} assume !false; {1580#false} is VALID [2022-04-28 10:20:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:20:54,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:20:54,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917108838] [2022-04-28 10:20:54,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917108838] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:20:54,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188272159] [2022-04-28 10:20:54,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:20:54,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:20:54,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:20:54,067 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:20:54,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 10:20:54,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:20:54,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:20:54,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:20:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:54,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:20:54,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {1579#true} call ULTIMATE.init(); {1579#true} is VALID [2022-04-28 10:20:54,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {1579#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1579#true} is VALID [2022-04-28 10:20:54,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {1579#true} assume true; {1579#true} is VALID [2022-04-28 10:20:54,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1579#true} {1579#true} #85#return; {1579#true} is VALID [2022-04-28 10:20:54,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {1579#true} call #t~ret9 := main(); {1579#true} is VALID [2022-04-28 10:20:54,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {1579#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {1579#true} is VALID [2022-04-28 10:20:54,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {1579#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {1579#true} is VALID [2022-04-28 10:20:54,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {1579#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {1579#true} is VALID [2022-04-28 10:20:54,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {1579#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {1579#true} is VALID [2022-04-28 10:20:54,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {1579#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {1584#(= main_~v~0 0)} is VALID [2022-04-28 10:20:54,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {1584#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 10); {1584#(= main_~v~0 0)} is VALID [2022-04-28 10:20:54,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {1584#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1585#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-28 10:20:54,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {1585#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {1585#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-28 10:20:54,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {1585#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1586#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-28 10:20:54,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {1586#(and (<= 2 main_~v~0) (<= main_~v~0 2))} assume !!(~v~0 % 4294967296 < 10); {1586#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-28 10:20:54,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {1586#(and (<= 2 main_~v~0) (<= main_~v~0 2))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1587#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-28 10:20:54,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {1587#(and (<= main_~v~0 3) (<= 3 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {1587#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-28 10:20:54,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {1587#(and (<= main_~v~0 3) (<= 3 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1644#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-28 10:20:54,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {1644#(and (<= main_~v~0 4) (<= 4 main_~v~0))} assume !(~v~0 % 4294967296 < 10); {1580#false} is VALID [2022-04-28 10:20:54,408 INFO L272 TraceCheckUtils]: 19: Hoare triple {1580#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {1580#false} is VALID [2022-04-28 10:20:54,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {1580#false} ~cond := #in~cond; {1580#false} is VALID [2022-04-28 10:20:54,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {1580#false} assume 0 == ~cond; {1580#false} is VALID [2022-04-28 10:20:54,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {1580#false} assume !false; {1580#false} is VALID [2022-04-28 10:20:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:20:54,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:20:54,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {1580#false} assume !false; {1580#false} is VALID [2022-04-28 10:20:54,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {1580#false} assume 0 == ~cond; {1580#false} is VALID [2022-04-28 10:20:54,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {1580#false} ~cond := #in~cond; {1580#false} is VALID [2022-04-28 10:20:54,571 INFO L272 TraceCheckUtils]: 19: Hoare triple {1580#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {1580#false} is VALID [2022-04-28 10:20:54,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {1672#(< (mod main_~v~0 4294967296) 10)} assume !(~v~0 % 4294967296 < 10); {1580#false} is VALID [2022-04-28 10:20:54,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {1676#(< (mod (+ main_~v~0 1) 4294967296) 10)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1672#(< (mod main_~v~0 4294967296) 10)} is VALID [2022-04-28 10:20:54,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {1676#(< (mod (+ main_~v~0 1) 4294967296) 10)} assume !!(~v~0 % 4294967296 < 10); {1676#(< (mod (+ main_~v~0 1) 4294967296) 10)} is VALID [2022-04-28 10:20:54,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {1683#(< (mod (+ main_~v~0 2) 4294967296) 10)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1676#(< (mod (+ main_~v~0 1) 4294967296) 10)} is VALID [2022-04-28 10:20:54,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {1683#(< (mod (+ main_~v~0 2) 4294967296) 10)} assume !!(~v~0 % 4294967296 < 10); {1683#(< (mod (+ main_~v~0 2) 4294967296) 10)} is VALID [2022-04-28 10:20:54,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {1690#(< (mod (+ main_~v~0 3) 4294967296) 10)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1683#(< (mod (+ main_~v~0 2) 4294967296) 10)} is VALID [2022-04-28 10:20:54,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {1690#(< (mod (+ main_~v~0 3) 4294967296) 10)} assume !!(~v~0 % 4294967296 < 10); {1690#(< (mod (+ main_~v~0 3) 4294967296) 10)} is VALID [2022-04-28 10:20:54,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {1697#(< (mod (+ main_~v~0 4) 4294967296) 10)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1690#(< (mod (+ main_~v~0 3) 4294967296) 10)} is VALID [2022-04-28 10:20:54,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {1697#(< (mod (+ main_~v~0 4) 4294967296) 10)} assume !!(~v~0 % 4294967296 < 10); {1697#(< (mod (+ main_~v~0 4) 4294967296) 10)} is VALID [2022-04-28 10:20:54,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {1579#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {1697#(< (mod (+ main_~v~0 4) 4294967296) 10)} is VALID [2022-04-28 10:20:54,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {1579#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {1579#true} is VALID [2022-04-28 10:20:54,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {1579#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {1579#true} is VALID [2022-04-28 10:20:54,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {1579#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {1579#true} is VALID [2022-04-28 10:20:54,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {1579#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {1579#true} is VALID [2022-04-28 10:20:54,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {1579#true} call #t~ret9 := main(); {1579#true} is VALID [2022-04-28 10:20:54,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1579#true} {1579#true} #85#return; {1579#true} is VALID [2022-04-28 10:20:54,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {1579#true} assume true; {1579#true} is VALID [2022-04-28 10:20:54,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {1579#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1579#true} is VALID [2022-04-28 10:20:54,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {1579#true} call ULTIMATE.init(); {1579#true} is VALID [2022-04-28 10:20:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:20:54,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188272159] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:20:54,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:20:54,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 10:20:54,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:20:54,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [592227192] [2022-04-28 10:20:54,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [592227192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:20:54,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:20:54,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:20:54,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67652892] [2022-04-28 10:20:54,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:20:54,578 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 23 [2022-04-28 10:20:54,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:20:54,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 10:20:54,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:54,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:20:54,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:54,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:20:54,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:20:54,595 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 10:20:54,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:54,925 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2022-04-28 10:20:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:20:54,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 23 [2022-04-28 10:20:54,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:20:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 10:20:54,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2022-04-28 10:20:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 10:20:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2022-04-28 10:20:54,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 69 transitions. [2022-04-28 10:20:54,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:54,981 INFO L225 Difference]: With dead ends: 64 [2022-04-28 10:20:54,981 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 10:20:54,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:20:54,984 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:20:54,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 46 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:20:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 10:20:55,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2022-04-28 10:20:55,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:20:55,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:55,013 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:55,013 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:55,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:55,014 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-28 10:20:55,014 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-28 10:20:55,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:55,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:55,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 40 states. [2022-04-28 10:20:55,015 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 40 states. [2022-04-28 10:20:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:55,016 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-28 10:20:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-28 10:20:55,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:55,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:55,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:20:55,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:20:55,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-28 10:20:55,018 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-28 10:20:55,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:20:55,018 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-28 10:20:55,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 10:20:55,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-28 10:20:55,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-28 10:20:55,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:20:55,055 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:20:55,056 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:20:55,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 10:20:55,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:20:55,264 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:20:55,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:20:55,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2006417516, now seen corresponding path program 9 times [2022-04-28 10:20:55,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:55,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [795930340] [2022-04-28 10:20:55,269 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:20:55,269 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:20:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2006417516, now seen corresponding path program 10 times [2022-04-28 10:20:55,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:20:55,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711195131] [2022-04-28 10:20:55,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:20:55,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:20:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:55,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:20:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:55,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {2027#(and (= |#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(12, 2);call #Ultimate.allocInit(12, 3); {2016#true} is VALID [2022-04-28 10:20:55,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {2016#true} assume true; {2016#true} is VALID [2022-04-28 10:20:55,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2016#true} {2016#true} #85#return; {2016#true} is VALID [2022-04-28 10:20:55,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {2016#true} call ULTIMATE.init(); {2027#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:20:55,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {2027#(and (= |#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(12, 2);call #Ultimate.allocInit(12, 3); {2016#true} is VALID [2022-04-28 10:20:55,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {2016#true} assume true; {2016#true} is VALID [2022-04-28 10:20:55,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2016#true} {2016#true} #85#return; {2016#true} is VALID [2022-04-28 10:20:55,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {2016#true} call #t~ret9 := main(); {2016#true} is VALID [2022-04-28 10:20:55,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {2016#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {2016#true} is VALID [2022-04-28 10:20:55,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {2016#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {2016#true} is VALID [2022-04-28 10:20:55,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {2016#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {2016#true} is VALID [2022-04-28 10:20:55,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {2016#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {2016#true} is VALID [2022-04-28 10:20:55,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {2016#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {2021#(= main_~v~0 0)} is VALID [2022-04-28 10:20:55,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {2021#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 10); {2021#(= main_~v~0 0)} is VALID [2022-04-28 10:20:55,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {2021#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2022#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-28 10:20:55,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {2022#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {2022#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-28 10:20:55,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {2022#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2023#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-28 10:20:55,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {2023#(and (<= 2 main_~v~0) (<= main_~v~0 2))} assume !!(~v~0 % 4294967296 < 10); {2023#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-28 10:20:55,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {2023#(and (<= 2 main_~v~0) (<= main_~v~0 2))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2024#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-28 10:20:55,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {2024#(and (<= main_~v~0 3) (<= 3 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {2024#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-28 10:20:55,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {2024#(and (<= main_~v~0 3) (<= 3 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2025#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-28 10:20:55,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {2025#(and (<= main_~v~0 4) (<= 4 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {2025#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-28 10:20:55,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {2025#(and (<= main_~v~0 4) (<= 4 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2026#(and (not (<= (+ (div main_~v~0 4294967296) 1) 0)) (<= main_~v~0 5))} is VALID [2022-04-28 10:20:55,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {2026#(and (not (<= (+ (div main_~v~0 4294967296) 1) 0)) (<= main_~v~0 5))} assume !(~v~0 % 4294967296 < 10); {2017#false} is VALID [2022-04-28 10:20:55,386 INFO L272 TraceCheckUtils]: 21: Hoare triple {2017#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {2017#false} is VALID [2022-04-28 10:20:55,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {2017#false} ~cond := #in~cond; {2017#false} is VALID [2022-04-28 10:20:55,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {2017#false} assume 0 == ~cond; {2017#false} is VALID [2022-04-28 10:20:55,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#false} assume !false; {2017#false} is VALID [2022-04-28 10:20:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:20:55,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:20:55,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711195131] [2022-04-28 10:20:55,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711195131] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:20:55,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364224452] [2022-04-28 10:20:55,387 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:20:55,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:20:55,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:20:55,388 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:20:55,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 10:20:55,450 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:20:55,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:20:55,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:20:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:55,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:20:55,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {2016#true} call ULTIMATE.init(); {2016#true} is VALID [2022-04-28 10:20:55,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {2016#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2016#true} is VALID [2022-04-28 10:20:55,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {2016#true} assume true; {2016#true} is VALID [2022-04-28 10:20:55,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2016#true} {2016#true} #85#return; {2016#true} is VALID [2022-04-28 10:20:55,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {2016#true} call #t~ret9 := main(); {2016#true} is VALID [2022-04-28 10:20:55,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {2016#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {2016#true} is VALID [2022-04-28 10:20:55,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {2016#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {2016#true} is VALID [2022-04-28 10:20:55,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {2016#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {2016#true} is VALID [2022-04-28 10:20:55,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {2016#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {2016#true} is VALID [2022-04-28 10:20:55,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {2016#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {2021#(= main_~v~0 0)} is VALID [2022-04-28 10:20:55,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {2021#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 10); {2021#(= main_~v~0 0)} is VALID [2022-04-28 10:20:55,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {2021#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2022#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-28 10:20:55,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {2022#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {2022#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-28 10:20:55,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {2022#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2023#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-28 10:20:55,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {2023#(and (<= 2 main_~v~0) (<= main_~v~0 2))} assume !!(~v~0 % 4294967296 < 10); {2023#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-28 10:20:56,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {2023#(and (<= 2 main_~v~0) (<= main_~v~0 2))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2024#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-28 10:20:56,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {2024#(and (<= main_~v~0 3) (<= 3 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {2024#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-28 10:20:56,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {2024#(and (<= main_~v~0 3) (<= 3 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2025#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-28 10:20:56,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {2025#(and (<= main_~v~0 4) (<= 4 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {2025#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-28 10:20:56,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {2025#(and (<= main_~v~0 4) (<= 4 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2088#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-28 10:20:56,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {2088#(and (<= main_~v~0 5) (<= 5 main_~v~0))} assume !(~v~0 % 4294967296 < 10); {2088#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-28 10:20:56,009 INFO L272 TraceCheckUtils]: 21: Hoare triple {2088#(and (<= main_~v~0 5) (<= 5 main_~v~0))} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {2095#(<= (div (+ |__VERIFIER_assert_#in~cond| (- 5)) (- 4)) 1)} is VALID [2022-04-28 10:20:56,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {2095#(<= (div (+ |__VERIFIER_assert_#in~cond| (- 5)) (- 4)) 1)} ~cond := #in~cond; {2099#(<= (div (+ (- 5) __VERIFIER_assert_~cond) (- 4)) 1)} is VALID [2022-04-28 10:20:56,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {2099#(<= (div (+ (- 5) __VERIFIER_assert_~cond) (- 4)) 1)} assume 0 == ~cond; {2017#false} is VALID [2022-04-28 10:20:56,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#false} assume !false; {2017#false} is VALID [2022-04-28 10:20:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:20:56,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:20:56,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#false} assume !false; {2017#false} is VALID [2022-04-28 10:20:56,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {2099#(<= (div (+ (- 5) __VERIFIER_assert_~cond) (- 4)) 1)} assume 0 == ~cond; {2017#false} is VALID [2022-04-28 10:20:56,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {2095#(<= (div (+ |__VERIFIER_assert_#in~cond| (- 5)) (- 4)) 1)} ~cond := #in~cond; {2099#(<= (div (+ (- 5) __VERIFIER_assert_~cond) (- 4)) 1)} is VALID [2022-04-28 10:20:56,445 INFO L272 TraceCheckUtils]: 21: Hoare triple {2115#(<= (div (+ (- 9) (mod main_~v~0 4)) (- 4)) 2)} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {2095#(<= (div (+ |__VERIFIER_assert_#in~cond| (- 5)) (- 4)) 1)} is VALID [2022-04-28 10:20:56,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {2115#(<= (div (+ (- 9) (mod main_~v~0 4)) (- 4)) 2)} assume !(~v~0 % 4294967296 < 10); {2115#(<= (div (+ (- 9) (mod main_~v~0 4)) (- 4)) 2)} is VALID [2022-04-28 10:20:56,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {2122#(<= (div (+ (- 9) (mod (+ main_~v~0 1) 4)) (- 4)) 2)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2115#(<= (div (+ (- 9) (mod main_~v~0 4)) (- 4)) 2)} is VALID [2022-04-28 10:20:56,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {2122#(<= (div (+ (- 9) (mod (+ main_~v~0 1) 4)) (- 4)) 2)} assume !!(~v~0 % 4294967296 < 10); {2122#(<= (div (+ (- 9) (mod (+ main_~v~0 1) 4)) (- 4)) 2)} is VALID [2022-04-28 10:20:56,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {2129#(<= (div (+ (- 9) (mod (+ main_~v~0 2) 4)) (- 4)) 2)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2122#(<= (div (+ (- 9) (mod (+ main_~v~0 1) 4)) (- 4)) 2)} is VALID [2022-04-28 10:20:56,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {2129#(<= (div (+ (- 9) (mod (+ main_~v~0 2) 4)) (- 4)) 2)} assume !!(~v~0 % 4294967296 < 10); {2129#(<= (div (+ (- 9) (mod (+ main_~v~0 2) 4)) (- 4)) 2)} is VALID [2022-04-28 10:20:56,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {2136#(<= (div (+ (- 9) (mod (+ main_~v~0 3) 4)) (- 4)) 2)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2129#(<= (div (+ (- 9) (mod (+ main_~v~0 2) 4)) (- 4)) 2)} is VALID [2022-04-28 10:20:56,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {2136#(<= (div (+ (- 9) (mod (+ main_~v~0 3) 4)) (- 4)) 2)} assume !!(~v~0 % 4294967296 < 10); {2136#(<= (div (+ (- 9) (mod (+ main_~v~0 3) 4)) (- 4)) 2)} is VALID [2022-04-28 10:20:56,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {2115#(<= (div (+ (- 9) (mod main_~v~0 4)) (- 4)) 2)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2136#(<= (div (+ (- 9) (mod (+ main_~v~0 3) 4)) (- 4)) 2)} is VALID [2022-04-28 10:20:56,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {2115#(<= (div (+ (- 9) (mod main_~v~0 4)) (- 4)) 2)} assume !!(~v~0 % 4294967296 < 10); {2115#(<= (div (+ (- 9) (mod main_~v~0 4)) (- 4)) 2)} is VALID [2022-04-28 10:20:56,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {2122#(<= (div (+ (- 9) (mod (+ main_~v~0 1) 4)) (- 4)) 2)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2115#(<= (div (+ (- 9) (mod main_~v~0 4)) (- 4)) 2)} is VALID [2022-04-28 10:20:56,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {2122#(<= (div (+ (- 9) (mod (+ main_~v~0 1) 4)) (- 4)) 2)} assume !!(~v~0 % 4294967296 < 10); {2122#(<= (div (+ (- 9) (mod (+ main_~v~0 1) 4)) (- 4)) 2)} is VALID [2022-04-28 10:20:56,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {2016#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {2122#(<= (div (+ (- 9) (mod (+ main_~v~0 1) 4)) (- 4)) 2)} is VALID [2022-04-28 10:20:56,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {2016#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {2016#true} is VALID [2022-04-28 10:20:56,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {2016#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {2016#true} is VALID [2022-04-28 10:20:56,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {2016#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {2016#true} is VALID [2022-04-28 10:20:56,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {2016#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {2016#true} is VALID [2022-04-28 10:20:56,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {2016#true} call #t~ret9 := main(); {2016#true} is VALID [2022-04-28 10:20:56,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2016#true} {2016#true} #85#return; {2016#true} is VALID [2022-04-28 10:20:56,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {2016#true} assume true; {2016#true} is VALID [2022-04-28 10:20:56,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {2016#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2016#true} is VALID [2022-04-28 10:20:56,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {2016#true} call ULTIMATE.init(); {2016#true} is VALID [2022-04-28 10:20:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:20:56,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364224452] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:20:56,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:20:56,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2022-04-28 10:20:56,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:20:56,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [795930340] [2022-04-28 10:20:56,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [795930340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:20:56,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:20:56,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:20:56,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918388209] [2022-04-28 10:20:56,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:20:56,454 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 25 [2022-04-28 10:20:56,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:20:56,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 10:20:56,474 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 10:20:56,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:20:56,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:56,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:20:56,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:20:56,475 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 10:20:56,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:56,831 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-04-28 10:20:56,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:20:56,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 25 [2022-04-28 10:20:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:20:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 10:20:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-28 10:20:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 10:20:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-28 10:20:56,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 71 transitions. [2022-04-28 10:20:56,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:56,911 INFO L225 Difference]: With dead ends: 68 [2022-04-28 10:20:56,911 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 10:20:56,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:20:56,913 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 60 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:20:56,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 41 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:20:56,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 10:20:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-04-28 10:20:56,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:20:56,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:56,949 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:56,950 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:56,951 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-28 10:20:56,951 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-28 10:20:56,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:56,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:56,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 42 states. [2022-04-28 10:20:56,951 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 42 states. [2022-04-28 10:20:56,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:56,954 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-28 10:20:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-28 10:20:56,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:56,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:56,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:20:56,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:20:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:20:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-28 10:20:56,955 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 25 [2022-04-28 10:20:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:20:56,956 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-28 10:20:56,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 10:20:56,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-28 10:20:56,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:56,998 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-28 10:20:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:20:56,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:20:56,998 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:20:57,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 10:20:57,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:20:57,221 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:20:57,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:20:57,222 INFO L85 PathProgramCache]: Analyzing trace with hash 906050034, now seen corresponding path program 11 times [2022-04-28 10:20:57,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:57,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1994561217] [2022-04-28 10:20:57,224 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:20:57,225 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:20:57,225 INFO L85 PathProgramCache]: Analyzing trace with hash 906050034, now seen corresponding path program 12 times [2022-04-28 10:20:57,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:20:57,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697099527] [2022-04-28 10:20:57,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:20:57,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:20:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:57,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:20:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:57,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {2497#(and (= |#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(12, 2);call #Ultimate.allocInit(12, 3); {2485#true} is VALID [2022-04-28 10:20:57,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {2485#true} assume true; {2485#true} is VALID [2022-04-28 10:20:57,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2485#true} {2485#true} #85#return; {2485#true} is VALID [2022-04-28 10:20:57,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {2485#true} call ULTIMATE.init(); {2497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:20:57,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {2497#(and (= |#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(12, 2);call #Ultimate.allocInit(12, 3); {2485#true} is VALID [2022-04-28 10:20:57,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {2485#true} assume true; {2485#true} is VALID [2022-04-28 10:20:57,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2485#true} {2485#true} #85#return; {2485#true} is VALID [2022-04-28 10:20:57,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {2485#true} call #t~ret9 := main(); {2485#true} is VALID [2022-04-28 10:20:57,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {2485#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {2485#true} is VALID [2022-04-28 10:20:57,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {2485#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {2485#true} is VALID [2022-04-28 10:20:57,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {2485#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {2485#true} is VALID [2022-04-28 10:20:57,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {2485#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {2485#true} is VALID [2022-04-28 10:20:57,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {2485#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {2490#(= main_~v~0 0)} is VALID [2022-04-28 10:20:57,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {2490#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 10); {2490#(= main_~v~0 0)} is VALID [2022-04-28 10:20:57,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {2490#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2491#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-28 10:20:57,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {2491#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {2491#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-28 10:20:57,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {2491#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2492#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-28 10:20:57,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {2492#(and (<= 2 main_~v~0) (<= main_~v~0 2))} assume !!(~v~0 % 4294967296 < 10); {2492#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-28 10:20:57,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {2492#(and (<= 2 main_~v~0) (<= main_~v~0 2))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2493#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-28 10:20:57,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {2493#(and (<= main_~v~0 3) (<= 3 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {2493#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-28 10:20:57,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {2493#(and (<= main_~v~0 3) (<= 3 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2494#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-28 10:20:57,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {2494#(and (<= main_~v~0 4) (<= 4 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {2494#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-28 10:20:57,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {2494#(and (<= main_~v~0 4) (<= 4 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2495#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-28 10:20:57,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {2495#(and (<= main_~v~0 5) (<= 5 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {2495#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-28 10:20:57,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {2495#(and (<= main_~v~0 5) (<= 5 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2496#(and (not (<= (+ (div main_~v~0 4294967296) 1) 0)) (<= main_~v~0 6))} is VALID [2022-04-28 10:20:57,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {2496#(and (not (<= (+ (div main_~v~0 4294967296) 1) 0)) (<= main_~v~0 6))} assume !(~v~0 % 4294967296 < 10); {2486#false} is VALID [2022-04-28 10:20:57,362 INFO L272 TraceCheckUtils]: 23: Hoare triple {2486#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {2486#false} is VALID [2022-04-28 10:20:57,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {2486#false} ~cond := #in~cond; {2486#false} is VALID [2022-04-28 10:20:57,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {2486#false} assume 0 == ~cond; {2486#false} is VALID [2022-04-28 10:20:57,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {2486#false} assume !false; {2486#false} is VALID [2022-04-28 10:20:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:20:57,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:20:57,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697099527] [2022-04-28 10:20:57,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697099527] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:20:57,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900194751] [2022-04-28 10:20:57,363 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:20:57,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:20:57,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:20:57,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:20:57,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 10:20:57,419 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:20:57,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:20:57,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:20:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:57,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:20:57,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {2485#true} call ULTIMATE.init(); {2485#true} is VALID [2022-04-28 10:20:57,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {2485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2485#true} is VALID [2022-04-28 10:20:57,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {2485#true} assume true; {2485#true} is VALID [2022-04-28 10:20:57,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2485#true} {2485#true} #85#return; {2485#true} is VALID [2022-04-28 10:20:57,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {2485#true} call #t~ret9 := main(); {2485#true} is VALID [2022-04-28 10:20:57,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {2485#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {2485#true} is VALID [2022-04-28 10:20:57,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {2485#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {2485#true} is VALID [2022-04-28 10:20:57,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {2485#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {2485#true} is VALID [2022-04-28 10:20:57,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {2485#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {2485#true} is VALID [2022-04-28 10:20:57,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {2485#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {2485#true} is VALID [2022-04-28 10:20:57,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {2485#true} assume !!(~v~0 % 4294967296 < 10); {2485#true} is VALID [2022-04-28 10:20:57,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {2485#true} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2485#true} is VALID [2022-04-28 10:20:57,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {2485#true} assume !!(~v~0 % 4294967296 < 10); {2485#true} is VALID [2022-04-28 10:20:57,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {2485#true} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2485#true} is VALID [2022-04-28 10:20:57,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {2485#true} assume !!(~v~0 % 4294967296 < 10); {2485#true} is VALID [2022-04-28 10:20:57,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {2485#true} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2485#true} is VALID [2022-04-28 10:20:57,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {2485#true} assume !!(~v~0 % 4294967296 < 10); {2485#true} is VALID [2022-04-28 10:20:57,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {2485#true} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2485#true} is VALID [2022-04-28 10:20:57,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {2485#true} assume !!(~v~0 % 4294967296 < 10); {2485#true} is VALID [2022-04-28 10:20:57,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {2485#true} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2485#true} is VALID [2022-04-28 10:20:57,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {2485#true} assume !!(~v~0 % 4294967296 < 10); {2561#(< (mod main_~v~0 4294967296) 10)} is VALID [2022-04-28 10:20:57,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {2561#(< (mod main_~v~0 4294967296) 10)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2565#(< (mod (+ main_~v~0 4294967295) 4294967296) 10)} is VALID [2022-04-28 10:20:57,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {2565#(< (mod (+ main_~v~0 4294967295) 4294967296) 10)} assume !(~v~0 % 4294967296 < 10); {2569#(and (not (< (mod main_~v~0 4294967296) 10)) (< (mod (+ main_~v~0 4294967295) 4294967296) 10))} is VALID [2022-04-28 10:20:57,991 INFO L272 TraceCheckUtils]: 23: Hoare triple {2569#(and (not (< (mod main_~v~0 4294967296) 10)) (< (mod (+ main_~v~0 4294967295) 4294967296) 10))} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {2573#(and (<= 0 |__VERIFIER_assert_#in~cond|) (< (div (+ (* (- 1) (div (+ |__VERIFIER_assert_#in~cond| (- 4294967306)) (- 4))) (div (+ (* (- 1) |__VERIFIER_assert_#in~cond|) 10) 4)) (- 1073741824)) (+ (div (+ (* (- 1) (div (+ (- 1) |__VERIFIER_assert_#in~cond|) (- 4))) (div (+ (* (- 1) |__VERIFIER_assert_#in~cond|) 8589934591) 4)) 1073741824) 1)) (< |__VERIFIER_assert_#in~cond| 4))} is VALID [2022-04-28 10:20:57,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {2573#(and (<= 0 |__VERIFIER_assert_#in~cond|) (< (div (+ (* (- 1) (div (+ |__VERIFIER_assert_#in~cond| (- 4294967306)) (- 4))) (div (+ (* (- 1) |__VERIFIER_assert_#in~cond|) 10) 4)) (- 1073741824)) (+ (div (+ (* (- 1) (div (+ (- 1) |__VERIFIER_assert_#in~cond|) (- 4))) (div (+ (* (- 1) |__VERIFIER_assert_#in~cond|) 8589934591) 4)) 1073741824) 1)) (< |__VERIFIER_assert_#in~cond| 4))} ~cond := #in~cond; {2577#(and (< __VERIFIER_assert_~cond 4) (<= 0 __VERIFIER_assert_~cond) (< (div (+ (* (- 1) (div (+ (- 4294967306) __VERIFIER_assert_~cond) (- 4))) (div (+ 10 (* (- 1) __VERIFIER_assert_~cond)) 4)) (- 1073741824)) (+ (div (+ (* (- 1) (div (+ (- 1) __VERIFIER_assert_~cond) (- 4))) (div (+ 8589934591 (* (- 1) __VERIFIER_assert_~cond)) 4)) 1073741824) 1)))} is VALID [2022-04-28 10:20:57,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {2577#(and (< __VERIFIER_assert_~cond 4) (<= 0 __VERIFIER_assert_~cond) (< (div (+ (* (- 1) (div (+ (- 4294967306) __VERIFIER_assert_~cond) (- 4))) (div (+ 10 (* (- 1) __VERIFIER_assert_~cond)) 4)) (- 1073741824)) (+ (div (+ (* (- 1) (div (+ (- 1) __VERIFIER_assert_~cond) (- 4))) (div (+ 8589934591 (* (- 1) __VERIFIER_assert_~cond)) 4)) 1073741824) 1)))} assume 0 == ~cond; {2486#false} is VALID [2022-04-28 10:20:57,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {2486#false} assume !false; {2486#false} is VALID [2022-04-28 10:20:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 10:20:57,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:20:57,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900194751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:20:57,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:20:57,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-04-28 10:20:57,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:20:57,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1994561217] [2022-04-28 10:20:57,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1994561217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:20:57,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:20:57,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:20:57,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119944744] [2022-04-28 10:20:57,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:20:57,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 27 [2022-04-28 10:20:57,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:20:57,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 10:20:58,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:58,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:20:58,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:58,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:20:58,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:20:58,829 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 10:20:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:59,557 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-28 10:20:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:20:59,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 27 [2022-04-28 10:20:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:20:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 10:20:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-28 10:20:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 10:20:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-28 10:20:59,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-28 10:20:59,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:59,671 INFO L225 Difference]: With dead ends: 41 [2022-04-28 10:20:59,671 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:20:59,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:20:59,672 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:20:59,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 129 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:20:59,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:20:59,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:20:59,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:20:59,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:20:59,673 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:20:59,673 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:20:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:59,673 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:20:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:20:59,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:59,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:59,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:20:59,673 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:20:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:59,673 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:20:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:20:59,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:59,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:59,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:20:59,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:20:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:20:59,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:20:59,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2022-04-28 10:20:59,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:20:59,674 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:20:59,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 10:20:59,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:20:59,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:20:59,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:59,677 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:20:59,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 10:20:59,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:20:59,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:21:00,905 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 10:21:00,905 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 10:21:00,905 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 10:21:00,905 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:21:00,905 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 10:21:00,906 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:21:00,906 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:21:00,906 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 10:21:00,906 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:21:00,906 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:21:00,906 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 12 27) the Hoare annotation is: true [2022-04-28 10:21:00,906 INFO L895 garLoopResultBuilder]: At program point L23-2(line 23) the Hoare annotation is: (or (= main_~v~0 0) (and (< (mod main_~v~0 4294967296) 10) (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) [2022-04-28 10:21:00,906 INFO L895 garLoopResultBuilder]: At program point L23-3(line 23) the Hoare annotation is: (or (= main_~v~0 0) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-28 10:21:00,906 INFO L895 garLoopResultBuilder]: At program point L23-4(line 23) the Hoare annotation is: (and (not (< (mod main_~v~0 4294967296) 10)) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-28 10:21:00,906 INFO L895 garLoopResultBuilder]: At program point L19-2(lines 19 25) the Hoare annotation is: (or (< (mod main_~v~0 4294967296) 10) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-28 10:21:00,906 INFO L895 garLoopResultBuilder]: At program point L19-3(lines 19 25) the Hoare annotation is: (or (< (mod main_~v~0 4294967296) 10) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-28 10:21:00,906 INFO L902 garLoopResultBuilder]: At program point L19-4(lines 19 25) the Hoare annotation is: true [2022-04-28 10:21:00,906 INFO L895 garLoopResultBuilder]: At program point L24(lines 22 25) the Hoare annotation is: (and (not (< (mod main_~v~0 4294967296) 10)) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-28 10:21:00,906 INFO L895 garLoopResultBuilder]: At program point L20-2(lines 20 25) the Hoare annotation is: (or (< (mod main_~v~0 4294967296) 10) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-28 10:21:00,906 INFO L895 garLoopResultBuilder]: At program point L20-3(lines 20 25) the Hoare annotation is: (or (< (mod main_~v~0 4294967296) 10) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-28 10:21:00,906 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: (or (< (mod main_~v~0 4294967296) 10) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-28 10:21:00,906 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 25) the Hoare annotation is: (or (< (mod main_~v~0 4294967296) 10) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-28 10:21:00,907 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 12 27) the Hoare annotation is: true [2022-04-28 10:21:00,907 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 12 27) the Hoare annotation is: true [2022-04-28 10:21:00,907 INFO L895 garLoopResultBuilder]: At program point L22-2(lines 22 25) the Hoare annotation is: (or (< (mod main_~v~0 4294967296) 10) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-28 10:21:00,907 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-28 10:21:00,907 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (or (not (<= 0 |__VERIFIER_assert_#in~cond|)) (and (< __VERIFIER_assert_~cond 4) (<= 0 __VERIFIER_assert_~cond) (let ((.cse0 (* (- 1) __VERIFIER_assert_~cond))) (< (div (+ (* (- 1) (div (+ (- 4294967306) __VERIFIER_assert_~cond) (- 4))) (div (+ 10 .cse0) 4)) (- 1073741824)) (+ (div (+ (* (- 1) (div (+ (- 1) __VERIFIER_assert_~cond) (- 4))) (div (+ 8589934591 .cse0) 4)) 1073741824) 1)))) (not (let ((.cse1 (* (- 1) |__VERIFIER_assert_#in~cond|))) (< (div (+ (* (- 1) (div (+ |__VERIFIER_assert_#in~cond| (- 4294967306)) (- 4))) (div (+ .cse1 10) 4)) (- 1073741824)) (+ (div (+ (* (- 1) (div (+ (- 1) |__VERIFIER_assert_#in~cond|) (- 4))) (div (+ .cse1 8589934591) 4)) 1073741824) 1)))) (not (< |__VERIFIER_assert_#in~cond| 4))) [2022-04-28 10:21:00,907 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (or (not (<= 0 |__VERIFIER_assert_#in~cond|)) (not (let ((.cse0 (* (- 1) |__VERIFIER_assert_#in~cond|))) (< (div (+ (* (- 1) (div (+ |__VERIFIER_assert_#in~cond| (- 4294967306)) (- 4))) (div (+ .cse0 10) 4)) (- 1073741824)) (+ (div (+ (* (- 1) (div (+ (- 1) |__VERIFIER_assert_#in~cond|) (- 4))) (div (+ .cse0 8589934591) 4)) 1073741824) 1)))) (not (< |__VERIFIER_assert_#in~cond| 4))) [2022-04-28 10:21:00,907 INFO L895 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (not (<= 0 |__VERIFIER_assert_#in~cond|)) (and (< __VERIFIER_assert_~cond 4) (<= 0 __VERIFIER_assert_~cond) (let ((.cse0 (* (- 1) __VERIFIER_assert_~cond))) (< (div (+ (* (- 1) (div (+ (- 4294967306) __VERIFIER_assert_~cond) (- 4))) (div (+ 10 .cse0) 4)) (- 1073741824)) (+ (div (+ (* (- 1) (div (+ (- 1) __VERIFIER_assert_~cond) (- 4))) (div (+ 8589934591 .cse0) 4)) 1073741824) 1)))) (not (let ((.cse1 (* (- 1) |__VERIFIER_assert_#in~cond|))) (< (div (+ (* (- 1) (div (+ |__VERIFIER_assert_#in~cond| (- 4294967306)) (- 4))) (div (+ .cse1 10) 4)) (- 1073741824)) (+ (div (+ (* (- 1) (div (+ (- 1) |__VERIFIER_assert_#in~cond|) (- 4))) (div (+ .cse1 8589934591) 4)) 1073741824) 1)))) (not (< |__VERIFIER_assert_#in~cond| 4))) [2022-04-28 10:21:00,907 INFO L895 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: (or (not (<= 0 |__VERIFIER_assert_#in~cond|)) (and (< __VERIFIER_assert_~cond 4) (<= 0 __VERIFIER_assert_~cond) (let ((.cse0 (* (- 1) __VERIFIER_assert_~cond))) (< (div (+ (* (- 1) (div (+ (- 4294967306) __VERIFIER_assert_~cond) (- 4))) (div (+ 10 .cse0) 4)) (- 1073741824)) (+ (div (+ (* (- 1) (div (+ (- 1) __VERIFIER_assert_~cond) (- 4))) (div (+ 8589934591 .cse0) 4)) 1073741824) 1)))) (not (let ((.cse1 (* (- 1) |__VERIFIER_assert_#in~cond|))) (< (div (+ (* (- 1) (div (+ |__VERIFIER_assert_#in~cond| (- 4294967306)) (- 4))) (div (+ .cse1 10) 4)) (- 1073741824)) (+ (div (+ (* (- 1) (div (+ (- 1) |__VERIFIER_assert_#in~cond|) (- 4))) (div (+ .cse1 8589934591) 4)) 1073741824) 1)))) (not (< |__VERIFIER_assert_#in~cond| 4))) [2022-04-28 10:21:00,907 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (or (not (<= 0 |__VERIFIER_assert_#in~cond|)) (not (let ((.cse0 (* (- 1) |__VERIFIER_assert_#in~cond|))) (< (div (+ (* (- 1) (div (+ |__VERIFIER_assert_#in~cond| (- 4294967306)) (- 4))) (div (+ .cse0 10) 4)) (- 1073741824)) (+ (div (+ (* (- 1) (div (+ (- 1) |__VERIFIER_assert_#in~cond|) (- 4))) (div (+ .cse0 8589934591) 4)) 1073741824) 1)))) (not (< |__VERIFIER_assert_#in~cond| 4))) [2022-04-28 10:21:00,910 INFO L356 BasicCegarLoop]: Path program histogram: [12, 2, 2] [2022-04-28 10:21:00,913 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:21:00,921 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:21:00,923 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 10:21:00,951 INFO L163 areAnnotationChecker]: CFG has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:21:00,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:21:00 BoogieIcfgContainer [2022-04-28 10:21:00,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:21:00,963 INFO L158 Benchmark]: Toolchain (without parser) took 12632.56ms. Allocated memory was 170.9MB in the beginning and 249.6MB in the end (delta: 78.6MB). Free memory was 120.3MB in the beginning and 190.1MB in the end (delta: -69.8MB). Peak memory consumption was 115.1MB. Max. memory is 8.0GB. [2022-04-28 10:21:00,963 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 170.9MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:21:00,963 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.48ms. Allocated memory was 170.9MB in the beginning and 207.6MB in the end (delta: 36.7MB). Free memory was 120.1MB in the beginning and 184.1MB in the end (delta: -64.0MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-28 10:21:00,963 INFO L158 Benchmark]: Boogie Preprocessor took 25.36ms. Allocated memory is still 207.6MB. Free memory was 184.1MB in the beginning and 182.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 10:21:00,964 INFO L158 Benchmark]: RCFGBuilder took 266.59ms. Allocated memory is still 207.6MB. Free memory was 182.4MB in the beginning and 169.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 10:21:00,964 INFO L158 Benchmark]: TraceAbstraction took 12121.97ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 169.4MB in the beginning and 190.1MB in the end (delta: -20.7MB). Peak memory consumption was 128.6MB. Max. memory is 8.0GB. [2022-04-28 10:21:00,965 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 170.9MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.48ms. Allocated memory was 170.9MB in the beginning and 207.6MB in the end (delta: 36.7MB). Free memory was 120.1MB in the beginning and 184.1MB in the end (delta: -64.0MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.36ms. Allocated memory is still 207.6MB. Free memory was 184.1MB in the beginning and 182.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 266.59ms. Allocated memory is still 207.6MB. Free memory was 182.4MB in the beginning and 169.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 12121.97ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 169.4MB in the beginning and 190.1MB in the end (delta: -20.7MB). Peak memory consumption was 128.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 360 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 352 mSDsluCounter, 389 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 185 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 498 IncrementalHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 204 mSDtfsCounter, 498 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 226 SyntacticMatches, 5 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=7, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 48 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 70 PreInvPairs, 106 NumberOfFragments, 532 HoareAnnotationTreeSize, 70 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 28 FomulaSimplificationsInter, 463 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: v % 4294967296 < 10 || (v + 4294967295) % 4294967296 < 10 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: v % 4294967296 < 10 || (v + 4294967295) % 4294967296 < 10 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: v % 4294967296 < 10 || (v + 4294967295) % 4294967296 < 10 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: v == 0 || (v + 4294967295) % 4294967296 < 10 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: v % 4294967296 < 10 || (v + 4294967295) % 4294967296 < 10 - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: ((!(0 <= \old(cond)) || ((cond < 4 && 0 <= cond) && (-1 * ((-4294967306 + cond) / -4) + (10 + -1 * cond) / 4) / -1073741824 < (-1 * ((-1 + cond) / -4) + (8589934591 + -1 * cond) / 4) / 1073741824 + 1)) || !((-1 * ((\old(cond) + -4294967306) / -4) + (-1 * \old(cond) + 10) / 4) / -1073741824 < (-1 * ((-1 + \old(cond)) / -4) + (-1 * \old(cond) + 8589934591) / 4) / 1073741824 + 1)) || !(\old(cond) < 4) RESULT: Ultimate proved your program to be correct! [2022-04-28 10:21:00,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...