/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/loop-invariants/linear-inequality-inv-a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:33:01,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:33:01,709 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:33:01,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:33:01,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:33:01,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:33:01,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:33:01,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:33:01,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:33:01,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:33:01,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:33:01,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:33:01,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:33:01,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:33:01,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:33:01,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:33:01,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:33:01,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:33:01,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:33:01,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:33:01,766 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:33:01,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:33:01,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:33:01,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:33:01,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:33:01,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:33:01,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:33:01,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:33:01,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:33:01,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:33:01,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:33:01,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:33:01,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:33:01,779 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:33:01,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:33:01,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:33:01,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:33:01,781 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:33:01,781 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:33:01,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:33:01,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:33:01,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:33:01,783 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:33:01,794 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:33:01,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:33:01,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:33:01,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:33:01,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:33:01,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:33:01,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:33:01,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:33:01,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:33:01,797 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:33:01,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:33:01,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:33:01,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:33:01,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:33:01,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:33:01,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:33:01,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:33:01,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:33:01,798 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:33:01,798 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:33:01,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:33:01,798 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:33:01,798 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:33:02,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:33:02,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:33:02,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:33:02,050 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:33:02,051 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:33:02,052 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c [2022-04-28 10:33:02,109 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7cb89938/c1bb1604dd754358b83512bf5c2e55e7/FLAGa82740dd1 [2022-04-28 10:33:02,474 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:33:02,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c [2022-04-28 10:33:02,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7cb89938/c1bb1604dd754358b83512bf5c2e55e7/FLAGa82740dd1 [2022-04-28 10:33:02,498 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7cb89938/c1bb1604dd754358b83512bf5c2e55e7 [2022-04-28 10:33:02,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:33:02,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:33:02,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:33:02,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:33:02,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:33:02,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:33:02" (1/1) ... [2022-04-28 10:33:02,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e30cd4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:02, skipping insertion in model container [2022-04-28 10:33:02,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:33:02" (1/1) ... [2022-04-28 10:33:02,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:33:02,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:33:02,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c[557,570] [2022-04-28 10:33:02,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c[613,626] [2022-04-28 10:33:02,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:33:02,720 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:33:02,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c[557,570] [2022-04-28 10:33:02,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c[613,626] [2022-04-28 10:33:02,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:33:02,744 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:33:02,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:02 WrapperNode [2022-04-28 10:33:02,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:33:02,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:33:02,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:33:02,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:33:02,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:02" (1/1) ... [2022-04-28 10:33:02,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:02" (1/1) ... [2022-04-28 10:33:02,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:02" (1/1) ... [2022-04-28 10:33:02,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:02" (1/1) ... [2022-04-28 10:33:02,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:02" (1/1) ... [2022-04-28 10:33:02,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:02" (1/1) ... [2022-04-28 10:33:02,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:02" (1/1) ... [2022-04-28 10:33:02,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:33:02,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:33:02,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:33:02,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:33:02,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:02" (1/1) ... [2022-04-28 10:33:02,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:33:02,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:02,804 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:33:02,825 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:33:02,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:33:02,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:33:02,849 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:33:02,849 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:33:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:33:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:33:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:33:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2022-04-28 10:33:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:33:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:33:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:33:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:33:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:33:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:33:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:33:02,893 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:33:02,895 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:33:03,066 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:33:03,071 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:33:03,071 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:33:03,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:33:03 BoogieIcfgContainer [2022-04-28 10:33:03,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:33:03,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:33:03,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:33:03,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:33:03,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:33:02" (1/3) ... [2022-04-28 10:33:03,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4d995c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:33:03, skipping insertion in model container [2022-04-28 10:33:03,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:02" (2/3) ... [2022-04-28 10:33:03,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4d995c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:33:03, skipping insertion in model container [2022-04-28 10:33:03,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:33:03" (3/3) ... [2022-04-28 10:33:03,078 INFO L111 eAbstractionObserver]: Analyzing ICFG linear-inequality-inv-a.c [2022-04-28 10:33:03,104 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:33:03,104 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-04-28 10:33:03,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:33:03,166 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@6a650159, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4255f14e [2022-04-28 10:33:03,166 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-04-28 10:33:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:33:03,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-28 10:33:03,192 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:03,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:03,193 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:03,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:03,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1624254505, now seen corresponding path program 1 times [2022-04-28 10:33:03,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:03,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [473274136] [2022-04-28 10:33:03,224 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:33:03,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1624254505, now seen corresponding path program 2 times [2022-04-28 10:33:03,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:03,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21752519] [2022-04-28 10:33:03,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:03,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:03,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:03,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(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(26, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-28 10:33:03,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 10:33:03,477 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #38#return; {21#true} is VALID [2022-04-28 10:33:03,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:03,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(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(26, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-28 10:33:03,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 10:33:03,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #38#return; {21#true} is VALID [2022-04-28 10:33:03,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret7 := main(); {21#true} is VALID [2022-04-28 10:33:03,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {21#true} is VALID [2022-04-28 10:33:03,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {26#(and (= main_~i~0 0) (not (<= main_~n~0 (* 256 (div main_~n~0 256)))))} is VALID [2022-04-28 10:33:03,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#(and (= main_~i~0 0) (not (<= main_~n~0 (* 256 (div main_~n~0 256)))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {22#false} is VALID [2022-04-28 10:33:03,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {22#false} is VALID [2022-04-28 10:33:03,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-28 10:33:03,486 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:33:03,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:03,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21752519] [2022-04-28 10:33:03,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21752519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:03,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:03,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:33:03,491 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:03,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [473274136] [2022-04-28 10:33:03,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [473274136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:03,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:03,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:33:03,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695189943] [2022-04-28 10:33:03,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:03,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-28 10:33:03,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:03,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:03,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:03,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:33:03,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:03,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:33:03,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:33:03,539 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:03,673 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-28 10:33:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:33:03,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-28 10:33:03,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-04-28 10:33:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-04-28 10:33:03,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2022-04-28 10:33:03,729 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:33:03,734 INFO L225 Difference]: With dead ends: 29 [2022-04-28 10:33:03,734 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 10:33:03,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:33:03,739 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:03,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 27 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 10:33:03,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 10:33:03,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:03,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:03,762 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:03,762 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:03,764 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 10:33:03,764 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 10:33:03,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:03,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:03,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 10:33:03,765 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 10:33:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:03,767 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 10:33:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 10:33:03,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:03,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:03,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:03,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:03,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 10:33:03,770 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2022-04-28 10:33:03,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:03,770 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 10:33:03,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:03,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 10:33:03,794 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:33:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 10:33:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 10:33:03,795 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:03,795 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:03,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:33:03,795 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:03,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:03,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1187666007, now seen corresponding path program 1 times [2022-04-28 10:33:03,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:03,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1258544548] [2022-04-28 10:33:03,837 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:03,837 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:03,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1187666007, now seen corresponding path program 2 times [2022-04-28 10:33:03,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:03,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742476218] [2022-04-28 10:33:03,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:03,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:03,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:03,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {157#(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(26, 2);call #Ultimate.allocInit(12, 3); {150#true} is VALID [2022-04-28 10:33:03,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#true} assume true; {150#true} is VALID [2022-04-28 10:33:03,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {150#true} {150#true} #38#return; {150#true} is VALID [2022-04-28 10:33:03,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {150#true} call ULTIMATE.init(); {157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:03,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#(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(26, 2);call #Ultimate.allocInit(12, 3); {150#true} is VALID [2022-04-28 10:33:03,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} assume true; {150#true} is VALID [2022-04-28 10:33:03,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150#true} {150#true} #38#return; {150#true} is VALID [2022-04-28 10:33:03,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {150#true} call #t~ret7 := main(); {150#true} is VALID [2022-04-28 10:33:03,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {150#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {150#true} is VALID [2022-04-28 10:33:03,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {150#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {155#(= main_~s~0 0)} is VALID [2022-04-28 10:33:03,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {155#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {156#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:33:03,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {156#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {156#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:33:03,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {151#false} is VALID [2022-04-28 10:33:03,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#false} assume !false; {151#false} is VALID [2022-04-28 10:33:03,963 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:33:03,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:03,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742476218] [2022-04-28 10:33:03,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742476218] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:03,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609259125] [2022-04-28 10:33:03,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:33:03,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:03,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:03,965 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:33:03,966 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:33:04,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:33:04,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:04,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 10:33:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:04,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:04,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {150#true} call ULTIMATE.init(); {150#true} is VALID [2022-04-28 10:33:04,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#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(26, 2);call #Ultimate.allocInit(12, 3); {150#true} is VALID [2022-04-28 10:33:04,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} assume true; {150#true} is VALID [2022-04-28 10:33:04,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150#true} {150#true} #38#return; {150#true} is VALID [2022-04-28 10:33:04,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {150#true} call #t~ret7 := main(); {150#true} is VALID [2022-04-28 10:33:04,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {150#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {150#true} is VALID [2022-04-28 10:33:04,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {150#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {155#(= main_~s~0 0)} is VALID [2022-04-28 10:33:04,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {155#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {182#(= (+ main_~s~0 (* (- 1) (mod main_~v~0 256))) 0)} is VALID [2022-04-28 10:33:04,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {182#(= (+ main_~s~0 (* (- 1) (mod main_~v~0 256))) 0)} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {182#(= (+ main_~s~0 (* (- 1) (mod main_~v~0 256))) 0)} is VALID [2022-04-28 10:33:04,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#(= (+ main_~s~0 (* (- 1) (mod main_~v~0 256))) 0)} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {151#false} is VALID [2022-04-28 10:33:04,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#false} assume !false; {151#false} is VALID [2022-04-28 10:33:04,101 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:33:04,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:04,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#false} assume !false; {151#false} is VALID [2022-04-28 10:33:04,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {195#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {151#false} is VALID [2022-04-28 10:33:04,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {195#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {195#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:33:04,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {195#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:33:04,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {150#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {202#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:33:04,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {150#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {150#true} is VALID [2022-04-28 10:33:04,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {150#true} call #t~ret7 := main(); {150#true} is VALID [2022-04-28 10:33:04,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150#true} {150#true} #38#return; {150#true} is VALID [2022-04-28 10:33:04,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} assume true; {150#true} is VALID [2022-04-28 10:33:04,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#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(26, 2);call #Ultimate.allocInit(12, 3); {150#true} is VALID [2022-04-28 10:33:04,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {150#true} call ULTIMATE.init(); {150#true} is VALID [2022-04-28 10:33:04,451 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:33:04,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609259125] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:04,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:04,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 10:33:04,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:04,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1258544548] [2022-04-28 10:33:04,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1258544548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:04,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:04,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:33:04,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568405229] [2022-04-28 10:33:04,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:04,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 10:33:04,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:04,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:04,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:04,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:33:04,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:04,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:33:04,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:33:04,467 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:04,594 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 10:33:04,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:33:04,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 10:33:04,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-04-28 10:33:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-04-28 10:33:04,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2022-04-28 10:33:04,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:04,619 INFO L225 Difference]: With dead ends: 22 [2022-04-28 10:33:04,619 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 10:33:04,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:04,621 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:04,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 23 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 10:33:04,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-04-28 10:33:04,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:04,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:04,642 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:04,642 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:04,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:04,648 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 10:33:04,648 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 10:33:04,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:04,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:04,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 10:33:04,649 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 10:33:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:04,650 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 10:33:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 10:33:04,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:04,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:04,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:04,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-28 10:33:04,652 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2022-04-28 10:33:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:04,652 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-28 10:33:04,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:04,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-28 10:33:04,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 10:33:04,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:33:04,670 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:04,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:04,693 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:33:04,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:04,884 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:04,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:04,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1837062518, now seen corresponding path program 1 times [2022-04-28 10:33:04,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:04,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [894311775] [2022-04-28 10:33:04,891 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:04,891 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:04,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1837062518, now seen corresponding path program 2 times [2022-04-28 10:33:04,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:04,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514980673] [2022-04-28 10:33:04,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:04,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:04,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:04,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {355#(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(26, 2);call #Ultimate.allocInit(12, 3); {348#true} is VALID [2022-04-28 10:33:04,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-28 10:33:04,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} #38#return; {348#true} is VALID [2022-04-28 10:33:04,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {355#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:04,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {355#(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(26, 2);call #Ultimate.allocInit(12, 3); {348#true} is VALID [2022-04-28 10:33:04,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-28 10:33:04,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #38#return; {348#true} is VALID [2022-04-28 10:33:04,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret7 := main(); {348#true} is VALID [2022-04-28 10:33:04,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {348#true} is VALID [2022-04-28 10:33:04,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {348#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {353#(= main_~s~0 0)} is VALID [2022-04-28 10:33:04,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {353#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {354#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:04,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {354#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {354#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:04,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {354#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:04,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {354#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume ~s~0 % 4294967296 > 65025; {349#false} is VALID [2022-04-28 10:33:04,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-28 10:33:04,998 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:33:04,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:04,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514980673] [2022-04-28 10:33:04,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514980673] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:04,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904066049] [2022-04-28 10:33:04,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:33:04,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:04,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:05,008 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:33:05,009 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:33:05,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:33:05,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:05,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 10:33:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:05,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:05,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-28 10:33:05,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#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(26, 2);call #Ultimate.allocInit(12, 3); {348#true} is VALID [2022-04-28 10:33:05,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-28 10:33:05,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #38#return; {348#true} is VALID [2022-04-28 10:33:05,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret7 := main(); {348#true} is VALID [2022-04-28 10:33:05,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {348#true} is VALID [2022-04-28 10:33:05,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {348#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {353#(= main_~s~0 0)} is VALID [2022-04-28 10:33:05,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {353#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {354#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:05,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {354#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {354#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:05,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {354#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:05,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {354#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume ~s~0 % 4294967296 > 65025; {349#false} is VALID [2022-04-28 10:33:05,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-28 10:33:05,284 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:33:05,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:05,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-28 10:33:05,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {395#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {349#false} is VALID [2022-04-28 10:33:05,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {395#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {395#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:33:05,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {395#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {395#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:33:05,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {405#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {395#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:33:05,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {348#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {405#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:33:05,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {348#true} is VALID [2022-04-28 10:33:05,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret7 := main(); {348#true} is VALID [2022-04-28 10:33:05,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #38#return; {348#true} is VALID [2022-04-28 10:33:05,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-28 10:33:05,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#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(26, 2);call #Ultimate.allocInit(12, 3); {348#true} is VALID [2022-04-28 10:33:05,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-28 10:33:05,796 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:33:05,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904066049] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:05,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:05,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-28 10:33:05,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:05,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [894311775] [2022-04-28 10:33:05,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [894311775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:05,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:05,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:33:05,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645446801] [2022-04-28 10:33:05,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:05,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:33:05,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:05,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:05,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:05,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:33:05,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:05,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:33:05,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:33:05,809 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:05,887 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 10:33:05,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:33:05,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:33:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-28 10:33:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-28 10:33:05,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2022-04-28 10:33:05,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:05,907 INFO L225 Difference]: With dead ends: 20 [2022-04-28 10:33:05,907 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 10:33:05,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:33:05,908 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:05,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 10:33:05,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 10:33:05,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:05,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:05,918 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:05,919 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:05,919 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 10:33:05,919 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 10:33:05,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:05,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:05,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 10:33:05,920 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 10:33:05,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:05,921 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 10:33:05,921 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 10:33:05,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:05,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:05,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:05,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:05,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:05,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 10:33:05,922 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-04-28 10:33:05,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:05,922 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 10:33:05,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:05,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 10:33:05,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 10:33:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:33:05,935 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:05,936 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:05,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 10:33:06,151 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,SelfDestructingSolverStorable2 [2022-04-28 10:33:06,152 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:06,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:06,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1837111337, now seen corresponding path program 3 times [2022-04-28 10:33:06,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:06,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1740623392] [2022-04-28 10:33:06,158 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:06,158 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:06,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1837111337, now seen corresponding path program 4 times [2022-04-28 10:33:06,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:06,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086648934] [2022-04-28 10:33:06,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:06,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:06,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:06,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {545#(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(26, 2);call #Ultimate.allocInit(12, 3); {537#true} is VALID [2022-04-28 10:33:06,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {537#true} assume true; {537#true} is VALID [2022-04-28 10:33:06,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {537#true} {537#true} #38#return; {537#true} is VALID [2022-04-28 10:33:06,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {537#true} call ULTIMATE.init(); {545#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:06,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#(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(26, 2);call #Ultimate.allocInit(12, 3); {537#true} is VALID [2022-04-28 10:33:06,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {537#true} assume true; {537#true} is VALID [2022-04-28 10:33:06,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {537#true} {537#true} #38#return; {537#true} is VALID [2022-04-28 10:33:06,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {537#true} call #t~ret7 := main(); {537#true} is VALID [2022-04-28 10:33:06,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {537#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {537#true} is VALID [2022-04-28 10:33:06,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {537#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {542#(= main_~s~0 0)} is VALID [2022-04-28 10:33:06,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {542#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {543#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:06,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {543#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {544#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:33:06,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {544#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {544#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:33:06,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {544#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {538#false} is VALID [2022-04-28 10:33:06,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#false} assume !false; {538#false} is VALID [2022-04-28 10:33:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:06,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:06,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086648934] [2022-04-28 10:33:06,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086648934] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:06,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892007734] [2022-04-28 10:33:06,249 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:33:06,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:06,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:06,250 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:33:06,251 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:33:06,295 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:33:06,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:06,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:33:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:06,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:07,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {537#true} call ULTIMATE.init(); {537#true} is VALID [2022-04-28 10:33:07,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {537#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(26, 2);call #Ultimate.allocInit(12, 3); {537#true} is VALID [2022-04-28 10:33:07,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {537#true} assume true; {537#true} is VALID [2022-04-28 10:33:07,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {537#true} {537#true} #38#return; {537#true} is VALID [2022-04-28 10:33:07,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {537#true} call #t~ret7 := main(); {537#true} is VALID [2022-04-28 10:33:07,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {537#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {537#true} is VALID [2022-04-28 10:33:07,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {537#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {542#(= main_~s~0 0)} is VALID [2022-04-28 10:33:07,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {542#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {543#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:07,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {543#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {573#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 255 (mod main_~v~0 256))))} is VALID [2022-04-28 10:33:07,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {573#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 255 (mod main_~v~0 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {573#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 255 (mod main_~v~0 256))))} is VALID [2022-04-28 10:33:07,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {573#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 255 (mod main_~v~0 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {538#false} is VALID [2022-04-28 10:33:07,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#false} assume !false; {538#false} is VALID [2022-04-28 10:33:07,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:07,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:07,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#false} assume !false; {538#false} is VALID [2022-04-28 10:33:07,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {586#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {538#false} is VALID [2022-04-28 10:33:07,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {586#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {586#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:33:07,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {593#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {586#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:33:07,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {597#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {593#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:33:07,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {537#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {597#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:33:07,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {537#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {537#true} is VALID [2022-04-28 10:33:07,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {537#true} call #t~ret7 := main(); {537#true} is VALID [2022-04-28 10:33:07,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {537#true} {537#true} #38#return; {537#true} is VALID [2022-04-28 10:33:07,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {537#true} assume true; {537#true} is VALID [2022-04-28 10:33:07,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {537#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(26, 2);call #Ultimate.allocInit(12, 3); {537#true} is VALID [2022-04-28 10:33:07,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {537#true} call ULTIMATE.init(); {537#true} is VALID [2022-04-28 10:33:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:07,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892007734] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:07,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:07,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 10:33:07,997 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:07,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1740623392] [2022-04-28 10:33:07,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1740623392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:07,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:07,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:33:07,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129989161] [2022-04-28 10:33:07,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:07,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:33:07,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:07,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:08,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:08,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:33:08,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:08,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:33:08,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:08,009 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:08,174 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 10:33:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:33:08,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:33:08,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-28 10:33:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-28 10:33:08,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-04-28 10:33:08,193 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:33:08,194 INFO L225 Difference]: With dead ends: 23 [2022-04-28 10:33:08,194 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 10:33:08,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:33:08,195 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:08,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 23 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:08,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 10:33:08,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-04-28 10:33:08,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:08,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:08,206 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:08,206 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:08,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:08,207 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 10:33:08,207 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 10:33:08,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:08,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:08,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:33:08,208 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:33:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:08,209 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 10:33:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 10:33:08,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:08,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:08,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:08,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-28 10:33:08,210 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2022-04-28 10:33:08,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:08,210 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-28 10:33:08,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:08,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-28 10:33:08,231 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:33:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 10:33:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 10:33:08,232 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:08,232 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:08,252 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:33:08,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:08,433 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:08,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:08,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1115879670, now seen corresponding path program 3 times [2022-04-28 10:33:08,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:08,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1385657380] [2022-04-28 10:33:08,439 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:08,439 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:08,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1115879670, now seen corresponding path program 4 times [2022-04-28 10:33:08,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:08,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685407053] [2022-04-28 10:33:08,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:08,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:08,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {759#(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(26, 2);call #Ultimate.allocInit(12, 3); {751#true} is VALID [2022-04-28 10:33:08,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {751#true} assume true; {751#true} is VALID [2022-04-28 10:33:08,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {751#true} {751#true} #38#return; {751#true} is VALID [2022-04-28 10:33:08,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {751#true} call ULTIMATE.init(); {759#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:08,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {759#(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(26, 2);call #Ultimate.allocInit(12, 3); {751#true} is VALID [2022-04-28 10:33:08,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {751#true} assume true; {751#true} is VALID [2022-04-28 10:33:08,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {751#true} {751#true} #38#return; {751#true} is VALID [2022-04-28 10:33:08,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {751#true} call #t~ret7 := main(); {751#true} is VALID [2022-04-28 10:33:08,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {751#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {751#true} is VALID [2022-04-28 10:33:08,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {751#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {756#(= main_~s~0 0)} is VALID [2022-04-28 10:33:08,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {756#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {757#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:08,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {757#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {758#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:08,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {758#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {758#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:08,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {758#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {758#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:08,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {758#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {752#false} is VALID [2022-04-28 10:33:08,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {752#false} assume !false; {752#false} is VALID [2022-04-28 10:33:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:08,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:08,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685407053] [2022-04-28 10:33:08,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685407053] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:08,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132463744] [2022-04-28 10:33:08,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:33:08,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:08,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:08,519 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:33:08,520 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:33:08,556 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:33:08,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:08,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:33:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:08,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:08,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {751#true} call ULTIMATE.init(); {751#true} is VALID [2022-04-28 10:33:08,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {751#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(26, 2);call #Ultimate.allocInit(12, 3); {751#true} is VALID [2022-04-28 10:33:08,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {751#true} assume true; {751#true} is VALID [2022-04-28 10:33:08,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {751#true} {751#true} #38#return; {751#true} is VALID [2022-04-28 10:33:08,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {751#true} call #t~ret7 := main(); {751#true} is VALID [2022-04-28 10:33:08,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {751#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {751#true} is VALID [2022-04-28 10:33:08,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {751#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {756#(= main_~s~0 0)} is VALID [2022-04-28 10:33:08,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {756#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {757#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:08,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {757#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {758#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:08,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {758#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {758#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:08,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {758#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {758#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:08,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {758#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {752#false} is VALID [2022-04-28 10:33:08,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {752#false} assume !false; {752#false} is VALID [2022-04-28 10:33:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:08,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:11,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {752#false} assume !false; {752#false} is VALID [2022-04-28 10:33:11,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {802#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {752#false} is VALID [2022-04-28 10:33:11,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {802#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {802#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:33:11,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {802#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {802#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:33:11,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {812#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {802#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:33:11,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {816#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {812#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:33:11,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {751#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {816#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:33:11,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {751#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {751#true} is VALID [2022-04-28 10:33:11,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {751#true} call #t~ret7 := main(); {751#true} is VALID [2022-04-28 10:33:11,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {751#true} {751#true} #38#return; {751#true} is VALID [2022-04-28 10:33:11,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {751#true} assume true; {751#true} is VALID [2022-04-28 10:33:11,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {751#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(26, 2);call #Ultimate.allocInit(12, 3); {751#true} is VALID [2022-04-28 10:33:11,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {751#true} call ULTIMATE.init(); {751#true} is VALID [2022-04-28 10:33:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:11,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132463744] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:11,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:11,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-04-28 10:33:11,042 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:11,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1385657380] [2022-04-28 10:33:11,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1385657380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:11,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:11,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:33:11,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169361950] [2022-04-28 10:33:11,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:11,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 10:33:11,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:11,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:11,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:11,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:33:11,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:11,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:33:11,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:33:11,056 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:11,138 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 10:33:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:33:11,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 10:33:11,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-28 10:33:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-28 10:33:11,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 21 transitions. [2022-04-28 10:33:11,156 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:33:11,157 INFO L225 Difference]: With dead ends: 21 [2022-04-28 10:33:11,157 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 10:33:11,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:33:11,158 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:11,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 24 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 10:33:11,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 10:33:11,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:11,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:11,169 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:11,169 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:11,170 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 10:33:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 10:33:11,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:11,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:11,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:33:11,171 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:33:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:11,171 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 10:33:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 10:33:11,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:11,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:11,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:11,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 10:33:11,172 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2022-04-28 10:33:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:11,173 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 10:33:11,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:11,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 10:33:11,190 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:33:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 10:33:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 10:33:11,190 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:11,190 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:11,208 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:33:11,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:11,395 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:11,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:11,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1115928489, now seen corresponding path program 5 times [2022-04-28 10:33:11,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:11,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1702452149] [2022-04-28 10:33:11,399 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:11,399 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:11,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1115928489, now seen corresponding path program 6 times [2022-04-28 10:33:11,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:11,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419460542] [2022-04-28 10:33:11,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:11,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:11,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:11,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {965#(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(26, 2);call #Ultimate.allocInit(12, 3); {956#true} is VALID [2022-04-28 10:33:11,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {956#true} assume true; {956#true} is VALID [2022-04-28 10:33:11,478 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {956#true} {956#true} #38#return; {956#true} is VALID [2022-04-28 10:33:11,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {956#true} call ULTIMATE.init(); {965#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:11,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {965#(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(26, 2);call #Ultimate.allocInit(12, 3); {956#true} is VALID [2022-04-28 10:33:11,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {956#true} assume true; {956#true} is VALID [2022-04-28 10:33:11,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {956#true} {956#true} #38#return; {956#true} is VALID [2022-04-28 10:33:11,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {956#true} call #t~ret7 := main(); {956#true} is VALID [2022-04-28 10:33:11,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {956#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {956#true} is VALID [2022-04-28 10:33:11,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {956#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {961#(= main_~s~0 0)} is VALID [2022-04-28 10:33:11,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {961#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {962#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:11,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {962#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {963#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:11,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {963#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {964#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:33:11,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {964#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {964#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:33:11,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {964#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {957#false} is VALID [2022-04-28 10:33:11,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {957#false} assume !false; {957#false} is VALID [2022-04-28 10:33:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:11,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:11,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419460542] [2022-04-28 10:33:11,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419460542] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:11,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237388738] [2022-04-28 10:33:11,483 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:33:11,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:11,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:11,484 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:33:11,485 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:33:11,518 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:33:11,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:11,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:33:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:11,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:12,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {956#true} call ULTIMATE.init(); {956#true} is VALID [2022-04-28 10:33:12,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {956#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(26, 2);call #Ultimate.allocInit(12, 3); {956#true} is VALID [2022-04-28 10:33:12,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {956#true} assume true; {956#true} is VALID [2022-04-28 10:33:12,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {956#true} {956#true} #38#return; {956#true} is VALID [2022-04-28 10:33:12,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {956#true} call #t~ret7 := main(); {956#true} is VALID [2022-04-28 10:33:12,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {956#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {956#true} is VALID [2022-04-28 10:33:12,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {956#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {961#(= main_~s~0 0)} is VALID [2022-04-28 10:33:12,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {961#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {962#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:12,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {962#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {963#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:12,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {963#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {996#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 510 (mod main_~v~0 256))))} is VALID [2022-04-28 10:33:12,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {996#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 510 (mod main_~v~0 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {996#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 510 (mod main_~v~0 256))))} is VALID [2022-04-28 10:33:12,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {996#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 510 (mod main_~v~0 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {957#false} is VALID [2022-04-28 10:33:12,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {957#false} assume !false; {957#false} is VALID [2022-04-28 10:33:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:12,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:13,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {957#false} assume !false; {957#false} is VALID [2022-04-28 10:33:13,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {1009#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {957#false} is VALID [2022-04-28 10:33:13,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {1009#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1009#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:33:13,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {1016#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1009#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:33:13,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {1020#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1016#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:33:13,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {1024#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1020#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:33:13,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {956#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1024#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:33:13,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {956#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {956#true} is VALID [2022-04-28 10:33:13,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {956#true} call #t~ret7 := main(); {956#true} is VALID [2022-04-28 10:33:13,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {956#true} {956#true} #38#return; {956#true} is VALID [2022-04-28 10:33:13,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {956#true} assume true; {956#true} is VALID [2022-04-28 10:33:13,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {956#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(26, 2);call #Ultimate.allocInit(12, 3); {956#true} is VALID [2022-04-28 10:33:13,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {956#true} call ULTIMATE.init(); {956#true} is VALID [2022-04-28 10:33:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:13,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237388738] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:13,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:13,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 10:33:13,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:13,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1702452149] [2022-04-28 10:33:13,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1702452149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:13,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:13,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:33:13,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976255323] [2022-04-28 10:33:13,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:13,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 10:33:13,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:13,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:14,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:14,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:33:14,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:14,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:33:14,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:33:14,001 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:14,171 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 10:33:14,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:33:14,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 10:33:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:14,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-04-28 10:33:14,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-04-28 10:33:14,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2022-04-28 10:33:14,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:14,197 INFO L225 Difference]: With dead ends: 24 [2022-04-28 10:33:14,197 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 10:33:14,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:33:14,198 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:14,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 28 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:14,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 10:33:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-04-28 10:33:14,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:14,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:14,214 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:14,215 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:14,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:14,216 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 10:33:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 10:33:14,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:14,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:14,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 10:33:14,216 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 10:33:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:14,218 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 10:33:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 10:33:14,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:14,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:14,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:14,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-28 10:33:14,222 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2022-04-28 10:33:14,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:14,222 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-28 10:33:14,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:14,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-28 10:33:14,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 10:33:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 10:33:14,241 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:14,241 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:14,261 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:33:14,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:14,451 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:14,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash 234047862, now seen corresponding path program 5 times [2022-04-28 10:33:14,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:14,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1098182031] [2022-04-28 10:33:14,455 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:14,455 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:14,455 INFO L85 PathProgramCache]: Analyzing trace with hash 234047862, now seen corresponding path program 6 times [2022-04-28 10:33:14,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:14,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146489991] [2022-04-28 10:33:14,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:14,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:14,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:14,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {1195#(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(26, 2);call #Ultimate.allocInit(12, 3); {1186#true} is VALID [2022-04-28 10:33:14,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {1186#true} assume true; {1186#true} is VALID [2022-04-28 10:33:14,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1186#true} {1186#true} #38#return; {1186#true} is VALID [2022-04-28 10:33:14,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {1186#true} call ULTIMATE.init(); {1195#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:14,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#(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(26, 2);call #Ultimate.allocInit(12, 3); {1186#true} is VALID [2022-04-28 10:33:14,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {1186#true} assume true; {1186#true} is VALID [2022-04-28 10:33:14,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1186#true} {1186#true} #38#return; {1186#true} is VALID [2022-04-28 10:33:14,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {1186#true} call #t~ret7 := main(); {1186#true} is VALID [2022-04-28 10:33:14,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {1186#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1186#true} is VALID [2022-04-28 10:33:14,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {1186#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1191#(= main_~s~0 0)} is VALID [2022-04-28 10:33:14,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {1191#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1192#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:14,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {1192#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1193#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:14,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {1193#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1194#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:14,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {1194#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1194#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:14,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {1194#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {1194#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:14,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {1194#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {1187#false} is VALID [2022-04-28 10:33:14,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {1187#false} assume !false; {1187#false} is VALID [2022-04-28 10:33:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:14,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:14,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146489991] [2022-04-28 10:33:14,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146489991] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:14,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051024723] [2022-04-28 10:33:14,561 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:33:14,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:14,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:14,562 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:33:14,574 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:33:14,613 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:33:14,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:14,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:33:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:14,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:15,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {1186#true} call ULTIMATE.init(); {1186#true} is VALID [2022-04-28 10:33:15,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {1186#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(26, 2);call #Ultimate.allocInit(12, 3); {1186#true} is VALID [2022-04-28 10:33:15,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {1186#true} assume true; {1186#true} is VALID [2022-04-28 10:33:15,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1186#true} {1186#true} #38#return; {1186#true} is VALID [2022-04-28 10:33:15,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {1186#true} call #t~ret7 := main(); {1186#true} is VALID [2022-04-28 10:33:15,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {1186#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1186#true} is VALID [2022-04-28 10:33:15,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {1186#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1191#(= main_~s~0 0)} is VALID [2022-04-28 10:33:15,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {1191#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1192#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:15,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {1192#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1193#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:15,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {1193#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1194#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:15,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {1194#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1194#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:15,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {1194#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {1194#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:15,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {1194#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {1187#false} is VALID [2022-04-28 10:33:15,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {1187#false} assume !false; {1187#false} is VALID [2022-04-28 10:33:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:15,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:19,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {1187#false} assume !false; {1187#false} is VALID [2022-04-28 10:33:19,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {1241#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {1187#false} is VALID [2022-04-28 10:33:19,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {1241#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {1241#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:33:19,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {1241#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1241#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:33:19,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {1251#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1241#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:33:19,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {1255#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1251#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:33:19,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {1259#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1255#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:33:19,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {1186#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1259#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:33:19,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {1186#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1186#true} is VALID [2022-04-28 10:33:19,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {1186#true} call #t~ret7 := main(); {1186#true} is VALID [2022-04-28 10:33:19,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1186#true} {1186#true} #38#return; {1186#true} is VALID [2022-04-28 10:33:19,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {1186#true} assume true; {1186#true} is VALID [2022-04-28 10:33:19,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {1186#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(26, 2);call #Ultimate.allocInit(12, 3); {1186#true} is VALID [2022-04-28 10:33:19,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {1186#true} call ULTIMATE.init(); {1186#true} is VALID [2022-04-28 10:33:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:19,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051024723] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:19,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:19,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-04-28 10:33:19,193 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:19,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1098182031] [2022-04-28 10:33:19,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1098182031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:19,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:19,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:33:19,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957945262] [2022-04-28 10:33:19,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:19,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 10:33:19,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:19,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:19,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:19,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:33:19,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:19,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:33:19,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:33:19,206 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:19,307 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 10:33:19,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:33:19,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 10:33:19,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2022-04-28 10:33:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2022-04-28 10:33:19,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 22 transitions. [2022-04-28 10:33:19,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:19,328 INFO L225 Difference]: With dead ends: 22 [2022-04-28 10:33:19,328 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 10:33:19,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=119, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:33:19,329 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:19,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 29 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:19,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 10:33:19,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 10:33:19,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:19,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:19,343 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:19,343 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:19,344 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 10:33:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 10:33:19,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:19,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:19,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 10:33:19,344 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 10:33:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:19,345 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 10:33:19,345 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 10:33:19,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:19,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:19,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:19,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-28 10:33:19,346 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2022-04-28 10:33:19,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:19,346 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-28 10:33:19,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:19,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-28 10:33:19,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 10:33:19,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 10:33:19,363 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:19,363 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:19,381 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:33:19,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:19,579 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:19,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:19,580 INFO L85 PathProgramCache]: Analyzing trace with hash 234096681, now seen corresponding path program 7 times [2022-04-28 10:33:19,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:19,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1094324725] [2022-04-28 10:33:19,583 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:19,583 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:19,583 INFO L85 PathProgramCache]: Analyzing trace with hash 234096681, now seen corresponding path program 8 times [2022-04-28 10:33:19,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:19,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883186891] [2022-04-28 10:33:19,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:19,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:19,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:19,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {1417#(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(26, 2);call #Ultimate.allocInit(12, 3); {1407#true} is VALID [2022-04-28 10:33:19,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {1407#true} assume true; {1407#true} is VALID [2022-04-28 10:33:19,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1407#true} {1407#true} #38#return; {1407#true} is VALID [2022-04-28 10:33:19,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {1407#true} call ULTIMATE.init(); {1417#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:19,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {1417#(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(26, 2);call #Ultimate.allocInit(12, 3); {1407#true} is VALID [2022-04-28 10:33:19,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {1407#true} assume true; {1407#true} is VALID [2022-04-28 10:33:19,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1407#true} {1407#true} #38#return; {1407#true} is VALID [2022-04-28 10:33:19,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {1407#true} call #t~ret7 := main(); {1407#true} is VALID [2022-04-28 10:33:19,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {1407#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1407#true} is VALID [2022-04-28 10:33:19,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {1407#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1412#(= main_~s~0 0)} is VALID [2022-04-28 10:33:19,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {1412#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1413#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:19,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {1413#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1414#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:19,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {1414#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1415#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:19,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {1415#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1416#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:33:19,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {1416#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1416#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:33:19,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {1416#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {1408#false} is VALID [2022-04-28 10:33:19,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {1408#false} assume !false; {1408#false} is VALID [2022-04-28 10:33:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:19,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:19,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883186891] [2022-04-28 10:33:19,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883186891] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:19,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989028163] [2022-04-28 10:33:19,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:33:19,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:19,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:19,682 INFO L229 MonitoredProcess]: Starting monitored process 8 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:33:19,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 10:33:19,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:33:19,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:19,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:33:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:19,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:20,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {1407#true} call ULTIMATE.init(); {1407#true} is VALID [2022-04-28 10:33:20,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {1407#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(26, 2);call #Ultimate.allocInit(12, 3); {1407#true} is VALID [2022-04-28 10:33:20,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {1407#true} assume true; {1407#true} is VALID [2022-04-28 10:33:20,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1407#true} {1407#true} #38#return; {1407#true} is VALID [2022-04-28 10:33:20,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {1407#true} call #t~ret7 := main(); {1407#true} is VALID [2022-04-28 10:33:20,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {1407#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1407#true} is VALID [2022-04-28 10:33:20,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {1407#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1412#(= main_~s~0 0)} is VALID [2022-04-28 10:33:20,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {1412#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1413#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:20,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {1413#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1414#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:20,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {1414#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1415#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:20,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {1415#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1451#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 765 (mod main_~v~0 256))))} is VALID [2022-04-28 10:33:20,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {1451#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 765 (mod main_~v~0 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1451#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 765 (mod main_~v~0 256))))} is VALID [2022-04-28 10:33:20,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {1451#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 765 (mod main_~v~0 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {1408#false} is VALID [2022-04-28 10:33:20,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {1408#false} assume !false; {1408#false} is VALID [2022-04-28 10:33:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:20,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:23,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {1408#false} assume !false; {1408#false} is VALID [2022-04-28 10:33:23,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {1464#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {1408#false} is VALID [2022-04-28 10:33:23,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {1464#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1464#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:33:23,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {1471#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1464#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:33:23,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {1475#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1471#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:33:23,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {1479#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1475#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:33:23,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {1483#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1479#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:33:23,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {1407#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1483#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:33:23,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {1407#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1407#true} is VALID [2022-04-28 10:33:23,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {1407#true} call #t~ret7 := main(); {1407#true} is VALID [2022-04-28 10:33:23,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1407#true} {1407#true} #38#return; {1407#true} is VALID [2022-04-28 10:33:23,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {1407#true} assume true; {1407#true} is VALID [2022-04-28 10:33:23,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {1407#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(26, 2);call #Ultimate.allocInit(12, 3); {1407#true} is VALID [2022-04-28 10:33:23,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {1407#true} call ULTIMATE.init(); {1407#true} is VALID [2022-04-28 10:33:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:23,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989028163] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:23,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:23,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 10:33:23,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:23,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1094324725] [2022-04-28 10:33:23,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1094324725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:23,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:23,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:33:23,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488772275] [2022-04-28 10:33:23,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:23,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 10:33:23,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:23,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:23,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:23,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:33:23,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:23,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:33:23,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:33:23,469 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:23,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:23,633 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 10:33:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:33:23,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 10:33:23,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:23,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:23,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2022-04-28 10:33:23,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2022-04-28 10:33:23,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 25 transitions. [2022-04-28 10:33:23,655 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:33:23,656 INFO L225 Difference]: With dead ends: 25 [2022-04-28 10:33:23,656 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 10:33:23,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:33:23,657 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:23,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 23 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 10:33:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-04-28 10:33:23,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:23,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:23,670 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:23,670 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:23,671 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 10:33:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 10:33:23,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:23,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:23,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 10:33:23,672 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 10:33:23,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:23,672 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 10:33:23,672 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 10:33:23,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:23,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:23,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:23,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:23,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-04-28 10:33:23,673 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2022-04-28 10:33:23,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:23,673 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-04-28 10:33:23,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:23,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2022-04-28 10:33:23,693 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:33:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-28 10:33:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:33:23,693 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:23,694 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:23,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 10:33:23,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:23,900 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:23,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1332934410, now seen corresponding path program 7 times [2022-04-28 10:33:23,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:23,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1366220459] [2022-04-28 10:33:23,903 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:23,903 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:23,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1332934410, now seen corresponding path program 8 times [2022-04-28 10:33:23,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:23,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094396588] [2022-04-28 10:33:23,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:23,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:23,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:23,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {1663#(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(26, 2);call #Ultimate.allocInit(12, 3); {1653#true} is VALID [2022-04-28 10:33:23,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {1653#true} assume true; {1653#true} is VALID [2022-04-28 10:33:23,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1653#true} {1653#true} #38#return; {1653#true} is VALID [2022-04-28 10:33:23,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {1653#true} call ULTIMATE.init(); {1663#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:23,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {1663#(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(26, 2);call #Ultimate.allocInit(12, 3); {1653#true} is VALID [2022-04-28 10:33:23,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {1653#true} assume true; {1653#true} is VALID [2022-04-28 10:33:23,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1653#true} {1653#true} #38#return; {1653#true} is VALID [2022-04-28 10:33:23,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {1653#true} call #t~ret7 := main(); {1653#true} is VALID [2022-04-28 10:33:23,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {1653#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1653#true} is VALID [2022-04-28 10:33:23,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {1653#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1658#(= main_~s~0 0)} is VALID [2022-04-28 10:33:23,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {1658#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1659#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:23,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {1659#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1660#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:23,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {1660#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1661#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:23,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {1661#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1662#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:33:23,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {1662#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1662#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:33:23,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {1662#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {1662#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:33:23,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {1662#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume ~s~0 % 4294967296 > 65025; {1654#false} is VALID [2022-04-28 10:33:23,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#false} assume !false; {1654#false} is VALID [2022-04-28 10:33:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:23,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:23,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094396588] [2022-04-28 10:33:23,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094396588] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:23,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494043027] [2022-04-28 10:33:23,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:33:23,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:23,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:23,996 INFO L229 MonitoredProcess]: Starting monitored process 9 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:33:23,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 10:33:24,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:33:24,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:24,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:33:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:24,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:24,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {1653#true} call ULTIMATE.init(); {1653#true} is VALID [2022-04-28 10:33:24,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {1653#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(26, 2);call #Ultimate.allocInit(12, 3); {1653#true} is VALID [2022-04-28 10:33:24,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {1653#true} assume true; {1653#true} is VALID [2022-04-28 10:33:24,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1653#true} {1653#true} #38#return; {1653#true} is VALID [2022-04-28 10:33:24,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {1653#true} call #t~ret7 := main(); {1653#true} is VALID [2022-04-28 10:33:24,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {1653#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1653#true} is VALID [2022-04-28 10:33:24,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {1653#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1658#(= main_~s~0 0)} is VALID [2022-04-28 10:33:24,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {1658#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1659#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:24,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {1659#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1660#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:24,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {1660#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1661#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:24,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {1661#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1662#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:33:24,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {1662#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1662#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:33:24,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {1662#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {1662#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:33:24,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {1662#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume ~s~0 % 4294967296 > 65025; {1654#false} is VALID [2022-04-28 10:33:24,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#false} assume !false; {1654#false} is VALID [2022-04-28 10:33:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:24,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:29,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#false} assume !false; {1654#false} is VALID [2022-04-28 10:33:29,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {1712#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {1654#false} is VALID [2022-04-28 10:33:29,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {1712#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {1712#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:33:29,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {1712#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1712#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:33:29,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {1722#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1712#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:33:29,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {1726#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1722#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:33:29,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {1730#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1726#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:33:29,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {1734#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1730#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:33:29,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {1653#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1734#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:33:29,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {1653#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1653#true} is VALID [2022-04-28 10:33:29,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {1653#true} call #t~ret7 := main(); {1653#true} is VALID [2022-04-28 10:33:29,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1653#true} {1653#true} #38#return; {1653#true} is VALID [2022-04-28 10:33:29,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {1653#true} assume true; {1653#true} is VALID [2022-04-28 10:33:29,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {1653#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(26, 2);call #Ultimate.allocInit(12, 3); {1653#true} is VALID [2022-04-28 10:33:29,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {1653#true} call ULTIMATE.init(); {1653#true} is VALID [2022-04-28 10:33:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:29,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494043027] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:29,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:29,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-28 10:33:29,723 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:29,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1366220459] [2022-04-28 10:33:29,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1366220459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:29,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:29,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:33:29,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068243913] [2022-04-28 10:33:29,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:29,723 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:33:29,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:29,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:29,734 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:33:29,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:33:29,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:29,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:33:29,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:33:29,735 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:29,854 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 10:33:29,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:33:29,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:33:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:29,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2022-04-28 10:33:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2022-04-28 10:33:29,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 23 transitions. [2022-04-28 10:33:29,873 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:33:29,874 INFO L225 Difference]: With dead ends: 23 [2022-04-28 10:33:29,874 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 10:33:29,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=173, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:33:29,875 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:29,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 19 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 10:33:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 10:33:29,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:29,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:29,889 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:29,889 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:29,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:29,889 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 10:33:29,889 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 10:33:29,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:29,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:29,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 10:33:29,890 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 10:33:29,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:29,890 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 10:33:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 10:33:29,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:29,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:29,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:29,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-28 10:33:29,891 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2022-04-28 10:33:29,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:29,891 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-28 10:33:29,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:29,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-28 10:33:29,908 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:33:29,908 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 10:33:29,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:33:29,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:29,908 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:29,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 10:33:30,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 10:33:30,109 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:30,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:30,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1332885591, now seen corresponding path program 9 times [2022-04-28 10:33:30,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:30,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1777801716] [2022-04-28 10:33:30,112 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:30,113 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:30,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1332885591, now seen corresponding path program 10 times [2022-04-28 10:33:30,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:30,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44912996] [2022-04-28 10:33:30,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:30,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:30,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:30,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {1901#(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(26, 2);call #Ultimate.allocInit(12, 3); {1890#true} is VALID [2022-04-28 10:33:30,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-28 10:33:30,209 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1890#true} {1890#true} #38#return; {1890#true} is VALID [2022-04-28 10:33:30,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {1890#true} call ULTIMATE.init(); {1901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:30,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {1901#(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(26, 2);call #Ultimate.allocInit(12, 3); {1890#true} is VALID [2022-04-28 10:33:30,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-28 10:33:30,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1890#true} {1890#true} #38#return; {1890#true} is VALID [2022-04-28 10:33:30,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {1890#true} call #t~ret7 := main(); {1890#true} is VALID [2022-04-28 10:33:30,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {1890#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1890#true} is VALID [2022-04-28 10:33:30,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {1890#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1895#(= main_~s~0 0)} is VALID [2022-04-28 10:33:30,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {1895#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1896#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:30,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {1896#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1897#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:30,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {1897#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1898#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:30,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {1898#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1899#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:33:30,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {1899#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1900#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:33:30,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {1900#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1900#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:33:30,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {1900#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {1891#false} is VALID [2022-04-28 10:33:30,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {1891#false} assume !false; {1891#false} is VALID [2022-04-28 10:33:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:30,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:30,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44912996] [2022-04-28 10:33:30,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44912996] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:30,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740404446] [2022-04-28 10:33:30,215 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:33:30,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:30,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:30,216 INFO L229 MonitoredProcess]: Starting monitored process 10 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:33:30,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 10:33:30,258 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:33:30,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:30,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:33:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:30,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:31,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {1890#true} call ULTIMATE.init(); {1890#true} is VALID [2022-04-28 10:33:31,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {1890#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(26, 2);call #Ultimate.allocInit(12, 3); {1890#true} is VALID [2022-04-28 10:33:31,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-28 10:33:31,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1890#true} {1890#true} #38#return; {1890#true} is VALID [2022-04-28 10:33:31,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {1890#true} call #t~ret7 := main(); {1890#true} is VALID [2022-04-28 10:33:31,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {1890#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1890#true} is VALID [2022-04-28 10:33:31,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {1890#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1895#(= main_~s~0 0)} is VALID [2022-04-28 10:33:31,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {1895#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1896#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:31,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {1896#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1897#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:31,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {1897#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1898#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:31,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {1898#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1899#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:33:31,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {1899#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1938#(and (<= main_~s~0 (+ 1020 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-28 10:33:31,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {1938#(and (<= main_~s~0 (+ 1020 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1938#(and (<= main_~s~0 (+ 1020 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-28 10:33:31,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {1938#(and (<= main_~s~0 (+ 1020 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {1891#false} is VALID [2022-04-28 10:33:31,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {1891#false} assume !false; {1891#false} is VALID [2022-04-28 10:33:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:31,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:35,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {1891#false} assume !false; {1891#false} is VALID [2022-04-28 10:33:35,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {1951#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {1891#false} is VALID [2022-04-28 10:33:35,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {1951#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1951#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:33:35,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {1958#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1951#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:33:35,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {1962#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1958#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:33:35,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {1966#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1962#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:33:35,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {1970#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1966#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:33:35,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {1974#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1970#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:33:35,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {1890#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1974#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:33:35,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {1890#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1890#true} is VALID [2022-04-28 10:33:35,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {1890#true} call #t~ret7 := main(); {1890#true} is VALID [2022-04-28 10:33:35,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1890#true} {1890#true} #38#return; {1890#true} is VALID [2022-04-28 10:33:35,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-28 10:33:35,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {1890#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(26, 2);call #Ultimate.allocInit(12, 3); {1890#true} is VALID [2022-04-28 10:33:35,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {1890#true} call ULTIMATE.init(); {1890#true} is VALID [2022-04-28 10:33:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:35,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740404446] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:35,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:35,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 10:33:35,183 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:35,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1777801716] [2022-04-28 10:33:35,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1777801716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:35,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:35,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:33:35,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395537330] [2022-04-28 10:33:35,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:35,183 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:33:35,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:35,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:35,195 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:33:35,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:33:35,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:35,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:33:35,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:33:35,196 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:35,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:35,385 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 10:33:35,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:33:35,386 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:33:35,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:35,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-04-28 10:33:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-04-28 10:33:35,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 26 transitions. [2022-04-28 10:33:35,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:35,422 INFO L225 Difference]: With dead ends: 26 [2022-04-28 10:33:35,422 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 10:33:35,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=290, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:33:35,423 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:35,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 28 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 10:33:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-04-28 10:33:35,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:35,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:35,439 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:35,439 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:35,440 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 10:33:35,440 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 10:33:35,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:35,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:35,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 10:33:35,440 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 10:33:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:35,441 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 10:33:35,441 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 10:33:35,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:35,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:35,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:35,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-28 10:33:35,442 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2022-04-28 10:33:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:35,442 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-28 10:33:35,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:35,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-28 10:33:35,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-28 10:33:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:33:35,465 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:35,465 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:35,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 10:33:35,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 10:33:35,666 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:35,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:35,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1630222710, now seen corresponding path program 9 times [2022-04-28 10:33:35,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:35,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [496676993] [2022-04-28 10:33:35,669 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:35,669 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:35,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1630222710, now seen corresponding path program 10 times [2022-04-28 10:33:35,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:35,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47675785] [2022-04-28 10:33:35,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:35,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:35,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:35,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {2163#(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(26, 2);call #Ultimate.allocInit(12, 3); {2152#true} is VALID [2022-04-28 10:33:35,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {2152#true} assume true; {2152#true} is VALID [2022-04-28 10:33:35,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2152#true} {2152#true} #38#return; {2152#true} is VALID [2022-04-28 10:33:35,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {2152#true} call ULTIMATE.init(); {2163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:35,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {2163#(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(26, 2);call #Ultimate.allocInit(12, 3); {2152#true} is VALID [2022-04-28 10:33:35,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {2152#true} assume true; {2152#true} is VALID [2022-04-28 10:33:35,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2152#true} {2152#true} #38#return; {2152#true} is VALID [2022-04-28 10:33:35,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {2152#true} call #t~ret7 := main(); {2152#true} is VALID [2022-04-28 10:33:35,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {2152#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2152#true} is VALID [2022-04-28 10:33:35,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {2152#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2157#(= main_~s~0 0)} is VALID [2022-04-28 10:33:35,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {2157#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2158#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:35,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {2158#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2159#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:35,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {2159#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2160#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:35,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {2160#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2161#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:33:35,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {2161#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2162#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:33:35,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {2162#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {2162#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:33:35,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {2162#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {2162#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:33:35,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {2162#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume ~s~0 % 4294967296 > 65025; {2153#false} is VALID [2022-04-28 10:33:35,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {2153#false} assume !false; {2153#false} is VALID [2022-04-28 10:33:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:35,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:35,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47675785] [2022-04-28 10:33:35,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47675785] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:35,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386066340] [2022-04-28 10:33:35,787 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:33:35,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:35,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:35,788 INFO L229 MonitoredProcess]: Starting monitored process 11 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:33:35,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 10:33:35,816 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:33:35,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:35,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:33:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:35,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:36,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {2152#true} call ULTIMATE.init(); {2152#true} is VALID [2022-04-28 10:33:36,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {2152#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(26, 2);call #Ultimate.allocInit(12, 3); {2152#true} is VALID [2022-04-28 10:33:36,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {2152#true} assume true; {2152#true} is VALID [2022-04-28 10:33:36,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2152#true} {2152#true} #38#return; {2152#true} is VALID [2022-04-28 10:33:36,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {2152#true} call #t~ret7 := main(); {2152#true} is VALID [2022-04-28 10:33:36,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {2152#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2152#true} is VALID [2022-04-28 10:33:36,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {2152#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2157#(= main_~s~0 0)} is VALID [2022-04-28 10:33:36,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {2157#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2158#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:36,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {2158#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2159#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:36,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {2159#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2160#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:36,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {2160#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2161#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:33:36,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {2161#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2162#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:33:36,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {2162#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {2162#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:33:36,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {2162#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {2162#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:33:36,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {2162#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume ~s~0 % 4294967296 > 65025; {2153#false} is VALID [2022-04-28 10:33:36,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {2153#false} assume !false; {2153#false} is VALID [2022-04-28 10:33:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:36,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:41,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {2153#false} assume !false; {2153#false} is VALID [2022-04-28 10:33:41,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {2215#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {2153#false} is VALID [2022-04-28 10:33:41,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {2215#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {2215#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:33:41,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {2215#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {2215#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:33:41,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {2225#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2215#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:33:41,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {2229#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2225#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:33:41,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {2233#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2229#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:33:41,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {2237#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2233#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:33:41,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {2241#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2237#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:33:41,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {2152#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2241#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:33:41,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {2152#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2152#true} is VALID [2022-04-28 10:33:41,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {2152#true} call #t~ret7 := main(); {2152#true} is VALID [2022-04-28 10:33:41,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2152#true} {2152#true} #38#return; {2152#true} is VALID [2022-04-28 10:33:41,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {2152#true} assume true; {2152#true} is VALID [2022-04-28 10:33:41,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {2152#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(26, 2);call #Ultimate.allocInit(12, 3); {2152#true} is VALID [2022-04-28 10:33:41,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {2152#true} call ULTIMATE.init(); {2152#true} is VALID [2022-04-28 10:33:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:41,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386066340] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:41,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:41,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-28 10:33:41,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:41,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [496676993] [2022-04-28 10:33:41,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [496676993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:41,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:41,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:33:41,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887937658] [2022-04-28 10:33:41,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:41,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:33:41,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:41,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:41,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:33:41,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:41,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:33:41,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:33:41,181 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:41,327 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 10:33:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:33:41,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:33:41,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-28 10:33:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-28 10:33:41,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 24 transitions. [2022-04-28 10:33:41,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:41,356 INFO L225 Difference]: With dead ends: 24 [2022-04-28 10:33:41,356 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 10:33:41,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=237, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:33:41,357 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:41,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:41,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 10:33:41,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 10:33:41,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:41,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,372 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,372 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:41,373 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 10:33:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 10:33:41,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:41,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:41,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 10:33:41,373 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 10:33:41,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:41,373 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 10:33:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 10:33:41,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:41,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:41,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:41,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-28 10:33:41,374 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2022-04-28 10:33:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:41,375 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-28 10:33:41,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-28 10:33:41,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 10:33:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:33:41,402 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:41,403 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:41,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 10:33:41,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 10:33:41,603 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:41,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:41,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1630271529, now seen corresponding path program 11 times [2022-04-28 10:33:41,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:41,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1037560153] [2022-04-28 10:33:41,606 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:41,606 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:41,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1630271529, now seen corresponding path program 12 times [2022-04-28 10:33:41,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:41,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527205640] [2022-04-28 10:33:41,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:41,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:41,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:41,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {2417#(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(26, 2);call #Ultimate.allocInit(12, 3); {2405#true} is VALID [2022-04-28 10:33:41,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {2405#true} assume true; {2405#true} is VALID [2022-04-28 10:33:41,732 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2405#true} {2405#true} #38#return; {2405#true} is VALID [2022-04-28 10:33:41,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {2405#true} call ULTIMATE.init(); {2417#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:41,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {2417#(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(26, 2);call #Ultimate.allocInit(12, 3); {2405#true} is VALID [2022-04-28 10:33:41,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {2405#true} assume true; {2405#true} is VALID [2022-04-28 10:33:41,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2405#true} {2405#true} #38#return; {2405#true} is VALID [2022-04-28 10:33:41,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {2405#true} call #t~ret7 := main(); {2405#true} is VALID [2022-04-28 10:33:41,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {2405#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2405#true} is VALID [2022-04-28 10:33:41,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {2405#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2410#(= main_~s~0 0)} is VALID [2022-04-28 10:33:41,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {2410#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2411#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:41,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {2411#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2412#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:41,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {2412#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2413#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:41,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {2413#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2414#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:33:41,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {2414#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2415#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:33:41,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {2415#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2416#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:33:41,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {2416#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {2416#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:33:41,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {2416#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {2406#false} is VALID [2022-04-28 10:33:41,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {2406#false} assume !false; {2406#false} is VALID [2022-04-28 10:33:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:41,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:41,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527205640] [2022-04-28 10:33:41,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527205640] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:41,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3959543] [2022-04-28 10:33:41,739 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:33:41,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:41,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:41,748 INFO L229 MonitoredProcess]: Starting monitored process 12 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:33:41,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 10:33:41,809 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:33:41,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:41,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:33:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:41,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:43,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {2405#true} call ULTIMATE.init(); {2405#true} is VALID [2022-04-28 10:33:43,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {2405#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(26, 2);call #Ultimate.allocInit(12, 3); {2405#true} is VALID [2022-04-28 10:33:43,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {2405#true} assume true; {2405#true} is VALID [2022-04-28 10:33:43,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2405#true} {2405#true} #38#return; {2405#true} is VALID [2022-04-28 10:33:43,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {2405#true} call #t~ret7 := main(); {2405#true} is VALID [2022-04-28 10:33:43,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {2405#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2405#true} is VALID [2022-04-28 10:33:43,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {2405#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2410#(= main_~s~0 0)} is VALID [2022-04-28 10:33:43,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {2410#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2411#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:43,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {2411#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2412#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:43,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {2412#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2413#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:43,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {2413#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2414#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:33:43,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {2414#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2415#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:33:43,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {2415#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2457#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 1275 (mod main_~v~0 256))))} is VALID [2022-04-28 10:33:43,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {2457#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 1275 (mod main_~v~0 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {2457#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 1275 (mod main_~v~0 256))))} is VALID [2022-04-28 10:33:43,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {2457#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 1275 (mod main_~v~0 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {2406#false} is VALID [2022-04-28 10:33:43,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {2406#false} assume !false; {2406#false} is VALID [2022-04-28 10:33:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:43,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:48,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {2406#false} assume !false; {2406#false} is VALID [2022-04-28 10:33:48,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {2470#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {2406#false} is VALID [2022-04-28 10:33:48,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {2470#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {2470#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:33:48,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {2477#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2470#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:33:48,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {2481#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2477#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:33:48,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {2485#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2481#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:33:48,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {2489#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2485#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:33:48,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {2493#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2489#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:33:48,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {2497#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2493#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:33:48,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {2405#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2497#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:33:48,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {2405#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2405#true} is VALID [2022-04-28 10:33:48,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {2405#true} call #t~ret7 := main(); {2405#true} is VALID [2022-04-28 10:33:48,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2405#true} {2405#true} #38#return; {2405#true} is VALID [2022-04-28 10:33:48,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {2405#true} assume true; {2405#true} is VALID [2022-04-28 10:33:48,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {2405#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(26, 2);call #Ultimate.allocInit(12, 3); {2405#true} is VALID [2022-04-28 10:33:48,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {2405#true} call ULTIMATE.init(); {2405#true} is VALID [2022-04-28 10:33:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:48,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3959543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:48,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:48,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 10:33:48,709 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:48,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1037560153] [2022-04-28 10:33:48,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1037560153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:48,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:48,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:33:48,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580455701] [2022-04-28 10:33:48,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:48,710 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:33:48,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:48,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:48,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:33:48,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:48,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:33:48,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:33:48,722 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,952 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 10:33:48,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:33:48,952 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:33:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2022-04-28 10:33:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2022-04-28 10:33:48,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 27 transitions. [2022-04-28 10:33:48,976 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:33:48,976 INFO L225 Difference]: With dead ends: 27 [2022-04-28 10:33:48,976 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 10:33:48,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=373, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:33:48,977 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:48,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:48,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 10:33:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-28 10:33:48,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:48,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,996 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,996 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,997 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 10:33:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 10:33:48,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:48,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:48,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 10:33:48,997 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 10:33:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,998 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 10:33:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 10:33:48,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:48,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:48,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:48,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-28 10:33:48,998 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2022-04-28 10:33:48,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:48,999 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-28 10:33:48,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-28 10:33:49,046 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:33:49,046 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 10:33:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:33:49,046 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:49,046 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:49,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 10:33:49,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 10:33:49,259 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:49,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:49,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1001187082, now seen corresponding path program 11 times [2022-04-28 10:33:49,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:49,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [952403028] [2022-04-28 10:33:49,262 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:49,262 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:49,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1001187082, now seen corresponding path program 12 times [2022-04-28 10:33:49,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:49,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138193638] [2022-04-28 10:33:49,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:49,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:49,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:49,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#(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(26, 2);call #Ultimate.allocInit(12, 3); {2683#true} is VALID [2022-04-28 10:33:49,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {2683#true} assume true; {2683#true} is VALID [2022-04-28 10:33:49,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2683#true} {2683#true} #38#return; {2683#true} is VALID [2022-04-28 10:33:49,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {2683#true} call ULTIMATE.init(); {2695#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:49,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#(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(26, 2);call #Ultimate.allocInit(12, 3); {2683#true} is VALID [2022-04-28 10:33:49,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {2683#true} assume true; {2683#true} is VALID [2022-04-28 10:33:49,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2683#true} {2683#true} #38#return; {2683#true} is VALID [2022-04-28 10:33:49,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {2683#true} call #t~ret7 := main(); {2683#true} is VALID [2022-04-28 10:33:49,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {2683#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2683#true} is VALID [2022-04-28 10:33:49,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {2683#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2688#(= main_~s~0 0)} is VALID [2022-04-28 10:33:49,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {2688#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2689#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:49,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {2689#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2690#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:49,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {2690#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2691#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:49,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {2691#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2692#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:33:49,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {2692#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2693#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:33:49,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {2693#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2694#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:33:49,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {2694#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {2694#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:33:49,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {2694#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {2694#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:33:49,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {2694#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume ~s~0 % 4294967296 > 65025; {2684#false} is VALID [2022-04-28 10:33:49,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {2684#false} assume !false; {2684#false} is VALID [2022-04-28 10:33:49,379 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:49,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:49,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138193638] [2022-04-28 10:33:49,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138193638] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:49,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968682650] [2022-04-28 10:33:49,379 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:33:49,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:49,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:49,396 INFO L229 MonitoredProcess]: Starting monitored process 13 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:33:49,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 10:33:49,445 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:33:49,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:49,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:33:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:49,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:50,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {2683#true} call ULTIMATE.init(); {2683#true} is VALID [2022-04-28 10:33:50,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {2683#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(26, 2);call #Ultimate.allocInit(12, 3); {2683#true} is VALID [2022-04-28 10:33:50,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {2683#true} assume true; {2683#true} is VALID [2022-04-28 10:33:50,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2683#true} {2683#true} #38#return; {2683#true} is VALID [2022-04-28 10:33:50,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {2683#true} call #t~ret7 := main(); {2683#true} is VALID [2022-04-28 10:33:50,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {2683#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2683#true} is VALID [2022-04-28 10:33:50,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {2683#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2688#(= main_~s~0 0)} is VALID [2022-04-28 10:33:50,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {2688#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2689#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:33:50,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {2689#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2690#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:50,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {2690#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2691#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:33:50,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {2691#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2692#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:33:50,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {2692#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2693#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:33:50,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {2693#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2694#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:33:50,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {2694#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {2694#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:33:50,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {2694#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {2694#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:33:50,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {2694#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume ~s~0 % 4294967296 > 65025; {2684#false} is VALID [2022-04-28 10:33:50,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {2684#false} assume !false; {2684#false} is VALID [2022-04-28 10:33:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:50,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:59,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {2684#false} assume !false; {2684#false} is VALID [2022-04-28 10:33:59,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {2750#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {2684#false} is VALID [2022-04-28 10:33:59,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {2750#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {2750#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:34:00,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {2750#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {2750#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:34:00,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {2760#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2750#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:34:00,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {2764#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2760#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:34:00,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {2768#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2764#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:34:00,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {2772#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2768#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:34:00,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {2776#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2772#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:34:00,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {2780#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2776#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:34:00,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {2683#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2780#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-28 10:34:00,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {2683#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2683#true} is VALID [2022-04-28 10:34:00,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {2683#true} call #t~ret7 := main(); {2683#true} is VALID [2022-04-28 10:34:00,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2683#true} {2683#true} #38#return; {2683#true} is VALID [2022-04-28 10:34:00,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {2683#true} assume true; {2683#true} is VALID [2022-04-28 10:34:00,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {2683#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(26, 2);call #Ultimate.allocInit(12, 3); {2683#true} is VALID [2022-04-28 10:34:00,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {2683#true} call ULTIMATE.init(); {2683#true} is VALID [2022-04-28 10:34:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:00,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968682650] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:34:00,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:34:00,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2022-04-28 10:34:00,018 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:34:00,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [952403028] [2022-04-28 10:34:00,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [952403028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:34:00,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:34:00,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:34:00,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298732290] [2022-04-28 10:34:00,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:34:00,019 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:34:00,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:34:00,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,030 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:34:00,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:34:00,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:00,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:34:00,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:34:00,031 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:00,199 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 10:34:00,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:34:00,199 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:34:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:34:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2022-04-28 10:34:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2022-04-28 10:34:00,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 25 transitions. [2022-04-28 10:34:00,218 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:34:00,218 INFO L225 Difference]: With dead ends: 25 [2022-04-28 10:34:00,218 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 10:34:00,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=311, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:34:00,219 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:34:00,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 24 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:34:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 10:34:00,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 10:34:00,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:34:00,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,240 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,240 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:00,241 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 10:34:00,241 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 10:34:00,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:00,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:00,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:34:00,241 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:34:00,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:00,241 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 10:34:00,242 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 10:34:00,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:00,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:00,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:34:00,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:34:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-28 10:34:00,242 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2022-04-28 10:34:00,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:34:00,242 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-28 10:34:00,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-28 10:34:00,264 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:34:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 10:34:00,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:34:00,264 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:34:00,265 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:34:00,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 10:34:00,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 10:34:00,465 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:34:00,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:34:00,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1001138263, now seen corresponding path program 13 times [2022-04-28 10:34:00,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:00,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1980536589] [2022-04-28 10:34:00,468 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:34:00,468 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:34:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1001138263, now seen corresponding path program 14 times [2022-04-28 10:34:00,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:34:00,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799659634] [2022-04-28 10:34:00,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:34:00,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:34:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:00,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:34:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:00,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {2965#(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(26, 2);call #Ultimate.allocInit(12, 3); {2952#true} is VALID [2022-04-28 10:34:00,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-28 10:34:00,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2952#true} {2952#true} #38#return; {2952#true} is VALID [2022-04-28 10:34:00,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {2952#true} call ULTIMATE.init(); {2965#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:34:00,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {2965#(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(26, 2);call #Ultimate.allocInit(12, 3); {2952#true} is VALID [2022-04-28 10:34:00,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-28 10:34:00,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2952#true} {2952#true} #38#return; {2952#true} is VALID [2022-04-28 10:34:00,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {2952#true} call #t~ret7 := main(); {2952#true} is VALID [2022-04-28 10:34:00,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {2952#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2952#true} is VALID [2022-04-28 10:34:00,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {2952#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2957#(= main_~s~0 0)} is VALID [2022-04-28 10:34:00,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {2957#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2958#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:34:00,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2959#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:00,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {2959#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2960#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:00,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {2960#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2961#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:34:00,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {2961#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2962#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:34:00,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {2962#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2963#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:34:00,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {2963#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2964#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:34:00,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {2964#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {2964#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:34:00,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {2964#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {2953#false} is VALID [2022-04-28 10:34:00,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {2953#false} assume !false; {2953#false} is VALID [2022-04-28 10:34:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:00,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:34:00,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799659634] [2022-04-28 10:34:00,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799659634] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:34:00,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549864566] [2022-04-28 10:34:00,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:34:00,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:34:00,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:34:00,604 INFO L229 MonitoredProcess]: Starting monitored process 14 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:34:00,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 10:34:00,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:34:00,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:34:00,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:34:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:00,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:34:02,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {2952#true} call ULTIMATE.init(); {2952#true} is VALID [2022-04-28 10:34:02,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {2952#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(26, 2);call #Ultimate.allocInit(12, 3); {2952#true} is VALID [2022-04-28 10:34:02,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-28 10:34:02,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2952#true} {2952#true} #38#return; {2952#true} is VALID [2022-04-28 10:34:02,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {2952#true} call #t~ret7 := main(); {2952#true} is VALID [2022-04-28 10:34:02,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {2952#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2952#true} is VALID [2022-04-28 10:34:02,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {2952#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2957#(= main_~s~0 0)} is VALID [2022-04-28 10:34:02,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {2957#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2958#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:34:02,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2959#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:02,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {2959#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2960#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:02,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {2960#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2961#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:34:02,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {2961#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2962#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:34:02,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {2962#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2963#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:34:02,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {2963#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3008#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 1530 (mod main_~v~0 256))))} is VALID [2022-04-28 10:34:02,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {3008#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 1530 (mod main_~v~0 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3008#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 1530 (mod main_~v~0 256))))} is VALID [2022-04-28 10:34:02,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {3008#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 1530 (mod main_~v~0 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {2953#false} is VALID [2022-04-28 10:34:02,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {2953#false} assume !false; {2953#false} is VALID [2022-04-28 10:34:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:02,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:34:08,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {2953#false} assume !false; {2953#false} is VALID [2022-04-28 10:34:08,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {3021#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {2953#false} is VALID [2022-04-28 10:34:08,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {3021#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3021#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:34:08,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {3028#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3021#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:34:08,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {3032#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3028#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:34:08,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {3036#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3032#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:34:08,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {3040#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3036#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:34:08,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {3044#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3040#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:34:08,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {3048#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3044#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:34:08,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {3052#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3048#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:34:08,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {2952#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {3052#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-28 10:34:08,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {2952#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2952#true} is VALID [2022-04-28 10:34:08,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {2952#true} call #t~ret7 := main(); {2952#true} is VALID [2022-04-28 10:34:08,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2952#true} {2952#true} #38#return; {2952#true} is VALID [2022-04-28 10:34:08,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-28 10:34:08,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {2952#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(26, 2);call #Ultimate.allocInit(12, 3); {2952#true} is VALID [2022-04-28 10:34:08,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {2952#true} call ULTIMATE.init(); {2952#true} is VALID [2022-04-28 10:34:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:08,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549864566] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:34:08,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:34:08,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 10:34:08,896 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:34:08,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1980536589] [2022-04-28 10:34:08,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1980536589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:34:08,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:34:08,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:34:08,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492944007] [2022-04-28 10:34:08,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:34:08,896 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:34:08,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:34:08,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:08,908 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:34:08,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:34:08,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:08,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:34:08,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:34:08,909 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:09,154 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 10:34:09,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:34:09,154 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:34:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:34:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2022-04-28 10:34:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2022-04-28 10:34:09,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 28 transitions. [2022-04-28 10:34:09,179 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:34:09,179 INFO L225 Difference]: With dead ends: 28 [2022-04-28 10:34:09,179 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 10:34:09,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=466, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:34:09,180 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:34:09,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 28 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:34:09,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 10:34:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-04-28 10:34:09,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:34:09,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:09,204 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:09,204 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:09,204 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 10:34:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 10:34:09,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:09,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:09,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 10:34:09,205 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 10:34:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:09,205 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 10:34:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 10:34:09,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:09,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:09,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:34:09,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:34:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-04-28 10:34:09,206 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2022-04-28 10:34:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:34:09,206 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-04-28 10:34:09,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:09,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2022-04-28 10:34:09,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-28 10:34:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:34:09,227 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:34:09,227 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:34:09,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 10:34:09,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 10:34:09,428 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:34:09,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:34:09,428 INFO L85 PathProgramCache]: Analyzing trace with hash -970512010, now seen corresponding path program 13 times [2022-04-28 10:34:09,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:09,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [366777699] [2022-04-28 10:34:09,431 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:34:09,431 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:34:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash -970512010, now seen corresponding path program 14 times [2022-04-28 10:34:09,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:34:09,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849140417] [2022-04-28 10:34:09,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:34:09,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:34:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:09,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:34:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:09,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {3259#(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(26, 2);call #Ultimate.allocInit(12, 3); {3246#true} is VALID [2022-04-28 10:34:09,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {3246#true} assume true; {3246#true} is VALID [2022-04-28 10:34:09,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3246#true} {3246#true} #38#return; {3246#true} is VALID [2022-04-28 10:34:09,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {3246#true} call ULTIMATE.init(); {3259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:34:09,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {3259#(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(26, 2);call #Ultimate.allocInit(12, 3); {3246#true} is VALID [2022-04-28 10:34:09,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {3246#true} assume true; {3246#true} is VALID [2022-04-28 10:34:09,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3246#true} {3246#true} #38#return; {3246#true} is VALID [2022-04-28 10:34:09,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {3246#true} call #t~ret7 := main(); {3246#true} is VALID [2022-04-28 10:34:09,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {3246#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3246#true} is VALID [2022-04-28 10:34:09,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {3246#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {3251#(= main_~s~0 0)} is VALID [2022-04-28 10:34:09,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {3251#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3252#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:34:09,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {3252#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3253#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:09,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {3253#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3254#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:09,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {3254#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3255#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:34:09,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {3255#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3256#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:34:09,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {3256#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3257#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:34:09,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {3257#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3258#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:34:09,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {3258#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3258#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:34:09,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {3258#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {3258#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:34:09,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {3258#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume ~s~0 % 4294967296 > 65025; {3247#false} is VALID [2022-04-28 10:34:09,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {3247#false} assume !false; {3247#false} is VALID [2022-04-28 10:34:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:09,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:34:09,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849140417] [2022-04-28 10:34:09,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849140417] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:34:09,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507100812] [2022-04-28 10:34:09,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:34:09,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:34:09,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:34:09,593 INFO L229 MonitoredProcess]: Starting monitored process 15 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:34:09,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 10:34:09,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:34:09,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:34:09,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:34:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:09,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:34:10,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {3246#true} call ULTIMATE.init(); {3246#true} is VALID [2022-04-28 10:34:10,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {3246#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(26, 2);call #Ultimate.allocInit(12, 3); {3246#true} is VALID [2022-04-28 10:34:10,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {3246#true} assume true; {3246#true} is VALID [2022-04-28 10:34:10,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3246#true} {3246#true} #38#return; {3246#true} is VALID [2022-04-28 10:34:10,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {3246#true} call #t~ret7 := main(); {3246#true} is VALID [2022-04-28 10:34:10,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {3246#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3246#true} is VALID [2022-04-28 10:34:10,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {3246#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {3251#(= main_~s~0 0)} is VALID [2022-04-28 10:34:10,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {3251#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3252#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:34:10,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {3252#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3253#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:10,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {3253#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3254#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:10,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {3254#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3255#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:34:10,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {3255#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3256#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:34:10,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {3256#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3257#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:34:10,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {3257#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3258#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:34:10,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {3258#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3258#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:34:10,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {3258#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {3258#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:34:10,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {3258#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume ~s~0 % 4294967296 > 65025; {3247#false} is VALID [2022-04-28 10:34:10,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {3247#false} assume !false; {3247#false} is VALID [2022-04-28 10:34:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:10,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:34:21,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {3247#false} assume !false; {3247#false} is VALID [2022-04-28 10:34:21,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {3317#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {3247#false} is VALID [2022-04-28 10:34:21,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {3317#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {3317#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:34:21,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {3317#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3317#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:34:21,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {3327#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3317#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:34:21,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {3331#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3327#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:34:21,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {3335#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3331#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:34:21,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {3339#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3335#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:34:21,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {3343#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3339#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:34:21,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {3347#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3343#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:34:21,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {3351#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3347#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-28 10:34:21,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {3246#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {3351#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-28 10:34:21,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {3246#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3246#true} is VALID [2022-04-28 10:34:21,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {3246#true} call #t~ret7 := main(); {3246#true} is VALID [2022-04-28 10:34:21,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3246#true} {3246#true} #38#return; {3246#true} is VALID [2022-04-28 10:34:21,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {3246#true} assume true; {3246#true} is VALID [2022-04-28 10:34:21,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {3246#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(26, 2);call #Ultimate.allocInit(12, 3); {3246#true} is VALID [2022-04-28 10:34:21,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {3246#true} call ULTIMATE.init(); {3246#true} is VALID [2022-04-28 10:34:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:21,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507100812] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:34:21,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:34:21,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-04-28 10:34:21,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:34:21,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [366777699] [2022-04-28 10:34:21,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [366777699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:34:21,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:34:21,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:34:21,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009539510] [2022-04-28 10:34:21,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:34:21,875 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 10:34:21,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:34:21,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:21,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:21,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:34:21,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:21,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:34:21,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:34:21,887 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:22,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:22,039 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 10:34:22,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:34:22,040 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 10:34:22,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:34:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2022-04-28 10:34:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2022-04-28 10:34:22,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 26 transitions. [2022-04-28 10:34:22,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:22,072 INFO L225 Difference]: With dead ends: 26 [2022-04-28 10:34:22,072 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 10:34:22,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=307, Invalid=395, Unknown=0, NotChecked=0, Total=702 [2022-04-28 10:34:22,073 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:34:22,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 24 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:34:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 10:34:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 10:34:22,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:34:22,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:22,092 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:22,092 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:22,093 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 10:34:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 10:34:22,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:22,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:22,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 10:34:22,093 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 10:34:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:22,094 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 10:34:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 10:34:22,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:22,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:22,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:34:22,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:34:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:22,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-28 10:34:22,094 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2022-04-28 10:34:22,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:34:22,095 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-28 10:34:22,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:22,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-28 10:34:22,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:22,114 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 10:34:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:34:22,114 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:34:22,114 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:34:22,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 10:34:22,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:34:22,327 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:34:22,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:34:22,328 INFO L85 PathProgramCache]: Analyzing trace with hash -970463191, now seen corresponding path program 15 times [2022-04-28 10:34:22,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:22,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [272082464] [2022-04-28 10:34:22,330 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:34:22,330 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:34:22,330 INFO L85 PathProgramCache]: Analyzing trace with hash -970463191, now seen corresponding path program 16 times [2022-04-28 10:34:22,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:34:22,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135917995] [2022-04-28 10:34:22,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:34:22,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:34:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:22,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:34:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:22,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {3545#(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(26, 2);call #Ultimate.allocInit(12, 3); {3531#true} is VALID [2022-04-28 10:34:22,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {3531#true} assume true; {3531#true} is VALID [2022-04-28 10:34:22,473 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3531#true} {3531#true} #38#return; {3531#true} is VALID [2022-04-28 10:34:22,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {3531#true} call ULTIMATE.init(); {3545#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:34:22,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {3545#(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(26, 2);call #Ultimate.allocInit(12, 3); {3531#true} is VALID [2022-04-28 10:34:22,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {3531#true} assume true; {3531#true} is VALID [2022-04-28 10:34:22,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3531#true} {3531#true} #38#return; {3531#true} is VALID [2022-04-28 10:34:22,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {3531#true} call #t~ret7 := main(); {3531#true} is VALID [2022-04-28 10:34:22,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {3531#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3531#true} is VALID [2022-04-28 10:34:22,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {3531#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {3536#(= main_~s~0 0)} is VALID [2022-04-28 10:34:22,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {3536#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3537#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:34:22,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {3537#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3538#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:22,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {3538#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3539#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:22,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {3539#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3540#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:34:22,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {3540#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3541#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:34:22,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {3541#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3542#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:34:22,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {3542#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3543#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:34:22,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {3543#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3544#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:34:22,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {3544#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3544#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:34:22,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {3544#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {3532#false} is VALID [2022-04-28 10:34:22,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {3532#false} assume !false; {3532#false} is VALID [2022-04-28 10:34:22,480 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:34:22,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:34:22,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135917995] [2022-04-28 10:34:22,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135917995] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:34:22,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944815218] [2022-04-28 10:34:22,481 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:34:22,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:34:22,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:34:22,482 INFO L229 MonitoredProcess]: Starting monitored process 16 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:34:22,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 10:34:22,540 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:34:22,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:34:22,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:34:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:22,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:34:24,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {3531#true} call ULTIMATE.init(); {3531#true} is VALID [2022-04-28 10:34:24,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {3531#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(26, 2);call #Ultimate.allocInit(12, 3); {3531#true} is VALID [2022-04-28 10:34:24,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {3531#true} assume true; {3531#true} is VALID [2022-04-28 10:34:24,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3531#true} {3531#true} #38#return; {3531#true} is VALID [2022-04-28 10:34:24,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {3531#true} call #t~ret7 := main(); {3531#true} is VALID [2022-04-28 10:34:24,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {3531#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3531#true} is VALID [2022-04-28 10:34:24,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {3531#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {3536#(= main_~s~0 0)} is VALID [2022-04-28 10:34:24,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {3536#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3537#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:34:24,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {3537#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3538#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:24,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {3538#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3539#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:24,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {3539#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3540#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:34:24,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {3540#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3541#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:34:24,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {3541#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3542#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:34:24,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {3542#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3543#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:34:24,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {3543#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3591#(and (<= main_~s~0 (+ (mod main_~v~0 256) 1785)) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-28 10:34:24,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {3591#(and (<= main_~s~0 (+ (mod main_~v~0 256) 1785)) (<= (mod main_~v~0 256) main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3591#(and (<= main_~s~0 (+ (mod main_~v~0 256) 1785)) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-28 10:34:24,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {3591#(and (<= main_~s~0 (+ (mod main_~v~0 256) 1785)) (<= (mod main_~v~0 256) main_~s~0))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {3532#false} is VALID [2022-04-28 10:34:24,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {3532#false} assume !false; {3532#false} is VALID [2022-04-28 10:34:24,197 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:34:24,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:34:30,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {3532#false} assume !false; {3532#false} is VALID [2022-04-28 10:34:30,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {3604#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {3532#false} is VALID [2022-04-28 10:34:30,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {3604#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3604#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:34:30,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {3611#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3604#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:34:30,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {3615#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3611#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:34:30,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {3619#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3615#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:34:30,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {3623#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3619#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:34:30,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {3627#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3623#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:34:30,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {3631#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3627#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:34:30,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {3635#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3631#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:34:30,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {3639#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3635#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-28 10:34:30,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {3531#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {3639#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-28 10:34:30,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {3531#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3531#true} is VALID [2022-04-28 10:34:30,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {3531#true} call #t~ret7 := main(); {3531#true} is VALID [2022-04-28 10:34:30,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3531#true} {3531#true} #38#return; {3531#true} is VALID [2022-04-28 10:34:30,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {3531#true} assume true; {3531#true} is VALID [2022-04-28 10:34:30,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {3531#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(26, 2);call #Ultimate.allocInit(12, 3); {3531#true} is VALID [2022-04-28 10:34:30,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {3531#true} call ULTIMATE.init(); {3531#true} is VALID [2022-04-28 10:34:30,661 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:34:30,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944815218] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:34:30,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:34:30,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 10:34:30,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:34:30,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [272082464] [2022-04-28 10:34:30,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [272082464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:34:30,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:34:30,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:34:30,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152084213] [2022-04-28 10:34:30,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:34:30,662 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 10:34:30,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:34:30,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:30,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:30,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:34:30,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:30,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:34:30,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=290, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:34:30,675 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:30,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:30,949 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 10:34:30,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:34:30,950 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 10:34:30,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:34:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2022-04-28 10:34:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:30,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2022-04-28 10:34:30,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 29 transitions. [2022-04-28 10:34:30,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:30,973 INFO L225 Difference]: With dead ends: 29 [2022-04-28 10:34:30,974 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 10:34:30,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:34:30,974 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:34:30,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 23 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:34:30,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 10:34:30,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-04-28 10:34:30,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:34:30,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:30,993 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:30,993 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:30,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:30,994 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 10:34:30,994 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 10:34:30,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:30,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:30,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 10:34:30,994 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 10:34:30,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:30,995 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 10:34:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 10:34:30,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:30,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:30,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:34:30,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:34:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-28 10:34:30,996 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2022-04-28 10:34:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:34:30,996 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-28 10:34:30,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:30,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2022-04-28 10:34:31,028 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:34:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 10:34:31,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:34:31,028 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:34:31,028 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:34:31,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 10:34:31,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 10:34:31,229 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:34:31,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:34:31,229 INFO L85 PathProgramCache]: Analyzing trace with hash -19584778, now seen corresponding path program 15 times [2022-04-28 10:34:31,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:31,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [90925270] [2022-04-28 10:34:31,233 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:34:31,233 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:34:31,233 INFO L85 PathProgramCache]: Analyzing trace with hash -19584778, now seen corresponding path program 16 times [2022-04-28 10:34:31,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:34:31,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114604896] [2022-04-28 10:34:31,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:34:31,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:34:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:31,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:34:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:31,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {3855#(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(26, 2);call #Ultimate.allocInit(12, 3); {3841#true} is VALID [2022-04-28 10:34:31,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {3841#true} assume true; {3841#true} is VALID [2022-04-28 10:34:31,390 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3841#true} {3841#true} #38#return; {3841#true} is VALID [2022-04-28 10:34:31,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {3841#true} call ULTIMATE.init(); {3855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:34:31,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {3855#(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(26, 2);call #Ultimate.allocInit(12, 3); {3841#true} is VALID [2022-04-28 10:34:31,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {3841#true} assume true; {3841#true} is VALID [2022-04-28 10:34:31,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3841#true} {3841#true} #38#return; {3841#true} is VALID [2022-04-28 10:34:31,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {3841#true} call #t~ret7 := main(); {3841#true} is VALID [2022-04-28 10:34:31,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {3841#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3841#true} is VALID [2022-04-28 10:34:31,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {3841#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {3846#(= main_~s~0 0)} is VALID [2022-04-28 10:34:31,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {3846#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3847#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:34:31,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {3847#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3848#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:31,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {3848#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3849#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:31,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {3849#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3850#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:34:31,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {3850#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3851#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:34:31,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {3851#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3852#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:34:31,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {3852#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3853#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:34:31,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {3853#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3854#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:31,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {3854#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3854#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:31,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {3854#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {3854#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:31,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {3854#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {3842#false} is VALID [2022-04-28 10:34:31,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {3842#false} assume !false; {3842#false} is VALID [2022-04-28 10:34:31,406 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:34:31,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:34:31,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114604896] [2022-04-28 10:34:31,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114604896] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:34:31,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602488888] [2022-04-28 10:34:31,407 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:34:31,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:34:31,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:34:31,408 INFO L229 MonitoredProcess]: Starting monitored process 17 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:34:31,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 10:34:31,463 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:34:31,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:34:31,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:34:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:31,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:34:32,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {3841#true} call ULTIMATE.init(); {3841#true} is VALID [2022-04-28 10:34:32,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {3841#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(26, 2);call #Ultimate.allocInit(12, 3); {3841#true} is VALID [2022-04-28 10:34:32,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {3841#true} assume true; {3841#true} is VALID [2022-04-28 10:34:32,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3841#true} {3841#true} #38#return; {3841#true} is VALID [2022-04-28 10:34:32,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {3841#true} call #t~ret7 := main(); {3841#true} is VALID [2022-04-28 10:34:32,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {3841#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3841#true} is VALID [2022-04-28 10:34:32,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {3841#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {3846#(= main_~s~0 0)} is VALID [2022-04-28 10:34:32,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {3846#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3847#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:34:32,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {3847#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3848#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:32,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {3848#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3849#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:32,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {3849#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3850#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:34:32,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {3850#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3851#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:34:32,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {3851#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3852#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:34:32,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {3852#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3853#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:34:32,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {3853#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3854#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:32,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {3854#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3854#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:32,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {3854#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {3854#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:32,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {3854#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {3842#false} is VALID [2022-04-28 10:34:32,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {3842#false} assume !false; {3842#false} is VALID [2022-04-28 10:34:32,605 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:34:32,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:34:40,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {3842#false} assume !false; {3842#false} is VALID [2022-04-28 10:34:40,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {3916#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {3842#false} is VALID [2022-04-28 10:34:40,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {3916#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {3916#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:34:40,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {3916#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3916#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:34:40,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {3926#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3916#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:34:40,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {3930#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3926#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:34:40,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {3934#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3930#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:34:40,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {3938#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3934#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:34:40,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {3942#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3938#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:34:40,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {3946#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3942#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:34:40,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {3950#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3946#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-28 10:34:40,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {3954#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3950#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-28 10:34:40,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {3841#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {3954#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-28 10:34:40,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {3841#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3841#true} is VALID [2022-04-28 10:34:40,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {3841#true} call #t~ret7 := main(); {3841#true} is VALID [2022-04-28 10:34:40,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3841#true} {3841#true} #38#return; {3841#true} is VALID [2022-04-28 10:34:40,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {3841#true} assume true; {3841#true} is VALID [2022-04-28 10:34:40,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {3841#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(26, 2);call #Ultimate.allocInit(12, 3); {3841#true} is VALID [2022-04-28 10:34:40,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {3841#true} call ULTIMATE.init(); {3841#true} is VALID [2022-04-28 10:34:40,396 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:34:40,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602488888] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:34:40,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:34:40,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 21 [2022-04-28 10:34:40,396 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:34:40,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [90925270] [2022-04-28 10:34:40,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [90925270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:34:40,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:34:40,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:34:40,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767018893] [2022-04-28 10:34:40,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:34:40,397 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:34:40,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:34:40,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:40,417 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:34:40,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:34:40,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:40,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:34:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:34:40,418 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:40,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:40,588 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 10:34:40,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:34:40,588 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:34:40,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:34:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2022-04-28 10:34:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2022-04-28 10:34:40,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 27 transitions. [2022-04-28 10:34:40,609 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:34:40,609 INFO L225 Difference]: With dead ends: 27 [2022-04-28 10:34:40,609 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 10:34:40,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=381, Invalid=489, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:34:40,610 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:34:40,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 24 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:34:40,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 10:34:40,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 10:34:40,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:34:40,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:40,629 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:40,629 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:40,630 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 10:34:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 10:34:40,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:40,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:40,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 10:34:40,630 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 10:34:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:40,630 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 10:34:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 10:34:40,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:40,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:40,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:34:40,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:34:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-28 10:34:40,631 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2022-04-28 10:34:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:34:40,631 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-28 10:34:40,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:40,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-28 10:34:40,654 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:34:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 10:34:40,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:34:40,655 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:34:40,655 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:34:40,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 10:34:40,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 10:34:40,871 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:34:40,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:34:40,872 INFO L85 PathProgramCache]: Analyzing trace with hash -19535959, now seen corresponding path program 17 times [2022-04-28 10:34:40,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:40,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1631246316] [2022-04-28 10:34:40,875 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:34:40,875 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:34:40,875 INFO L85 PathProgramCache]: Analyzing trace with hash -19535959, now seen corresponding path program 18 times [2022-04-28 10:34:40,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:34:40,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780439168] [2022-04-28 10:34:40,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:34:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:34:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:41,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:34:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:41,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {4157#(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(26, 2);call #Ultimate.allocInit(12, 3); {4142#true} is VALID [2022-04-28 10:34:41,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {4142#true} assume true; {4142#true} is VALID [2022-04-28 10:34:41,023 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4142#true} {4142#true} #38#return; {4142#true} is VALID [2022-04-28 10:34:41,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {4142#true} call ULTIMATE.init(); {4157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:34:41,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {4157#(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(26, 2);call #Ultimate.allocInit(12, 3); {4142#true} is VALID [2022-04-28 10:34:41,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {4142#true} assume true; {4142#true} is VALID [2022-04-28 10:34:41,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4142#true} {4142#true} #38#return; {4142#true} is VALID [2022-04-28 10:34:41,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {4142#true} call #t~ret7 := main(); {4142#true} is VALID [2022-04-28 10:34:41,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {4142#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4142#true} is VALID [2022-04-28 10:34:41,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {4142#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {4147#(= main_~s~0 0)} is VALID [2022-04-28 10:34:41,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {4147#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4148#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:34:41,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4149#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:41,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {4149#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4150#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:41,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {4150#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4151#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:34:41,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {4151#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4152#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:34:41,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {4152#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4153#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:34:41,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {4153#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4154#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:34:41,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {4154#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4155#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:41,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {4155#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4156#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:34:41,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {4156#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {4156#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:34:41,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {4156#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {4143#false} is VALID [2022-04-28 10:34:41,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {4143#false} assume !false; {4143#false} is VALID [2022-04-28 10:34:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:41,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:34:41,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780439168] [2022-04-28 10:34:41,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780439168] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:34:41,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186428730] [2022-04-28 10:34:41,031 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:34:41,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:34:41,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:34:41,033 INFO L229 MonitoredProcess]: Starting monitored process 18 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:34:41,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 10:34:41,127 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:34:41,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:34:41,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:34:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:41,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:34:42,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {4142#true} call ULTIMATE.init(); {4142#true} is VALID [2022-04-28 10:34:42,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {4142#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(26, 2);call #Ultimate.allocInit(12, 3); {4142#true} is VALID [2022-04-28 10:34:42,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {4142#true} assume true; {4142#true} is VALID [2022-04-28 10:34:42,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4142#true} {4142#true} #38#return; {4142#true} is VALID [2022-04-28 10:34:42,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {4142#true} call #t~ret7 := main(); {4142#true} is VALID [2022-04-28 10:34:42,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {4142#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4142#true} is VALID [2022-04-28 10:34:42,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {4142#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {4147#(= main_~s~0 0)} is VALID [2022-04-28 10:34:42,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {4147#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4148#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:34:42,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4149#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:42,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {4149#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4150#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:42,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {4150#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4151#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:34:42,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {4151#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4152#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:34:42,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {4152#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4153#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:34:42,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {4153#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4154#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:34:42,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {4154#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4155#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:42,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {4155#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4206#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 2040 (mod main_~v~0 256))))} is VALID [2022-04-28 10:34:42,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {4206#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 2040 (mod main_~v~0 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {4206#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 2040 (mod main_~v~0 256))))} is VALID [2022-04-28 10:34:42,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {4206#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 2040 (mod main_~v~0 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {4143#false} is VALID [2022-04-28 10:34:42,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {4143#false} assume !false; {4143#false} is VALID [2022-04-28 10:34:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:42,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:34:52,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {4143#false} assume !false; {4143#false} is VALID [2022-04-28 10:34:52,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {4219#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {4143#false} is VALID [2022-04-28 10:34:52,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {4219#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {4219#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:34:52,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {4226#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4219#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:34:52,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {4230#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4226#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:34:52,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {4234#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4230#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:34:52,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {4238#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4234#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:34:52,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {4242#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4238#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:34:52,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {4246#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4242#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:34:52,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {4250#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4246#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:34:52,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {4254#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4250#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-28 10:34:52,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {4258#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4254#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-28 10:34:52,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {4142#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {4258#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-28 10:34:52,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {4142#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4142#true} is VALID [2022-04-28 10:34:52,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {4142#true} call #t~ret7 := main(); {4142#true} is VALID [2022-04-28 10:34:52,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4142#true} {4142#true} #38#return; {4142#true} is VALID [2022-04-28 10:34:52,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {4142#true} assume true; {4142#true} is VALID [2022-04-28 10:34:52,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {4142#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(26, 2);call #Ultimate.allocInit(12, 3); {4142#true} is VALID [2022-04-28 10:34:52,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {4142#true} call ULTIMATE.init(); {4142#true} is VALID [2022-04-28 10:34:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:52,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186428730] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:34:52,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:34:52,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:34:52,386 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:34:52,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1631246316] [2022-04-28 10:34:52,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1631246316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:34:52,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:34:52,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:34:52,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277414780] [2022-04-28 10:34:52,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:34:52,386 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:34:52,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:34:52,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:52,399 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:34:52,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:34:52,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:52,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:34:52,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:34:52,400 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:52,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:52,701 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 10:34:52,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:34:52,701 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:34:52,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:34:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 30 transitions. [2022-04-28 10:34:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 30 transitions. [2022-04-28 10:34:52,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 30 transitions. [2022-04-28 10:34:52,726 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:34:52,726 INFO L225 Difference]: With dead ends: 30 [2022-04-28 10:34:52,726 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 10:34:52,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=440, Invalid=682, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:34:52,727 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:34:52,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:34:52,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 10:34:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-04-28 10:34:52,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:34:52,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:52,749 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:52,749 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:52,750 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 10:34:52,750 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 10:34:52,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:52,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:52,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 10:34:52,750 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 10:34:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:52,751 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 10:34:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 10:34:52,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:52,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:52,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:34:52,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:34:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-28 10:34:52,751 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2022-04-28 10:34:52,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:34:52,752 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-28 10:34:52,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:52,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-28 10:34:52,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-28 10:34:52,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:34:52,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:34:52,775 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:34:52,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 10:34:52,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 10:34:52,976 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:34:52,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:34:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash -605611658, now seen corresponding path program 17 times [2022-04-28 10:34:52,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:52,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [971002758] [2022-04-28 10:34:52,979 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:34:52,979 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:34:52,979 INFO L85 PathProgramCache]: Analyzing trace with hash -605611658, now seen corresponding path program 18 times [2022-04-28 10:34:52,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:34:52,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452422701] [2022-04-28 10:34:52,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:34:52,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:34:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:53,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:34:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:53,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {4483#(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(26, 2);call #Ultimate.allocInit(12, 3); {4468#true} is VALID [2022-04-28 10:34:53,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {4468#true} assume true; {4468#true} is VALID [2022-04-28 10:34:53,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4468#true} {4468#true} #38#return; {4468#true} is VALID [2022-04-28 10:34:53,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {4468#true} call ULTIMATE.init(); {4483#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:34:53,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {4483#(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(26, 2);call #Ultimate.allocInit(12, 3); {4468#true} is VALID [2022-04-28 10:34:53,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {4468#true} assume true; {4468#true} is VALID [2022-04-28 10:34:53,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4468#true} {4468#true} #38#return; {4468#true} is VALID [2022-04-28 10:34:53,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {4468#true} call #t~ret7 := main(); {4468#true} is VALID [2022-04-28 10:34:53,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {4468#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4468#true} is VALID [2022-04-28 10:34:53,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {4468#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {4473#(= main_~s~0 0)} is VALID [2022-04-28 10:34:53,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {4473#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4474#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:34:53,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {4474#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4475#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:53,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {4475#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4476#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:53,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {4476#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4477#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:34:53,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {4477#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4478#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:34:53,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {4478#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4479#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:34:53,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {4479#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4480#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:34:53,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {4480#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4481#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:53,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {4481#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4482#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:34:53,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {4482#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {4482#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:34:53,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {4482#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {4482#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:34:53,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {4482#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume ~s~0 % 4294967296 > 65025; {4469#false} is VALID [2022-04-28 10:34:53,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {4469#false} assume !false; {4469#false} is VALID [2022-04-28 10:34:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:53,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:34:53,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452422701] [2022-04-28 10:34:53,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452422701] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:34:53,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018729153] [2022-04-28 10:34:53,146 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:34:53,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:34:53,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:34:53,147 INFO L229 MonitoredProcess]: Starting monitored process 19 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:34:53,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 10:34:53,224 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:34:53,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:34:53,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:34:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:53,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:34:54,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {4468#true} call ULTIMATE.init(); {4468#true} is VALID [2022-04-28 10:34:54,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {4468#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(26, 2);call #Ultimate.allocInit(12, 3); {4468#true} is VALID [2022-04-28 10:34:54,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {4468#true} assume true; {4468#true} is VALID [2022-04-28 10:34:54,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4468#true} {4468#true} #38#return; {4468#true} is VALID [2022-04-28 10:34:54,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {4468#true} call #t~ret7 := main(); {4468#true} is VALID [2022-04-28 10:34:54,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {4468#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4468#true} is VALID [2022-04-28 10:34:54,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {4468#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {4473#(= main_~s~0 0)} is VALID [2022-04-28 10:34:54,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {4473#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4474#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:34:54,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {4474#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4475#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:54,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {4475#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4476#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:54,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {4476#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4477#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:34:54,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {4477#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4478#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:34:54,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {4478#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4479#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:34:54,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {4479#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4480#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:34:54,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {4480#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4481#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:34:54,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {4481#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4482#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:34:54,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {4482#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {4482#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:34:54,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {4482#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {4482#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:34:54,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {4482#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume ~s~0 % 4294967296 > 65025; {4469#false} is VALID [2022-04-28 10:34:54,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {4469#false} assume !false; {4469#false} is VALID [2022-04-28 10:34:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:54,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:35:07,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {4469#false} assume !false; {4469#false} is VALID [2022-04-28 10:35:07,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {4547#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {4469#false} is VALID [2022-04-28 10:35:07,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {4547#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {4547#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:35:07,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {4547#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {4547#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:35:07,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {4557#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4547#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:35:07,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {4561#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4557#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:35:07,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {4565#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4561#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:35:07,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {4569#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4565#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:35:07,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {4573#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4569#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:35:07,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {4577#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4573#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:35:07,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {4581#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4577#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-28 10:35:07,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {4585#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4581#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-28 10:35:07,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {4589#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4585#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-28 10:35:07,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {4468#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {4589#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is VALID [2022-04-28 10:35:07,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {4468#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4468#true} is VALID [2022-04-28 10:35:07,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {4468#true} call #t~ret7 := main(); {4468#true} is VALID [2022-04-28 10:35:07,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4468#true} {4468#true} #38#return; {4468#true} is VALID [2022-04-28 10:35:07,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {4468#true} assume true; {4468#true} is VALID [2022-04-28 10:35:07,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {4468#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(26, 2);call #Ultimate.allocInit(12, 3); {4468#true} is VALID [2022-04-28 10:35:07,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {4468#true} call ULTIMATE.init(); {4468#true} is VALID [2022-04-28 10:35:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:35:07,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018729153] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:35:07,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:35:07,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 23 [2022-04-28 10:35:07,287 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:35:07,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [971002758] [2022-04-28 10:35:07,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [971002758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:35:07,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:35:07,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:35:07,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647850882] [2022-04-28 10:35:07,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:35:07,287 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 10:35:07,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:35:07,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:07,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:35:07,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:35:07,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:35:07,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:35:07,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:35:07,301 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:07,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:07,499 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 10:35:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:35:07,499 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 10:35:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:35:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2022-04-28 10:35:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2022-04-28 10:35:07,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 28 transitions. [2022-04-28 10:35:07,522 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:35:07,522 INFO L225 Difference]: With dead ends: 28 [2022-04-28 10:35:07,522 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 10:35:07,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=463, Invalid=593, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:35:07,523 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:35:07,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:35:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 10:35:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 10:35:07,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:35:07,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:07,548 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:07,548 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:07,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:07,549 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 10:35:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 10:35:07,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:35:07,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:35:07,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 10:35:07,549 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 10:35:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:07,550 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 10:35:07,550 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 10:35:07,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:35:07,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:35:07,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:35:07,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:35:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-28 10:35:07,551 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2022-04-28 10:35:07,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:35:07,551 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-28 10:35:07,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:07,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-28 10:35:07,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:35:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 10:35:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:35:07,578 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:35:07,579 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:35:07,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 10:35:07,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:35:07,779 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:35:07,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:35:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash -605562839, now seen corresponding path program 19 times [2022-04-28 10:35:07,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:35:07,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [712621049] [2022-04-28 10:35:07,782 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:35:07,782 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:35:07,782 INFO L85 PathProgramCache]: Analyzing trace with hash -605562839, now seen corresponding path program 20 times [2022-04-28 10:35:07,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:35:07,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015594201] [2022-04-28 10:35:07,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:35:07,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:35:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:35:07,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:35:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:35:07,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {4801#(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(26, 2);call #Ultimate.allocInit(12, 3); {4785#true} is VALID [2022-04-28 10:35:07,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {4785#true} assume true; {4785#true} is VALID [2022-04-28 10:35:07,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4785#true} {4785#true} #38#return; {4785#true} is VALID [2022-04-28 10:35:07,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {4785#true} call ULTIMATE.init(); {4801#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:35:07,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {4801#(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(26, 2);call #Ultimate.allocInit(12, 3); {4785#true} is VALID [2022-04-28 10:35:07,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {4785#true} assume true; {4785#true} is VALID [2022-04-28 10:35:07,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4785#true} {4785#true} #38#return; {4785#true} is VALID [2022-04-28 10:35:07,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {4785#true} call #t~ret7 := main(); {4785#true} is VALID [2022-04-28 10:35:07,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {4785#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4785#true} is VALID [2022-04-28 10:35:07,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {4785#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {4790#(= main_~s~0 0)} is VALID [2022-04-28 10:35:07,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {4790#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4791#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:35:07,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {4791#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4792#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:07,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {4792#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4793#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:07,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {4793#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4794#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:35:07,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {4794#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4795#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:35:07,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {4795#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4796#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:35:07,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {4796#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4797#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:35:07,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {4797#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4798#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:07,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {4798#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4799#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:35:07,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {4799#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4800#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:35:07,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {4800#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {4800#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:35:07,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {4800#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {4786#false} is VALID [2022-04-28 10:35:07,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {4786#false} assume !false; {4786#false} is VALID [2022-04-28 10:35:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:35:07,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:35:07,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015594201] [2022-04-28 10:35:07,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015594201] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:35:07,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121935667] [2022-04-28 10:35:07,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:35:07,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:35:07,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:35:07,939 INFO L229 MonitoredProcess]: Starting monitored process 20 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:35:07,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 10:35:08,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:35:08,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:35:08,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:35:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:35:08,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:35:09,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {4785#true} call ULTIMATE.init(); {4785#true} is VALID [2022-04-28 10:35:09,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {4785#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(26, 2);call #Ultimate.allocInit(12, 3); {4785#true} is VALID [2022-04-28 10:35:09,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {4785#true} assume true; {4785#true} is VALID [2022-04-28 10:35:09,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4785#true} {4785#true} #38#return; {4785#true} is VALID [2022-04-28 10:35:09,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {4785#true} call #t~ret7 := main(); {4785#true} is VALID [2022-04-28 10:35:09,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {4785#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4785#true} is VALID [2022-04-28 10:35:09,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {4785#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {4790#(= main_~s~0 0)} is VALID [2022-04-28 10:35:09,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {4790#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4791#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:35:09,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {4791#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4792#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:09,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {4792#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4793#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:09,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {4793#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4794#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:35:09,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {4794#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4795#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:35:09,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {4795#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4796#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:35:09,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {4796#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4797#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:35:09,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {4797#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4798#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:09,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {4798#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4799#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:35:09,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {4799#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4853#(and (<= main_~s~0 (+ 2295 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-28 10:35:09,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {4853#(and (<= main_~s~0 (+ 2295 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {4853#(and (<= main_~s~0 (+ 2295 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-28 10:35:09,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {4853#(and (<= main_~s~0 (+ 2295 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {4786#false} is VALID [2022-04-28 10:35:09,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {4786#false} assume !false; {4786#false} is VALID [2022-04-28 10:35:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:35:09,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:35:21,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {4786#false} assume !false; {4786#false} is VALID [2022-04-28 10:35:21,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {4866#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {4786#false} is VALID [2022-04-28 10:35:21,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {4866#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {4866#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:35:21,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {4873#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4866#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:35:21,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {4877#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4873#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:35:21,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {4881#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4877#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:35:21,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {4885#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4881#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:35:21,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {4889#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4885#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:35:21,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {4893#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4889#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:35:21,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {4897#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4893#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:35:21,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {4901#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4897#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-28 10:35:21,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {4905#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4901#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-28 10:35:21,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {4909#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4905#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-28 10:35:21,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {4785#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {4909#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-28 10:35:21,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {4785#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4785#true} is VALID [2022-04-28 10:35:21,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {4785#true} call #t~ret7 := main(); {4785#true} is VALID [2022-04-28 10:35:21,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4785#true} {4785#true} #38#return; {4785#true} is VALID [2022-04-28 10:35:21,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {4785#true} assume true; {4785#true} is VALID [2022-04-28 10:35:21,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {4785#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(26, 2);call #Ultimate.allocInit(12, 3); {4785#true} is VALID [2022-04-28 10:35:21,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {4785#true} call ULTIMATE.init(); {4785#true} is VALID [2022-04-28 10:35:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:35:21,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121935667] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:35:21,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:35:21,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:35:21,770 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:35:21,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [712621049] [2022-04-28 10:35:21,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [712621049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:35:21,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:35:21,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:35:21,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141770363] [2022-04-28 10:35:21,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:35:21,770 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 10:35:21,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:35:21,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:21,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:35:21,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:35:21,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:35:21,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:35:21,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=398, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:35:21,783 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:22,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:22,150 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 10:35:22,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:35:22,151 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 10:35:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:35:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2022-04-28 10:35:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2022-04-28 10:35:22,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 31 transitions. [2022-04-28 10:35:22,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:35:22,176 INFO L225 Difference]: With dead ends: 31 [2022-04-28 10:35:22,176 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 10:35:22,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=527, Invalid=805, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:35:22,177 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:35:22,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 48 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:35:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 10:35:22,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-04-28 10:35:22,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:35:22,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:22,202 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:22,202 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:22,203 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 10:35:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 10:35:22,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:35:22,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:35:22,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 10:35:22,203 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 10:35:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:22,203 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 10:35:22,204 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 10:35:22,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:35:22,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:35:22,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:35:22,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:35:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-28 10:35:22,204 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2022-04-28 10:35:22,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:35:22,204 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-28 10:35:22,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:22,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 27 transitions. [2022-04-28 10:35:22,229 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:35:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-28 10:35:22,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:35:22,229 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:35:22,229 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:35:22,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 10:35:22,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:35:22,430 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:35:22,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:35:22,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1592575754, now seen corresponding path program 19 times [2022-04-28 10:35:22,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:35:22,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [846658491] [2022-04-28 10:35:22,433 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:35:22,433 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:35:22,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1592575754, now seen corresponding path program 20 times [2022-04-28 10:35:22,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:35:22,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64326175] [2022-04-28 10:35:22,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:35:22,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:35:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:35:22,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:35:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:35:22,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {5143#(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(26, 2);call #Ultimate.allocInit(12, 3); {5127#true} is VALID [2022-04-28 10:35:22,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {5127#true} assume true; {5127#true} is VALID [2022-04-28 10:35:22,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5127#true} {5127#true} #38#return; {5127#true} is VALID [2022-04-28 10:35:22,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {5127#true} call ULTIMATE.init(); {5143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:35:22,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {5143#(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(26, 2);call #Ultimate.allocInit(12, 3); {5127#true} is VALID [2022-04-28 10:35:22,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {5127#true} assume true; {5127#true} is VALID [2022-04-28 10:35:22,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5127#true} {5127#true} #38#return; {5127#true} is VALID [2022-04-28 10:35:22,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {5127#true} call #t~ret7 := main(); {5127#true} is VALID [2022-04-28 10:35:22,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {5127#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5127#true} is VALID [2022-04-28 10:35:22,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {5127#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {5132#(= main_~s~0 0)} is VALID [2022-04-28 10:35:22,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {5132#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5133#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:35:22,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {5133#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5134#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:22,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {5134#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5135#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:22,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {5135#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5136#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:35:22,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {5136#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5137#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:35:22,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {5137#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5138#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:35:22,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {5138#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5139#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:35:22,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {5139#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5140#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:22,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {5140#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5141#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:35:22,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {5141#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5142#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:22,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {5142#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {5142#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:22,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {5142#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {5142#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:22,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {5142#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {5128#false} is VALID [2022-04-28 10:35:22,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {5128#false} assume !false; {5128#false} is VALID [2022-04-28 10:35:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:35:22,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:35:22,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64326175] [2022-04-28 10:35:22,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64326175] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:35:22,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193226749] [2022-04-28 10:35:22,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:35:22,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:35:22,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:35:22,628 INFO L229 MonitoredProcess]: Starting monitored process 21 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:35:22,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 10:35:22,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:35:22,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:35:22,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:35:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:35:22,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:35:24,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {5127#true} call ULTIMATE.init(); {5127#true} is VALID [2022-04-28 10:35:24,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {5127#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(26, 2);call #Ultimate.allocInit(12, 3); {5127#true} is VALID [2022-04-28 10:35:24,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {5127#true} assume true; {5127#true} is VALID [2022-04-28 10:35:24,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5127#true} {5127#true} #38#return; {5127#true} is VALID [2022-04-28 10:35:24,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {5127#true} call #t~ret7 := main(); {5127#true} is VALID [2022-04-28 10:35:24,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {5127#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5127#true} is VALID [2022-04-28 10:35:24,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {5127#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {5132#(= main_~s~0 0)} is VALID [2022-04-28 10:35:24,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {5132#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5133#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:35:24,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {5133#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5134#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:24,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {5134#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5135#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:24,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {5135#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5136#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:35:24,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {5136#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5137#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:35:24,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {5137#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5138#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:35:24,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {5138#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5139#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:35:24,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {5139#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5140#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:24,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {5140#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5141#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:35:24,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {5141#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5142#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:24,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {5142#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {5142#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:24,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {5142#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {5142#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:24,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {5142#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {5128#false} is VALID [2022-04-28 10:35:24,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {5128#false} assume !false; {5128#false} is VALID [2022-04-28 10:35:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:35:24,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:35:41,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {5128#false} assume !false; {5128#false} is VALID [2022-04-28 10:35:41,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {5210#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {5128#false} is VALID [2022-04-28 10:35:41,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {5210#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {5210#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:35:41,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {5210#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {5210#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:35:41,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {5220#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5210#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:35:41,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {5224#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5220#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:35:41,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {5228#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5224#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:35:41,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {5232#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5228#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:35:41,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {5236#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5232#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:35:41,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {5240#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5236#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:35:41,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {5244#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5240#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-28 10:35:41,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {5248#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5244#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-28 10:35:41,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {5252#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5248#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-28 10:35:41,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {5256#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5252#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is VALID [2022-04-28 10:35:41,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {5127#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {5256#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:35:41,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {5127#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5127#true} is VALID [2022-04-28 10:35:41,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {5127#true} call #t~ret7 := main(); {5127#true} is VALID [2022-04-28 10:35:41,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5127#true} {5127#true} #38#return; {5127#true} is VALID [2022-04-28 10:35:41,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {5127#true} assume true; {5127#true} is VALID [2022-04-28 10:35:41,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {5127#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(26, 2);call #Ultimate.allocInit(12, 3); {5127#true} is VALID [2022-04-28 10:35:41,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {5127#true} call ULTIMATE.init(); {5127#true} is VALID [2022-04-28 10:35:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:35:41,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193226749] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:35:41,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:35:41,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 25 [2022-04-28 10:35:41,278 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:35:41,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [846658491] [2022-04-28 10:35:41,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [846658491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:35:41,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:35:41,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:35:41,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980922699] [2022-04-28 10:35:41,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:35:41,278 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:35:41,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:35:41,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:41,292 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:35:41,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:35:41,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:35:41,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:35:41,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:35:41,293 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:41,554 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 10:35:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:35:41,554 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:35:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:35:41,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2022-04-28 10:35:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2022-04-28 10:35:41,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 29 transitions. [2022-04-28 10:35:41,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:35:41,581 INFO L225 Difference]: With dead ends: 29 [2022-04-28 10:35:41,581 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 10:35:41,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 11 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=553, Invalid=707, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:35:41,582 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:35:41,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:35:41,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 10:35:41,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 10:35:41,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:35:41,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:41,603 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:41,603 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:41,604 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 10:35:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 10:35:41,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:35:41,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:35:41,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 10:35:41,604 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 10:35:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:41,605 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 10:35:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 10:35:41,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:35:41,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:35:41,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:35:41,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:35:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-28 10:35:41,605 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2022-04-28 10:35:41,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:35:41,606 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-28 10:35:41,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:41,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-28 10:35:41,632 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:35:41,633 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 10:35:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:35:41,633 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:35:41,633 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:35:41,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 10:35:41,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 10:35:41,834 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:35:41,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:35:41,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1592526935, now seen corresponding path program 21 times [2022-04-28 10:35:41,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:35:41,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2008469805] [2022-04-28 10:35:41,836 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:35:41,837 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:35:41,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1592526935, now seen corresponding path program 22 times [2022-04-28 10:35:41,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:35:41,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948041778] [2022-04-28 10:35:41,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:35:41,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:35:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:35:42,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:35:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:35:42,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {5477#(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(26, 2);call #Ultimate.allocInit(12, 3); {5460#true} is VALID [2022-04-28 10:35:42,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {5460#true} assume true; {5460#true} is VALID [2022-04-28 10:35:42,022 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5460#true} {5460#true} #38#return; {5460#true} is VALID [2022-04-28 10:35:42,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {5460#true} call ULTIMATE.init(); {5477#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:35:42,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {5477#(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(26, 2);call #Ultimate.allocInit(12, 3); {5460#true} is VALID [2022-04-28 10:35:42,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {5460#true} assume true; {5460#true} is VALID [2022-04-28 10:35:42,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5460#true} {5460#true} #38#return; {5460#true} is VALID [2022-04-28 10:35:42,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {5460#true} call #t~ret7 := main(); {5460#true} is VALID [2022-04-28 10:35:42,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {5460#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5460#true} is VALID [2022-04-28 10:35:42,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {5460#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {5465#(= main_~s~0 0)} is VALID [2022-04-28 10:35:42,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {5465#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5466#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:35:42,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {5466#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5467#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:42,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {5467#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5468#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:42,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {5468#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5469#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:35:42,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {5469#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5470#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:35:42,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {5470#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5471#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:35:42,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {5471#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5472#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:35:42,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {5472#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5473#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:42,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {5473#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5474#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:35:42,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {5474#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5475#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:42,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {5475#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5476#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:35:42,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {5476#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {5476#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:35:42,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {5476#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {5461#false} is VALID [2022-04-28 10:35:42,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {5461#false} assume !false; {5461#false} is VALID [2022-04-28 10:35:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:35:42,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:35:42,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948041778] [2022-04-28 10:35:42,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948041778] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:35:42,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853284741] [2022-04-28 10:35:42,033 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:35:42,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:35:42,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:35:42,036 INFO L229 MonitoredProcess]: Starting monitored process 22 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:35:42,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 10:35:42,164 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:35:42,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:35:42,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:35:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:35:42,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:35:44,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {5460#true} call ULTIMATE.init(); {5460#true} is VALID [2022-04-28 10:35:44,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {5460#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(26, 2);call #Ultimate.allocInit(12, 3); {5460#true} is VALID [2022-04-28 10:35:44,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {5460#true} assume true; {5460#true} is VALID [2022-04-28 10:35:44,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5460#true} {5460#true} #38#return; {5460#true} is VALID [2022-04-28 10:35:44,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {5460#true} call #t~ret7 := main(); {5460#true} is VALID [2022-04-28 10:35:44,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {5460#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5460#true} is VALID [2022-04-28 10:35:44,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {5460#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {5465#(= main_~s~0 0)} is VALID [2022-04-28 10:35:44,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {5465#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5466#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:35:44,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {5466#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5467#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:44,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {5467#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5468#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:44,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {5468#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5469#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:35:44,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {5469#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5470#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:35:44,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {5470#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5471#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:35:44,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {5471#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5472#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:35:44,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {5472#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5473#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:44,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {5473#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5474#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:35:44,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {5474#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5475#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:44,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {5475#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5532#(and (<= main_~s~0 (+ 2550 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-28 10:35:44,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {5532#(and (<= main_~s~0 (+ 2550 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {5532#(and (<= main_~s~0 (+ 2550 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-28 10:35:44,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {5532#(and (<= main_~s~0 (+ 2550 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {5461#false} is VALID [2022-04-28 10:35:44,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {5461#false} assume !false; {5461#false} is VALID [2022-04-28 10:35:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:35:44,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:35:58,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {5461#false} assume !false; {5461#false} is VALID [2022-04-28 10:35:58,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {5545#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {5461#false} is VALID [2022-04-28 10:35:58,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {5545#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {5545#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:35:58,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {5552#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5545#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:35:58,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {5556#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5552#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:35:58,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {5560#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5556#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:35:58,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {5564#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5560#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:35:58,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {5568#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5564#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:35:58,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {5572#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5568#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:35:58,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {5576#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5572#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:35:58,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {5580#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5576#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-28 10:35:58,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {5584#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5580#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-28 10:35:58,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {5588#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5584#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-28 10:35:58,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {5592#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5588#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-28 10:35:58,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {5460#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {5592#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:35:58,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {5460#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5460#true} is VALID [2022-04-28 10:35:58,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {5460#true} call #t~ret7 := main(); {5460#true} is VALID [2022-04-28 10:35:58,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5460#true} {5460#true} #38#return; {5460#true} is VALID [2022-04-28 10:35:58,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {5460#true} assume true; {5460#true} is VALID [2022-04-28 10:35:58,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {5460#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(26, 2);call #Ultimate.allocInit(12, 3); {5460#true} is VALID [2022-04-28 10:35:58,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {5460#true} call ULTIMATE.init(); {5460#true} is VALID [2022-04-28 10:35:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:35:58,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853284741] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:35:58,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:35:58,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:35:58,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:35:58,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2008469805] [2022-04-28 10:35:58,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2008469805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:35:58,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:35:58,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:35:58,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646145884] [2022-04-28 10:35:58,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:35:58,271 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:35:58,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:35:58,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:58,284 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:35:58,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:35:58,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:35:58,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:35:58,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=458, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:35:58,285 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:58,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:58,656 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 10:35:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:35:58,656 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:35:58,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:35:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 32 transitions. [2022-04-28 10:35:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 32 transitions. [2022-04-28 10:35:58,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 32 transitions. [2022-04-28 10:35:58,684 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:35:58,685 INFO L225 Difference]: With dead ends: 32 [2022-04-28 10:35:58,685 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 10:35:58,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=622, Invalid=938, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:35:58,686 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:35:58,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:35:58,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 10:35:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-04-28 10:35:58,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:35:58,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:58,710 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:58,710 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:58,710 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 10:35:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 10:35:58,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:35:58,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:35:58,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 10:35:58,711 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 10:35:58,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:58,711 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 10:35:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 10:35:58,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:35:58,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:35:58,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:35:58,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:35:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-28 10:35:58,712 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2022-04-28 10:35:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:35:58,712 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-28 10:35:58,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:58,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2022-04-28 10:35:58,740 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:35:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-28 10:35:58,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:35:58,740 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:35:58,740 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:35:58,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 10:35:58,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 10:35:58,944 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:35:58,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:35:58,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2123691658, now seen corresponding path program 21 times [2022-04-28 10:35:58,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:35:58,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [367951804] [2022-04-28 10:35:58,947 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:35:58,947 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:35:58,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2123691658, now seen corresponding path program 22 times [2022-04-28 10:35:58,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:35:58,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453324175] [2022-04-28 10:35:58,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:35:58,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:35:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:35:59,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:35:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:35:59,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {5835#(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(26, 2);call #Ultimate.allocInit(12, 3); {5818#true} is VALID [2022-04-28 10:35:59,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {5818#true} assume true; {5818#true} is VALID [2022-04-28 10:35:59,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5818#true} {5818#true} #38#return; {5818#true} is VALID [2022-04-28 10:35:59,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {5818#true} call ULTIMATE.init(); {5835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:35:59,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {5835#(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(26, 2);call #Ultimate.allocInit(12, 3); {5818#true} is VALID [2022-04-28 10:35:59,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {5818#true} assume true; {5818#true} is VALID [2022-04-28 10:35:59,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5818#true} {5818#true} #38#return; {5818#true} is VALID [2022-04-28 10:35:59,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {5818#true} call #t~ret7 := main(); {5818#true} is VALID [2022-04-28 10:35:59,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {5818#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5818#true} is VALID [2022-04-28 10:35:59,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {5818#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {5823#(= main_~s~0 0)} is VALID [2022-04-28 10:35:59,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {5823#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5824#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:35:59,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {5824#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5825#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:59,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {5825#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5826#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:59,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {5826#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5827#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:35:59,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {5827#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5828#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:35:59,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {5828#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5829#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:35:59,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {5829#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5830#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:35:59,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {5830#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5831#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:59,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {5831#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5832#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:35:59,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {5832#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5833#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:35:59,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {5833#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5834#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:35:59,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {5834#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {5834#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:35:59,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {5834#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {5834#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:35:59,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {5834#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume ~s~0 % 4294967296 > 65025; {5819#false} is VALID [2022-04-28 10:35:59,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {5819#false} assume !false; {5819#false} is VALID [2022-04-28 10:35:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:35:59,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:35:59,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453324175] [2022-04-28 10:35:59,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453324175] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:35:59,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269778686] [2022-04-28 10:35:59,167 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:35:59,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:35:59,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:35:59,168 INFO L229 MonitoredProcess]: Starting monitored process 23 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:35:59,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 10:35:59,329 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:35:59,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:35:59,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:35:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:35:59,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:36:00,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {5818#true} call ULTIMATE.init(); {5818#true} is VALID [2022-04-28 10:36:00,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {5818#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(26, 2);call #Ultimate.allocInit(12, 3); {5818#true} is VALID [2022-04-28 10:36:00,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {5818#true} assume true; {5818#true} is VALID [2022-04-28 10:36:00,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5818#true} {5818#true} #38#return; {5818#true} is VALID [2022-04-28 10:36:00,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {5818#true} call #t~ret7 := main(); {5818#true} is VALID [2022-04-28 10:36:00,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {5818#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5818#true} is VALID [2022-04-28 10:36:00,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {5818#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {5823#(= main_~s~0 0)} is VALID [2022-04-28 10:36:00,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {5823#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5824#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:36:00,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {5824#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5825#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:00,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {5825#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5826#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:00,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {5826#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5827#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:36:00,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {5827#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5828#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:36:00,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {5828#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5829#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:36:00,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {5829#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5830#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:36:00,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {5830#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5831#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:00,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {5831#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5832#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:36:00,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {5832#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5833#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:00,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {5833#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5834#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:36:00,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {5834#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {5834#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:36:00,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {5834#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {5834#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:36:00,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {5834#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume ~s~0 % 4294967296 > 65025; {5819#false} is VALID [2022-04-28 10:36:00,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {5819#false} assume !false; {5819#false} is VALID [2022-04-28 10:36:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:36:00,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:36:21,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {5819#false} assume !false; {5819#false} is VALID [2022-04-28 10:36:21,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {5905#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {5819#false} is VALID [2022-04-28 10:36:21,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {5905#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {5905#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:36:21,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {5905#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {5905#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:36:21,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {5915#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5905#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:36:22,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {5919#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5915#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:36:22,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {5923#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5919#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:36:22,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {5927#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5923#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:36:22,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {5931#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5927#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:36:22,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {5935#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5931#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:36:22,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {5939#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5935#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-28 10:36:22,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {5943#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5939#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-28 10:36:22,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {5947#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5943#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-28 10:36:22,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {5951#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5947#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is VALID [2022-04-28 10:36:22,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {5955#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {5951#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:36:22,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {5818#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {5955#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} is VALID [2022-04-28 10:36:22,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {5818#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5818#true} is VALID [2022-04-28 10:36:22,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {5818#true} call #t~ret7 := main(); {5818#true} is VALID [2022-04-28 10:36:22,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5818#true} {5818#true} #38#return; {5818#true} is VALID [2022-04-28 10:36:22,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {5818#true} assume true; {5818#true} is VALID [2022-04-28 10:36:22,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {5818#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(26, 2);call #Ultimate.allocInit(12, 3); {5818#true} is VALID [2022-04-28 10:36:22,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {5818#true} call ULTIMATE.init(); {5818#true} is VALID [2022-04-28 10:36:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:36:22,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269778686] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:36:22,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:36:22,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 27 [2022-04-28 10:36:22,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:36:22,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [367951804] [2022-04-28 10:36:22,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [367951804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:36:22,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:36:22,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:36:22,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183943314] [2022-04-28 10:36:22,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:36:22,773 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 10:36:22,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:36:22,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:22,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:36:22,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:36:22,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:36:22,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:36:22,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2022-04-28 10:36:22,787 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:36:23,017 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 10:36:23,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:36:23,018 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 10:36:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:36:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 30 transitions. [2022-04-28 10:36:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 30 transitions. [2022-04-28 10:36:23,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 30 transitions. [2022-04-28 10:36:23,049 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:36:23,049 INFO L225 Difference]: With dead ends: 30 [2022-04-28 10:36:23,049 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 10:36:23,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=651, Invalid=831, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 10:36:23,050 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:36:23,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:36:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 10:36:23,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 10:36:23,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:36:23,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:23,082 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:23,082 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:23,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:36:23,083 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 10:36:23,083 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 10:36:23,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:36:23,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:36:23,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 10:36:23,083 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 10:36:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:36:23,084 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 10:36:23,084 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 10:36:23,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:36:23,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:36:23,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:36:23,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:36:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-28 10:36:23,084 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2022-04-28 10:36:23,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:36:23,085 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-28 10:36:23,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:23,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-28 10:36:23,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:36:23,107 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 10:36:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:36:23,108 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:36:23,108 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:36:23,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 10:36:23,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:36:23,312 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:36:23,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:36:23,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2123642839, now seen corresponding path program 23 times [2022-04-28 10:36:23,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:36:23,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1590902409] [2022-04-28 10:36:23,315 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:36:23,315 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:36:23,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2123642839, now seen corresponding path program 24 times [2022-04-28 10:36:23,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:36:23,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602648277] [2022-04-28 10:36:23,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:36:23,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:36:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:36:23,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:36:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:36:23,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {6185#(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(26, 2);call #Ultimate.allocInit(12, 3); {6167#true} is VALID [2022-04-28 10:36:23,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {6167#true} assume true; {6167#true} is VALID [2022-04-28 10:36:23,514 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6167#true} {6167#true} #38#return; {6167#true} is VALID [2022-04-28 10:36:23,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {6167#true} call ULTIMATE.init(); {6185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:36:23,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {6185#(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(26, 2);call #Ultimate.allocInit(12, 3); {6167#true} is VALID [2022-04-28 10:36:23,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {6167#true} assume true; {6167#true} is VALID [2022-04-28 10:36:23,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6167#true} {6167#true} #38#return; {6167#true} is VALID [2022-04-28 10:36:23,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {6167#true} call #t~ret7 := main(); {6167#true} is VALID [2022-04-28 10:36:23,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {6167#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6167#true} is VALID [2022-04-28 10:36:23,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {6167#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {6172#(= main_~s~0 0)} is VALID [2022-04-28 10:36:23,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {6172#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6173#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:36:23,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {6173#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6174#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:23,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {6174#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6175#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:23,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {6175#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6176#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:36:23,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {6176#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6177#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:36:23,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {6177#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6178#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:36:23,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {6178#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6179#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:36:23,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {6179#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6180#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:23,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {6180#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6181#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:36:23,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {6181#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6182#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:23,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {6182#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6183#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:36:23,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {6183#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6184#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:36:23,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {6184#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {6184#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:36:23,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {6184#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {6168#false} is VALID [2022-04-28 10:36:23,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {6168#false} assume !false; {6168#false} is VALID [2022-04-28 10:36:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:36:23,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:36:23,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602648277] [2022-04-28 10:36:23,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602648277] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:36:23,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256679889] [2022-04-28 10:36:23,524 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:36:23,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:36:23,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:36:23,525 INFO L229 MonitoredProcess]: Starting monitored process 24 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:36:23,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 10:36:23,679 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:36:23,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:36:23,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:36:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:36:23,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:36:25,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {6167#true} call ULTIMATE.init(); {6167#true} is VALID [2022-04-28 10:36:25,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {6167#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(26, 2);call #Ultimate.allocInit(12, 3); {6167#true} is VALID [2022-04-28 10:36:25,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {6167#true} assume true; {6167#true} is VALID [2022-04-28 10:36:25,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6167#true} {6167#true} #38#return; {6167#true} is VALID [2022-04-28 10:36:25,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {6167#true} call #t~ret7 := main(); {6167#true} is VALID [2022-04-28 10:36:25,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {6167#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6167#true} is VALID [2022-04-28 10:36:25,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {6167#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {6172#(= main_~s~0 0)} is VALID [2022-04-28 10:36:25,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {6172#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6173#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:36:25,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {6173#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6174#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:25,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {6174#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6175#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:25,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {6175#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6176#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:36:25,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {6176#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6177#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:36:25,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {6177#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6178#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:36:25,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {6178#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6179#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:36:25,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {6179#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6180#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:25,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {6180#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6181#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:36:25,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {6181#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6182#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:25,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {6182#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6183#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:36:25,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {6183#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6243#(and (<= main_~s~0 (+ 2805 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-28 10:36:25,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {6243#(and (<= main_~s~0 (+ 2805 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {6243#(and (<= main_~s~0 (+ 2805 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-28 10:36:25,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {6243#(and (<= main_~s~0 (+ 2805 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {6168#false} is VALID [2022-04-28 10:36:25,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {6168#false} assume !false; {6168#false} is VALID [2022-04-28 10:36:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:36:25,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:36:39,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {6168#false} assume !false; {6168#false} is VALID [2022-04-28 10:36:39,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {6256#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {6168#false} is VALID [2022-04-28 10:36:39,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {6256#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {6256#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:36:39,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {6263#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6256#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:36:39,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {6267#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6263#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:36:39,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {6271#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6267#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:36:39,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {6275#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6271#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:36:39,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {6279#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6275#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:36:39,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {6283#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6279#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:36:39,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {6287#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6283#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:36:39,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {6291#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6287#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-28 10:36:39,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {6295#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6291#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-28 10:36:39,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {6299#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6295#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-28 10:36:39,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {6303#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6299#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-28 10:36:39,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {6307#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6303#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:36:39,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {6167#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {6307#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} is VALID [2022-04-28 10:36:39,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {6167#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6167#true} is VALID [2022-04-28 10:36:39,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {6167#true} call #t~ret7 := main(); {6167#true} is VALID [2022-04-28 10:36:39,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6167#true} {6167#true} #38#return; {6167#true} is VALID [2022-04-28 10:36:39,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {6167#true} assume true; {6167#true} is VALID [2022-04-28 10:36:39,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {6167#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(26, 2);call #Ultimate.allocInit(12, 3); {6167#true} is VALID [2022-04-28 10:36:39,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {6167#true} call ULTIMATE.init(); {6167#true} is VALID [2022-04-28 10:36:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:36:39,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256679889] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:36:39,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:36:39,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:36:39,349 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:36:39,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1590902409] [2022-04-28 10:36:39,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1590902409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:36:39,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:36:39,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:36:39,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000897682] [2022-04-28 10:36:39,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:36:39,350 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 10:36:39,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:36:39,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:39,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:36:39,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:36:39,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:36:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:36:39,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=522, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:36:39,365 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:36:39,770 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 10:36:39,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:36:39,770 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 10:36:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:36:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 33 transitions. [2022-04-28 10:36:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 33 transitions. [2022-04-28 10:36:39,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 33 transitions. [2022-04-28 10:36:39,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:36:39,799 INFO L225 Difference]: With dead ends: 33 [2022-04-28 10:36:39,799 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 10:36:39,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 21 SyntacticMatches, 11 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=725, Invalid=1081, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:36:39,800 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:36:39,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:36:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 10:36:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-04-28 10:36:39,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:36:39,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:39,826 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:39,826 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:36:39,827 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 10:36:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 10:36:39,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:36:39,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:36:39,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 10:36:39,827 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 10:36:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:36:39,828 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 10:36:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 10:36:39,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:36:39,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:36:39,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:36:39,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:36:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-04-28 10:36:39,828 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2022-04-28 10:36:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:36:39,829 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-04-28 10:36:39,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:39,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2022-04-28 10:36:39,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:36:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-28 10:36:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:36:39,856 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:36:39,856 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:36:39,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 10:36:40,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:36:40,060 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:36:40,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:36:40,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1408415498, now seen corresponding path program 23 times [2022-04-28 10:36:40,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:36:40,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1164312971] [2022-04-28 10:36:40,063 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:36:40,063 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:36:40,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1408415498, now seen corresponding path program 24 times [2022-04-28 10:36:40,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:36:40,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413088849] [2022-04-28 10:36:40,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:36:40,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:36:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:36:40,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:36:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:36:40,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {6559#(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(26, 2);call #Ultimate.allocInit(12, 3); {6541#true} is VALID [2022-04-28 10:36:40,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {6541#true} assume true; {6541#true} is VALID [2022-04-28 10:36:40,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6541#true} {6541#true} #38#return; {6541#true} is VALID [2022-04-28 10:36:40,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {6541#true} call ULTIMATE.init(); {6559#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:36:40,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {6559#(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(26, 2);call #Ultimate.allocInit(12, 3); {6541#true} is VALID [2022-04-28 10:36:40,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {6541#true} assume true; {6541#true} is VALID [2022-04-28 10:36:40,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6541#true} {6541#true} #38#return; {6541#true} is VALID [2022-04-28 10:36:40,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {6541#true} call #t~ret7 := main(); {6541#true} is VALID [2022-04-28 10:36:40,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {6541#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6541#true} is VALID [2022-04-28 10:36:40,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {6541#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {6546#(= main_~s~0 0)} is VALID [2022-04-28 10:36:40,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {6546#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6547#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:36:40,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {6547#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6548#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:40,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {6548#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6549#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:40,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {6549#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6550#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:36:40,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {6550#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6551#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:36:40,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {6551#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6552#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:36:40,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {6552#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6553#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:36:40,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {6553#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6554#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:40,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {6554#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6555#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:36:40,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {6555#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6556#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:40,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {6556#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6557#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:36:40,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {6557#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6558#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:40,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {6558#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {6558#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:40,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {6558#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {6558#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:40,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {6558#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {6542#false} is VALID [2022-04-28 10:36:40,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {6542#false} assume !false; {6542#false} is VALID [2022-04-28 10:36:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:36:40,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:36:40,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413088849] [2022-04-28 10:36:40,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413088849] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:36:40,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711103531] [2022-04-28 10:36:40,272 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:36:40,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:36:40,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:36:40,274 INFO L229 MonitoredProcess]: Starting monitored process 25 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:36:40,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 10:36:40,477 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:36:40,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:36:40,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:36:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:36:40,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:36:42,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {6541#true} call ULTIMATE.init(); {6541#true} is VALID [2022-04-28 10:36:42,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {6541#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(26, 2);call #Ultimate.allocInit(12, 3); {6541#true} is VALID [2022-04-28 10:36:42,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {6541#true} assume true; {6541#true} is VALID [2022-04-28 10:36:42,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6541#true} {6541#true} #38#return; {6541#true} is VALID [2022-04-28 10:36:42,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {6541#true} call #t~ret7 := main(); {6541#true} is VALID [2022-04-28 10:36:42,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {6541#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6541#true} is VALID [2022-04-28 10:36:42,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {6541#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {6546#(= main_~s~0 0)} is VALID [2022-04-28 10:36:42,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {6546#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6547#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:36:42,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {6547#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6548#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:42,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {6548#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6549#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:42,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {6549#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6550#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:36:42,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {6550#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6551#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:36:42,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {6551#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6552#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:36:42,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {6552#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6553#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:36:42,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {6553#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6554#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:42,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {6554#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6555#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:36:42,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {6555#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6556#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:42,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {6556#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6557#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:36:42,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {6557#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6558#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:42,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {6558#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {6558#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:42,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {6558#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {6558#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:36:42,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {6558#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {6542#false} is VALID [2022-04-28 10:36:42,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {6542#false} assume !false; {6542#false} is VALID [2022-04-28 10:36:42,306 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:36:42,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:37:01,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {6542#false} assume !false; {6542#false} is VALID [2022-04-28 10:37:01,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {6632#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {6542#false} is VALID [2022-04-28 10:37:01,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {6632#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {6632#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:37:01,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {6632#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {6632#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:37:01,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {6642#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6632#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:37:01,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {6646#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6642#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:37:02,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {6650#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6646#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:37:02,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {6654#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6650#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:37:02,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {6658#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6654#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:37:02,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {6662#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6658#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:37:02,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {6666#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6662#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-28 10:37:02,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {6670#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6666#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-28 10:37:02,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {6674#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6670#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-28 10:37:02,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {6678#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6674#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is VALID [2022-04-28 10:37:02,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {6682#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6678#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:37:02,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {6686#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6682#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} is VALID [2022-04-28 10:37:02,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {6541#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {6686#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:37:02,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {6541#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6541#true} is VALID [2022-04-28 10:37:02,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {6541#true} call #t~ret7 := main(); {6541#true} is VALID [2022-04-28 10:37:02,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6541#true} {6541#true} #38#return; {6541#true} is VALID [2022-04-28 10:37:02,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {6541#true} assume true; {6541#true} is VALID [2022-04-28 10:37:02,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {6541#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(26, 2);call #Ultimate.allocInit(12, 3); {6541#true} is VALID [2022-04-28 10:37:02,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {6541#true} call ULTIMATE.init(); {6541#true} is VALID [2022-04-28 10:37:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:37:02,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711103531] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:37:02,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:37:02,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 29 [2022-04-28 10:37:02,118 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:37:02,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1164312971] [2022-04-28 10:37:02,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1164312971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:37:02,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:37:02,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:37:02,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447356479] [2022-04-28 10:37:02,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:37:02,118 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:37:02,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:37:02,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:02,132 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:37:02,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:37:02,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:37:02,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:37:02,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:37:02,134 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:02,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:37:02,385 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 10:37:02,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:37:02,385 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:37:02,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:37:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:02,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 31 transitions. [2022-04-28 10:37:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 31 transitions. [2022-04-28 10:37:02,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 31 transitions. [2022-04-28 10:37:02,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:37:02,409 INFO L225 Difference]: With dead ends: 31 [2022-04-28 10:37:02,409 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 10:37:02,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 13 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=757, Invalid=965, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:37:02,410 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:37:02,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:37:02,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 10:37:02,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 10:37:02,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:37:02,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:02,435 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:02,435 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:37:02,435 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 10:37:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 10:37:02,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:37:02,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:37:02,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 10:37:02,436 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 10:37:02,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:37:02,436 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 10:37:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 10:37:02,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:37:02,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:37:02,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:37:02,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:37:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-28 10:37:02,437 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2022-04-28 10:37:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:37:02,437 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-28 10:37:02,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:02,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-28 10:37:02,461 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:37:02,461 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 10:37:02,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:37:02,461 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:37:02,462 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:37:02,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 10:37:02,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 10:37:02,662 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:37:02,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:37:02,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1408366679, now seen corresponding path program 25 times [2022-04-28 10:37:02,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:37:02,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [506356668] [2022-04-28 10:37:02,665 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:37:02,665 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:37:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1408366679, now seen corresponding path program 26 times [2022-04-28 10:37:02,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:37:02,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521549769] [2022-04-28 10:37:02,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:37:02,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:37:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:37:02,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:37:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:37:02,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {6925#(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(26, 2);call #Ultimate.allocInit(12, 3); {6906#true} is VALID [2022-04-28 10:37:02,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {6906#true} assume true; {6906#true} is VALID [2022-04-28 10:37:02,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6906#true} {6906#true} #38#return; {6906#true} is VALID [2022-04-28 10:37:02,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {6906#true} call ULTIMATE.init(); {6925#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:37:02,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {6925#(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(26, 2);call #Ultimate.allocInit(12, 3); {6906#true} is VALID [2022-04-28 10:37:02,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {6906#true} assume true; {6906#true} is VALID [2022-04-28 10:37:02,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6906#true} {6906#true} #38#return; {6906#true} is VALID [2022-04-28 10:37:02,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {6906#true} call #t~ret7 := main(); {6906#true} is VALID [2022-04-28 10:37:02,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {6906#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6906#true} is VALID [2022-04-28 10:37:02,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {6906#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {6911#(= main_~s~0 0)} is VALID [2022-04-28 10:37:02,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {6911#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6912#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:37:02,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {6912#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6913#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:02,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {6913#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6914#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:02,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {6914#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6915#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:37:02,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {6915#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6916#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:37:02,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {6916#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6917#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:37:02,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {6917#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6918#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:37:02,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {6918#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6919#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:02,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {6919#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6920#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:37:02,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {6920#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6921#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:02,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {6921#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6922#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:37:02,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {6922#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6923#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:02,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {6923#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6924#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:37:02,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {6924#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {6924#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:37:02,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {6924#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {6907#false} is VALID [2022-04-28 10:37:02,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {6907#false} assume !false; {6907#false} is VALID [2022-04-28 10:37:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:37:02,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:37:02,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521549769] [2022-04-28 10:37:02,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521549769] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:37:02,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636690166] [2022-04-28 10:37:02,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:37:02,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:37:02,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:37:02,909 INFO L229 MonitoredProcess]: Starting monitored process 26 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:37:02,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 10:37:03,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:37:03,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:37:03,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:37:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:37:03,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:37:05,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {6906#true} call ULTIMATE.init(); {6906#true} is VALID [2022-04-28 10:37:05,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {6906#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(26, 2);call #Ultimate.allocInit(12, 3); {6906#true} is VALID [2022-04-28 10:37:05,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {6906#true} assume true; {6906#true} is VALID [2022-04-28 10:37:05,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6906#true} {6906#true} #38#return; {6906#true} is VALID [2022-04-28 10:37:05,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {6906#true} call #t~ret7 := main(); {6906#true} is VALID [2022-04-28 10:37:05,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {6906#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6906#true} is VALID [2022-04-28 10:37:05,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {6906#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {6911#(= main_~s~0 0)} is VALID [2022-04-28 10:37:05,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {6911#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6912#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:37:05,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {6912#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6913#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:05,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {6913#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6914#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:05,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {6914#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6915#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:37:05,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {6915#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6916#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:37:05,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {6916#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6917#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:37:05,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {6917#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6918#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:37:05,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {6918#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6919#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:05,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {6919#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6920#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:37:05,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {6920#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6921#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:05,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {6921#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6922#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:37:05,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {6922#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6923#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:05,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {6923#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6986#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 3060 (mod main_~v~0 256))))} is VALID [2022-04-28 10:37:05,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {6986#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 3060 (mod main_~v~0 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {6986#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 3060 (mod main_~v~0 256))))} is VALID [2022-04-28 10:37:05,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {6986#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 3060 (mod main_~v~0 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {6907#false} is VALID [2022-04-28 10:37:05,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {6907#false} assume !false; {6907#false} is VALID [2022-04-28 10:37:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:37:05,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:37:25,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {6907#false} assume !false; {6907#false} is VALID [2022-04-28 10:37:25,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {6999#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {6907#false} is VALID [2022-04-28 10:37:25,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {6999#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {6999#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:37:25,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {7006#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {6999#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:37:25,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {7010#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7006#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:37:25,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {7014#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7010#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:37:25,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {7018#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7014#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:37:25,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {7022#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7018#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:37:25,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {7026#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7022#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:37:25,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {7030#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7026#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:37:25,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {7034#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7030#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-28 10:37:25,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {7038#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7034#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-28 10:37:25,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {7042#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7038#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-28 10:37:25,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {7046#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7042#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-28 10:37:25,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {7050#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7046#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:37:25,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {7054#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7050#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} is VALID [2022-04-28 10:37:25,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {6906#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {7054#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:37:25,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {6906#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6906#true} is VALID [2022-04-28 10:37:25,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {6906#true} call #t~ret7 := main(); {6906#true} is VALID [2022-04-28 10:37:25,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6906#true} {6906#true} #38#return; {6906#true} is VALID [2022-04-28 10:37:25,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {6906#true} assume true; {6906#true} is VALID [2022-04-28 10:37:25,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {6906#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(26, 2);call #Ultimate.allocInit(12, 3); {6906#true} is VALID [2022-04-28 10:37:25,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {6906#true} call ULTIMATE.init(); {6906#true} is VALID [2022-04-28 10:37:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:37:25,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636690166] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:37:25,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:37:25,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:37:25,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:37:25,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [506356668] [2022-04-28 10:37:25,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [506356668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:37:25,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:37:25,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:37:25,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188157970] [2022-04-28 10:37:25,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:37:25,704 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:37:25,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:37:25,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:25,719 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:37:25,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:37:25,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:37:25,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:37:25,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=590, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:37:25,720 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:26,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:37:26,220 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 10:37:26,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:37:26,220 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:37:26,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:37:26,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 34 transitions. [2022-04-28 10:37:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 34 transitions. [2022-04-28 10:37:26,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 34 transitions. [2022-04-28 10:37:26,247 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:37:26,248 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:37:26,248 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 10:37:26,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 12 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=836, Invalid=1234, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:37:26,249 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:37:26,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 48 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:37:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 10:37:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-04-28 10:37:26,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:37:26,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:26,278 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:26,278 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:37:26,279 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 10:37:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 10:37:26,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:37:26,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:37:26,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 10:37:26,279 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 10:37:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:37:26,280 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 10:37:26,280 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 10:37:26,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:37:26,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:37:26,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:37:26,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:37:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-28 10:37:26,280 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 23 [2022-04-28 10:37:26,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:37:26,281 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-28 10:37:26,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:26,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-28 10:37:26,311 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:37:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 10:37:26,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:37:26,311 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:37:26,311 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:37:26,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 10:37:26,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 10:37:26,512 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:37:26,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:37:26,512 INFO L85 PathProgramCache]: Analyzing trace with hash -709691018, now seen corresponding path program 25 times [2022-04-28 10:37:26,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:37:26,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1408825240] [2022-04-28 10:37:26,514 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:37:26,515 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:37:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash -709691018, now seen corresponding path program 26 times [2022-04-28 10:37:26,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:37:26,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84124804] [2022-04-28 10:37:26,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:37:26,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:37:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:37:26,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:37:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:37:26,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {7315#(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(26, 2);call #Ultimate.allocInit(12, 3); {7296#true} is VALID [2022-04-28 10:37:26,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {7296#true} assume true; {7296#true} is VALID [2022-04-28 10:37:26,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7296#true} {7296#true} #38#return; {7296#true} is VALID [2022-04-28 10:37:26,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {7296#true} call ULTIMATE.init(); {7315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:37:26,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {7315#(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(26, 2);call #Ultimate.allocInit(12, 3); {7296#true} is VALID [2022-04-28 10:37:26,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {7296#true} assume true; {7296#true} is VALID [2022-04-28 10:37:26,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7296#true} {7296#true} #38#return; {7296#true} is VALID [2022-04-28 10:37:26,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {7296#true} call #t~ret7 := main(); {7296#true} is VALID [2022-04-28 10:37:26,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {7296#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {7296#true} is VALID [2022-04-28 10:37:26,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {7296#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {7301#(= main_~s~0 0)} is VALID [2022-04-28 10:37:26,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {7301#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7302#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:37:26,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {7302#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7303#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:26,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {7303#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7304#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:26,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {7304#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7305#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:37:26,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {7305#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7306#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:37:26,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {7306#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7307#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:37:26,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {7307#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7308#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:37:26,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {7308#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7309#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:26,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {7309#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7310#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:37:26,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {7310#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7311#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:26,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {7311#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7312#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:37:26,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {7312#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7313#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:26,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {7313#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7314#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:26,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {7314#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {7314#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:26,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {7314#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {7314#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:26,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {7314#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {7297#false} is VALID [2022-04-28 10:37:26,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {7297#false} assume !false; {7297#false} is VALID [2022-04-28 10:37:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:37:26,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:37:26,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84124804] [2022-04-28 10:37:26,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84124804] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:37:26,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829036744] [2022-04-28 10:37:26,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:37:26,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:37:26,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:37:26,767 INFO L229 MonitoredProcess]: Starting monitored process 27 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:37:26,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 10:37:26,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:37:26,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:37:26,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:37:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:37:26,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:37:28,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {7296#true} call ULTIMATE.init(); {7296#true} is VALID [2022-04-28 10:37:28,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {7296#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(26, 2);call #Ultimate.allocInit(12, 3); {7296#true} is VALID [2022-04-28 10:37:28,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {7296#true} assume true; {7296#true} is VALID [2022-04-28 10:37:28,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7296#true} {7296#true} #38#return; {7296#true} is VALID [2022-04-28 10:37:28,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {7296#true} call #t~ret7 := main(); {7296#true} is VALID [2022-04-28 10:37:28,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {7296#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {7296#true} is VALID [2022-04-28 10:37:28,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {7296#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {7301#(= main_~s~0 0)} is VALID [2022-04-28 10:37:28,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {7301#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7302#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:37:28,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {7302#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7303#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:28,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {7303#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7304#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:28,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {7304#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7305#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:37:28,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {7305#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7306#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:37:28,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {7306#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7307#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:37:28,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {7307#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7308#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:37:28,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {7308#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7309#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:28,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {7309#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7310#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:37:28,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {7310#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7311#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:28,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {7311#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7312#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:37:28,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {7312#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7313#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:28,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {7313#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7314#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:28,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {7314#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {7314#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:28,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {7314#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {7314#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:28,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {7314#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {7297#false} is VALID [2022-04-28 10:37:28,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {7297#false} assume !false; {7297#false} is VALID [2022-04-28 10:37:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:37:28,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:37:48,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {7297#false} assume !false; {7297#false} is VALID [2022-04-28 10:37:48,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {7391#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {7297#false} is VALID [2022-04-28 10:37:48,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {7391#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {7391#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:37:48,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {7391#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {7391#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:37:48,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {7401#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7391#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:37:48,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {7405#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7401#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:37:48,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {7409#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7405#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:37:48,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {7413#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7409#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:37:48,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {7417#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7413#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:37:48,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {7421#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7417#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:37:48,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {7425#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7421#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-28 10:37:48,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {7429#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7425#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-28 10:37:48,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {7433#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7429#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-28 10:37:48,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {7437#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7433#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is VALID [2022-04-28 10:37:48,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {7441#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7437#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:37:48,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {7445#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7441#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} is VALID [2022-04-28 10:37:48,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {7449#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7445#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:37:48,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {7296#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {7449#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} is VALID [2022-04-28 10:37:48,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {7296#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {7296#true} is VALID [2022-04-28 10:37:48,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {7296#true} call #t~ret7 := main(); {7296#true} is VALID [2022-04-28 10:37:48,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7296#true} {7296#true} #38#return; {7296#true} is VALID [2022-04-28 10:37:48,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {7296#true} assume true; {7296#true} is VALID [2022-04-28 10:37:48,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {7296#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(26, 2);call #Ultimate.allocInit(12, 3); {7296#true} is VALID [2022-04-28 10:37:48,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {7296#true} call ULTIMATE.init(); {7296#true} is VALID [2022-04-28 10:37:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:37:48,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829036744] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:37:48,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:37:48,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 31 [2022-04-28 10:37:48,483 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:37:48,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1408825240] [2022-04-28 10:37:48,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1408825240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:37:48,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:37:48,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:37:48,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610984271] [2022-04-28 10:37:48,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:37:48,483 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 10:37:48,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:37:48,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:48,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:37:48,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:37:48,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:37:48,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:37:48,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:37:48,499 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:37:48,763 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 10:37:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:37:48,764 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 10:37:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:37:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 32 transitions. [2022-04-28 10:37:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 32 transitions. [2022-04-28 10:37:48,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 32 transitions. [2022-04-28 10:37:48,805 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:37:48,806 INFO L225 Difference]: With dead ends: 32 [2022-04-28 10:37:48,806 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 10:37:48,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 23 SyntacticMatches, 14 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=871, Invalid=1109, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 10:37:48,807 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:37:48,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 29 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:37:48,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 10:37:48,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 10:37:48,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:37:48,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:48,835 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:48,835 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:37:48,835 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 10:37:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 10:37:48,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:37:48,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:37:48,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 10:37:48,836 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 10:37:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:37:48,836 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 10:37:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 10:37:48,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:37:48,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:37:48,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:37:48,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:37:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-28 10:37:48,837 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2022-04-28 10:37:48,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:37:48,837 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-28 10:37:48,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:48,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-28 10:37:48,863 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:37:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 10:37:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:37:48,864 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:37:48,864 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:37:48,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-28 10:37:49,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 10:37:49,064 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:37:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:37:49,065 INFO L85 PathProgramCache]: Analyzing trace with hash -709642199, now seen corresponding path program 27 times [2022-04-28 10:37:49,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:37:49,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [827797695] [2022-04-28 10:37:49,068 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:37:49,068 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:37:49,068 INFO L85 PathProgramCache]: Analyzing trace with hash -709642199, now seen corresponding path program 28 times [2022-04-28 10:37:49,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:37:49,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771118720] [2022-04-28 10:37:49,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:37:49,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:37:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:37:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:37:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:37:49,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {7697#(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(26, 2);call #Ultimate.allocInit(12, 3); {7677#true} is VALID [2022-04-28 10:37:49,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {7677#true} assume true; {7677#true} is VALID [2022-04-28 10:37:49,290 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7677#true} {7677#true} #38#return; {7677#true} is VALID [2022-04-28 10:37:49,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {7677#true} call ULTIMATE.init(); {7697#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:37:49,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {7697#(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(26, 2);call #Ultimate.allocInit(12, 3); {7677#true} is VALID [2022-04-28 10:37:49,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {7677#true} assume true; {7677#true} is VALID [2022-04-28 10:37:49,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7677#true} {7677#true} #38#return; {7677#true} is VALID [2022-04-28 10:37:49,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {7677#true} call #t~ret7 := main(); {7677#true} is VALID [2022-04-28 10:37:49,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {7677#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {7677#true} is VALID [2022-04-28 10:37:49,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {7677#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {7682#(= main_~s~0 0)} is VALID [2022-04-28 10:37:49,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {7682#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7683#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:37:49,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {7683#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7684#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:49,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {7684#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7685#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:49,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {7685#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7686#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:37:49,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {7686#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7687#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:37:49,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {7687#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7688#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:37:49,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {7688#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7689#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:37:49,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {7689#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7690#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:49,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {7690#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7691#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:37:49,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {7691#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7692#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:49,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {7692#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7693#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:37:49,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {7693#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7694#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:49,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {7694#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7695#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:49,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {7695#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7696#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:37:49,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {7696#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {7696#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:37:49,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {7696#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {7678#false} is VALID [2022-04-28 10:37:49,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {7678#false} assume !false; {7678#false} is VALID [2022-04-28 10:37:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:37:49,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:37:49,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771118720] [2022-04-28 10:37:49,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771118720] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:37:49,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551490088] [2022-04-28 10:37:49,301 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:37:49,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:37:49,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:37:49,302 INFO L229 MonitoredProcess]: Starting monitored process 28 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:37:49,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 10:37:49,796 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:37:49,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:37:49,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:37:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:37:49,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:37:52,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {7677#true} call ULTIMATE.init(); {7677#true} is VALID [2022-04-28 10:37:52,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {7677#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(26, 2);call #Ultimate.allocInit(12, 3); {7677#true} is VALID [2022-04-28 10:37:52,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {7677#true} assume true; {7677#true} is VALID [2022-04-28 10:37:52,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7677#true} {7677#true} #38#return; {7677#true} is VALID [2022-04-28 10:37:52,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {7677#true} call #t~ret7 := main(); {7677#true} is VALID [2022-04-28 10:37:52,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {7677#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {7677#true} is VALID [2022-04-28 10:37:52,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {7677#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {7682#(= main_~s~0 0)} is VALID [2022-04-28 10:37:52,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {7682#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7683#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:37:52,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {7683#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7684#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:52,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {7684#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7685#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:52,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {7685#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7686#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:37:52,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {7686#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7687#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:37:52,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {7687#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7688#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:37:52,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {7688#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7689#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:37:52,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {7689#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7690#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:52,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {7690#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7691#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:37:52,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {7691#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7692#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:52,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {7692#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7693#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:37:52,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {7693#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7694#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:52,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {7694#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7695#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:37:52,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {7695#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7761#(and (<= main_~s~0 (+ (mod main_~v~0 256) 3315)) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-28 10:37:52,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {7761#(and (<= main_~s~0 (+ (mod main_~v~0 256) 3315)) (<= (mod main_~v~0 256) main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {7761#(and (<= main_~s~0 (+ (mod main_~v~0 256) 3315)) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-28 10:37:52,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {7761#(and (<= main_~s~0 (+ (mod main_~v~0 256) 3315)) (<= (mod main_~v~0 256) main_~s~0))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {7678#false} is VALID [2022-04-28 10:37:52,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {7678#false} assume !false; {7678#false} is VALID [2022-04-28 10:37:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:37:52,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:38:07,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {7678#false} assume !false; {7678#false} is VALID [2022-04-28 10:38:07,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {7774#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {7678#false} is VALID [2022-04-28 10:38:07,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {7774#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {7774#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:38:07,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {7781#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7774#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:38:07,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {7785#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7781#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:38:07,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {7789#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7785#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:38:07,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {7793#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7789#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:38:07,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {7797#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7793#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:38:07,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {7801#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7797#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:38:07,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {7805#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7801#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:38:07,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {7809#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7805#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-28 10:38:07,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {7813#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7809#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-28 10:38:07,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {7817#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7813#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-28 10:38:07,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {7821#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7817#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-28 10:38:07,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {7825#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7821#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:38:07,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {7829#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7825#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} is VALID [2022-04-28 10:38:07,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {7833#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {7829#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:38:07,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {7677#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {7833#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} is VALID [2022-04-28 10:38:07,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {7677#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {7677#true} is VALID [2022-04-28 10:38:07,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {7677#true} call #t~ret7 := main(); {7677#true} is VALID [2022-04-28 10:38:07,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7677#true} {7677#true} #38#return; {7677#true} is VALID [2022-04-28 10:38:07,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {7677#true} assume true; {7677#true} is VALID [2022-04-28 10:38:07,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {7677#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(26, 2);call #Ultimate.allocInit(12, 3); {7677#true} is VALID [2022-04-28 10:38:07,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {7677#true} call ULTIMATE.init(); {7677#true} is VALID [2022-04-28 10:38:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:07,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551490088] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:38:07,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:38:07,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:38:07,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:38:07,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [827797695] [2022-04-28 10:38:07,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [827797695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:38:07,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:38:07,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:38:07,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172440848] [2022-04-28 10:38:07,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:38:07,374 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 10:38:07,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:38:07,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:07,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:07,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:38:07,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:07,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:38:07,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=662, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:38:07,389 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:07,917 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 10:38:07,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:38:07,917 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 10:38:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:38:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 35 transitions. [2022-04-28 10:38:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 35 transitions. [2022-04-28 10:38:07,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 35 transitions. [2022-04-28 10:38:07,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:07,948 INFO L225 Difference]: With dead ends: 35 [2022-04-28 10:38:07,948 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 10:38:07,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 21 SyntacticMatches, 13 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=955, Invalid=1397, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:38:07,949 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:38:07,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 38 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:38:07,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 10:38:07,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-04-28 10:38:07,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:38:07,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:07,981 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:07,981 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:07,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:07,982 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 10:38:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 10:38:07,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:07,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:07,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 10:38:07,982 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 10:38:07,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:07,983 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 10:38:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 10:38:07,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:07,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:07,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:38:07,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:38:07,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-04-28 10:38:07,983 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2022-04-28 10:38:07,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:38:07,984 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-04-28 10:38:07,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:07,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 31 transitions. [2022-04-28 10:38:08,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:08,015 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 10:38:08,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:38:08,015 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:38:08,015 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:38:08,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 10:38:08,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 10:38:08,216 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:38:08,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:38:08,216 INFO L85 PathProgramCache]: Analyzing trace with hash -524068618, now seen corresponding path program 27 times [2022-04-28 10:38:08,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:08,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [545080419] [2022-04-28 10:38:08,218 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:38:08,218 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:38:08,219 INFO L85 PathProgramCache]: Analyzing trace with hash -524068618, now seen corresponding path program 28 times [2022-04-28 10:38:08,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:38:08,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201573761] [2022-04-28 10:38:08,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:38:08,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:38:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:08,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:38:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:08,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {8103#(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(26, 2);call #Ultimate.allocInit(12, 3); {8083#true} is VALID [2022-04-28 10:38:08,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {8083#true} assume true; {8083#true} is VALID [2022-04-28 10:38:08,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8083#true} {8083#true} #38#return; {8083#true} is VALID [2022-04-28 10:38:08,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {8083#true} call ULTIMATE.init(); {8103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:38:08,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {8103#(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(26, 2);call #Ultimate.allocInit(12, 3); {8083#true} is VALID [2022-04-28 10:38:08,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {8083#true} assume true; {8083#true} is VALID [2022-04-28 10:38:08,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8083#true} {8083#true} #38#return; {8083#true} is VALID [2022-04-28 10:38:08,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {8083#true} call #t~ret7 := main(); {8083#true} is VALID [2022-04-28 10:38:08,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {8083#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8083#true} is VALID [2022-04-28 10:38:08,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {8083#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {8088#(= main_~s~0 0)} is VALID [2022-04-28 10:38:08,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {8088#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8089#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:38:08,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {8089#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8090#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:08,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {8090#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8091#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:08,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {8091#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8092#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:38:08,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {8092#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8093#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:38:08,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {8093#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8094#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:38:08,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {8094#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8095#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:38:08,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {8095#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8096#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:08,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {8096#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8097#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:38:08,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {8097#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8098#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:08,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {8098#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8099#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:38:08,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {8099#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8100#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:08,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {8100#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8101#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:08,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {8101#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8102#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:08,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {8102#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {8102#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:08,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {8102#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {8102#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:08,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {8102#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {8084#false} is VALID [2022-04-28 10:38:08,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {8084#false} assume !false; {8084#false} is VALID [2022-04-28 10:38:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:08,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:38:08,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201573761] [2022-04-28 10:38:08,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201573761] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:38:08,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697576756] [2022-04-28 10:38:08,464 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:38:08,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:38:08,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:38:08,465 INFO L229 MonitoredProcess]: Starting monitored process 29 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:38:08,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 10:38:08,589 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:38:08,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:38:08,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:38:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:08,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:38:10,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {8083#true} call ULTIMATE.init(); {8083#true} is VALID [2022-04-28 10:38:10,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {8083#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(26, 2);call #Ultimate.allocInit(12, 3); {8083#true} is VALID [2022-04-28 10:38:10,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {8083#true} assume true; {8083#true} is VALID [2022-04-28 10:38:10,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8083#true} {8083#true} #38#return; {8083#true} is VALID [2022-04-28 10:38:10,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {8083#true} call #t~ret7 := main(); {8083#true} is VALID [2022-04-28 10:38:10,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {8083#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8083#true} is VALID [2022-04-28 10:38:10,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {8083#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {8088#(= main_~s~0 0)} is VALID [2022-04-28 10:38:10,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {8088#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8089#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:38:10,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {8089#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8090#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:10,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {8090#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8091#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:10,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {8091#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8092#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:38:10,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {8092#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8093#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:38:10,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {8093#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8094#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:38:10,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {8094#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8095#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:38:10,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {8095#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8096#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:10,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {8096#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8097#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:38:10,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {8097#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8098#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:10,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {8098#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8099#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:38:10,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {8099#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8100#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:10,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {8100#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8101#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:10,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {8101#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8102#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:10,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {8102#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {8102#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:10,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {8102#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {8102#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:10,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {8102#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {8084#false} is VALID [2022-04-28 10:38:10,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {8084#false} assume !false; {8084#false} is VALID [2022-04-28 10:38:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:10,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:38:33,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {8084#false} assume !false; {8084#false} is VALID [2022-04-28 10:38:33,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {8182#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {8084#false} is VALID [2022-04-28 10:38:33,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {8182#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {8182#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:38:33,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {8182#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {8182#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:38:33,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {8192#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8182#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:38:33,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {8196#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8192#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:38:33,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {8200#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8196#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:38:33,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {8204#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8200#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:38:33,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {8208#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8204#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:38:33,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {8212#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8208#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:38:33,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {8216#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8212#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-28 10:38:33,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {8220#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8216#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-28 10:38:33,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {8224#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8220#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-28 10:38:33,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {8228#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8224#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is VALID [2022-04-28 10:38:33,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {8232#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8228#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:38:33,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {8236#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8232#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} is VALID [2022-04-28 10:38:33,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {8240#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8236#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:38:33,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {8244#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8240#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} is VALID [2022-04-28 10:38:33,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {8083#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {8244#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} is VALID [2022-04-28 10:38:33,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {8083#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8083#true} is VALID [2022-04-28 10:38:33,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {8083#true} call #t~ret7 := main(); {8083#true} is VALID [2022-04-28 10:38:33,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8083#true} {8083#true} #38#return; {8083#true} is VALID [2022-04-28 10:38:33,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {8083#true} assume true; {8083#true} is VALID [2022-04-28 10:38:33,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {8083#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(26, 2);call #Ultimate.allocInit(12, 3); {8083#true} is VALID [2022-04-28 10:38:33,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {8083#true} call ULTIMATE.init(); {8083#true} is VALID [2022-04-28 10:38:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:33,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697576756] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:38:33,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:38:33,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 33 [2022-04-28 10:38:33,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:38:33,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [545080419] [2022-04-28 10:38:33,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [545080419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:38:33,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:38:33,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:38:33,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704256988] [2022-04-28 10:38:33,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:38:33,634 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:38:33,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:38:33,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:33,650 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:38:33,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:38:33,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:33,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:38:33,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:38:33,651 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:33,958 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 10:38:33,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:38:33,958 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:38:33,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:38:33,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2022-04-28 10:38:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2022-04-28 10:38:33,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 33 transitions. [2022-04-28 10:38:33,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:33,982 INFO L225 Difference]: With dead ends: 33 [2022-04-28 10:38:33,982 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 10:38:33,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 23 SyntacticMatches, 15 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=993, Invalid=1263, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:38:33,983 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:38:33,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 39 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:38:33,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 10:38:34,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 10:38:34,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:38:34,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:34,013 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:34,013 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:34,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:34,014 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 10:38:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 10:38:34,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:34,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:34,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 10:38:34,014 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 10:38:34,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:34,014 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 10:38:34,015 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 10:38:34,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:34,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:34,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:38:34,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:38:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-28 10:38:34,015 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2022-04-28 10:38:34,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:38:34,015 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-28 10:38:34,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:34,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-28 10:38:34,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 10:38:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:38:34,050 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:38:34,050 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:38:34,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 10:38:34,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 10:38:34,251 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:38:34,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:38:34,251 INFO L85 PathProgramCache]: Analyzing trace with hash -524019799, now seen corresponding path program 29 times [2022-04-28 10:38:34,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:34,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [893842067] [2022-04-28 10:38:34,254 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:38:34,254 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:38:34,254 INFO L85 PathProgramCache]: Analyzing trace with hash -524019799, now seen corresponding path program 30 times [2022-04-28 10:38:34,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:38:34,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573608709] [2022-04-28 10:38:34,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:38:34,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:38:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:34,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:38:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:34,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {8501#(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(26, 2);call #Ultimate.allocInit(12, 3); {8480#true} is VALID [2022-04-28 10:38:34,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {8480#true} assume true; {8480#true} is VALID [2022-04-28 10:38:34,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8480#true} {8480#true} #38#return; {8480#true} is VALID [2022-04-28 10:38:34,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {8480#true} call ULTIMATE.init(); {8501#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:38:34,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {8501#(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(26, 2);call #Ultimate.allocInit(12, 3); {8480#true} is VALID [2022-04-28 10:38:34,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {8480#true} assume true; {8480#true} is VALID [2022-04-28 10:38:34,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8480#true} {8480#true} #38#return; {8480#true} is VALID [2022-04-28 10:38:34,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {8480#true} call #t~ret7 := main(); {8480#true} is VALID [2022-04-28 10:38:34,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {8480#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8480#true} is VALID [2022-04-28 10:38:34,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {8480#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {8485#(= main_~s~0 0)} is VALID [2022-04-28 10:38:34,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {8485#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8486#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:38:34,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {8486#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8487#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:34,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {8487#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8488#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:34,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {8488#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8489#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:38:34,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {8489#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8490#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:38:34,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {8490#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8491#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:38:34,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {8491#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8492#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:38:34,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {8492#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8493#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:34,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {8493#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8494#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:38:34,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {8494#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8495#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:34,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {8495#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8496#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:38:34,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {8496#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8497#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:34,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {8497#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8498#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:34,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {8498#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8499#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:34,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {8499#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8500#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:38:34,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {8500#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {8500#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:38:34,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {8500#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {8481#false} is VALID [2022-04-28 10:38:34,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {8481#false} assume !false; {8481#false} is VALID [2022-04-28 10:38:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:34,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:38:34,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573608709] [2022-04-28 10:38:34,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573608709] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:38:34,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284294048] [2022-04-28 10:38:34,500 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:38:34,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:38:34,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:38:34,501 INFO L229 MonitoredProcess]: Starting monitored process 30 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:38:34,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 10:38:34,817 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 10:38:34,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:38:34,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:38:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:34,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:38:37,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {8480#true} call ULTIMATE.init(); {8480#true} is VALID [2022-04-28 10:38:37,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {8480#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(26, 2);call #Ultimate.allocInit(12, 3); {8480#true} is VALID [2022-04-28 10:38:37,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {8480#true} assume true; {8480#true} is VALID [2022-04-28 10:38:37,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8480#true} {8480#true} #38#return; {8480#true} is VALID [2022-04-28 10:38:37,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {8480#true} call #t~ret7 := main(); {8480#true} is VALID [2022-04-28 10:38:37,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {8480#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8480#true} is VALID [2022-04-28 10:38:37,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {8480#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {8485#(= main_~s~0 0)} is VALID [2022-04-28 10:38:37,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {8485#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8486#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:38:37,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {8486#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8487#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:37,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {8487#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8488#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:37,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {8488#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8489#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:38:37,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {8489#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8490#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:38:37,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {8490#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8491#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:38:37,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {8491#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8492#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:38:37,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {8492#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8493#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:37,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {8493#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8494#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:38:37,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {8494#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8495#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:37,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {8495#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8496#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:38:37,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {8496#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8497#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:37,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {8497#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8498#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:37,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {8498#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8499#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:37,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {8499#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8568#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 3570 (mod main_~v~0 256))))} is VALID [2022-04-28 10:38:37,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {8568#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 3570 (mod main_~v~0 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {8568#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 3570 (mod main_~v~0 256))))} is VALID [2022-04-28 10:38:37,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {8568#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 3570 (mod main_~v~0 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {8481#false} is VALID [2022-04-28 10:38:37,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {8481#false} assume !false; {8481#false} is VALID [2022-04-28 10:38:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:37,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:38:53,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {8481#false} assume !false; {8481#false} is VALID [2022-04-28 10:38:53,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {8581#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {8481#false} is VALID [2022-04-28 10:38:53,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {8581#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {8581#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:38:53,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {8588#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8581#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:38:53,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {8592#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8588#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:38:53,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {8596#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8592#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:38:53,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {8600#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8596#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:38:53,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {8604#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8600#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:38:53,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {8608#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8604#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:38:53,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {8612#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8608#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:38:53,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {8616#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8612#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-28 10:38:53,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {8620#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8616#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-28 10:38:53,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {8624#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8620#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-28 10:38:53,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {8628#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8624#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-28 10:38:53,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {8632#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8628#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:38:53,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {8636#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8632#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} is VALID [2022-04-28 10:38:53,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {8640#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8636#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:38:53,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {8644#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8640#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} is VALID [2022-04-28 10:38:53,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {8480#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {8644#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} is VALID [2022-04-28 10:38:53,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {8480#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8480#true} is VALID [2022-04-28 10:38:53,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {8480#true} call #t~ret7 := main(); {8480#true} is VALID [2022-04-28 10:38:53,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8480#true} {8480#true} #38#return; {8480#true} is VALID [2022-04-28 10:38:53,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {8480#true} assume true; {8480#true} is VALID [2022-04-28 10:38:53,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {8480#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(26, 2);call #Ultimate.allocInit(12, 3); {8480#true} is VALID [2022-04-28 10:38:53,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {8480#true} call ULTIMATE.init(); {8480#true} is VALID [2022-04-28 10:38:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:53,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284294048] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:38:53,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:38:53,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:38:53,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:38:53,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [893842067] [2022-04-28 10:38:53,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [893842067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:38:53,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:38:53,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:38:53,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513890470] [2022-04-28 10:38:53,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:38:53,995 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:38:53,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:38:53,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:54,021 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:38:54,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:38:54,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:54,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:38:54,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=738, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:38:54,022 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:54,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:54,564 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 10:38:54,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:38:54,565 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:38:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:38:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2022-04-28 10:38:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2022-04-28 10:38:54,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 36 transitions. [2022-04-28 10:38:54,601 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:38:54,602 INFO L225 Difference]: With dead ends: 36 [2022-04-28 10:38:54,602 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 10:38:54,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 21 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1082, Invalid=1570, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:38:54,603 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:38:54,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 53 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:38:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 10:38:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-28 10:38:54,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:38:54,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:54,634 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:54,634 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:54,635 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 10:38:54,635 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 10:38:54,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:54,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:54,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 10:38:54,635 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 10:38:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:54,641 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 10:38:54,641 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 10:38:54,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:54,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:54,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:38:54,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:38:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-28 10:38:54,642 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2022-04-28 10:38:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:38:54,642 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-28 10:38:54,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:54,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2022-04-28 10:38:54,675 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:38:54,675 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-28 10:38:54,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:38:54,675 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:38:54,675 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:38:54,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 10:38:54,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:38:54,876 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:38:54,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:38:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash 935258486, now seen corresponding path program 29 times [2022-04-28 10:38:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:54,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [699729034] [2022-04-28 10:38:54,879 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:38:54,879 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:38:54,879 INFO L85 PathProgramCache]: Analyzing trace with hash 935258486, now seen corresponding path program 30 times [2022-04-28 10:38:54,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:38:54,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226215132] [2022-04-28 10:38:54,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:38:54,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:38:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:55,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:38:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:55,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {8923#(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(26, 2);call #Ultimate.allocInit(12, 3); {8902#true} is VALID [2022-04-28 10:38:55,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {8902#true} assume true; {8902#true} is VALID [2022-04-28 10:38:55,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8902#true} {8902#true} #38#return; {8902#true} is VALID [2022-04-28 10:38:55,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {8902#true} call ULTIMATE.init(); {8923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:38:55,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {8923#(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(26, 2);call #Ultimate.allocInit(12, 3); {8902#true} is VALID [2022-04-28 10:38:55,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {8902#true} assume true; {8902#true} is VALID [2022-04-28 10:38:55,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8902#true} {8902#true} #38#return; {8902#true} is VALID [2022-04-28 10:38:55,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {8902#true} call #t~ret7 := main(); {8902#true} is VALID [2022-04-28 10:38:55,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {8902#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8902#true} is VALID [2022-04-28 10:38:55,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {8902#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {8907#(= main_~s~0 0)} is VALID [2022-04-28 10:38:55,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {8907#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8908#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:38:55,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {8908#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8909#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:55,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {8909#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8910#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:55,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {8910#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8911#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:38:55,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {8911#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8912#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:38:55,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {8912#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8913#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:38:55,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {8913#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8914#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:38:55,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {8914#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8915#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:55,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {8915#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8916#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:38:55,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {8916#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8917#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:55,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {8917#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8918#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:38:55,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {8918#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8919#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:55,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {8919#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8920#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:55,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {8920#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8921#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:55,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {8921#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8922#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:38:55,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {8922#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {8922#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:38:55,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {8922#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {8922#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:38:55,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {8922#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume ~s~0 % 4294967296 > 65025; {8903#false} is VALID [2022-04-28 10:38:55,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {8903#false} assume !false; {8903#false} is VALID [2022-04-28 10:38:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:55,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:38:55,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226215132] [2022-04-28 10:38:55,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226215132] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:38:55,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483780943] [2022-04-28 10:38:55,153 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:38:55,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:38:55,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:38:55,154 INFO L229 MonitoredProcess]: Starting monitored process 31 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:38:55,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 10:38:55,479 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 10:38:55,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:38:55,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:38:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:55,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:38:57,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {8902#true} call ULTIMATE.init(); {8902#true} is VALID [2022-04-28 10:38:57,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {8902#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(26, 2);call #Ultimate.allocInit(12, 3); {8902#true} is VALID [2022-04-28 10:38:57,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {8902#true} assume true; {8902#true} is VALID [2022-04-28 10:38:57,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8902#true} {8902#true} #38#return; {8902#true} is VALID [2022-04-28 10:38:57,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {8902#true} call #t~ret7 := main(); {8902#true} is VALID [2022-04-28 10:38:57,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {8902#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8902#true} is VALID [2022-04-28 10:38:57,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {8902#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {8907#(= main_~s~0 0)} is VALID [2022-04-28 10:38:57,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {8907#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8908#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:38:57,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {8908#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8909#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:57,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {8909#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8910#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:57,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {8910#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8911#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:38:57,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {8911#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8912#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:38:57,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {8912#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8913#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:38:57,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {8913#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8914#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:38:57,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {8914#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8915#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:57,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {8915#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8916#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:38:57,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {8916#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8917#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:57,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {8917#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8918#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:38:57,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {8918#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8919#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:57,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {8919#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8920#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:57,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {8920#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8921#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:38:57,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {8921#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {8922#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:38:57,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {8922#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {8922#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:38:57,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {8922#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {8922#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:38:57,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {8922#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume ~s~0 % 4294967296 > 65025; {8903#false} is VALID [2022-04-28 10:38:57,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {8903#false} assume !false; {8903#false} is VALID [2022-04-28 10:38:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:57,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:39:20,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {8903#false} assume !false; {8903#false} is VALID [2022-04-28 10:39:20,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {9005#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {8903#false} is VALID [2022-04-28 10:39:20,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {9005#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {9005#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:39:20,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {9005#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {9005#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:39:20,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {9015#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9005#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:39:20,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {9019#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9015#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:39:20,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {9023#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9019#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:39:20,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {9027#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9023#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:39:20,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {9031#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9027#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:39:20,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {9035#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9031#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:39:20,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {9039#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9035#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-28 10:39:20,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {9043#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9039#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-28 10:39:20,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {9047#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9043#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-28 10:39:20,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {9051#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9047#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is VALID [2022-04-28 10:39:20,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {9055#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9051#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:39:20,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {9059#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9055#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} is VALID [2022-04-28 10:39:20,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {9063#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9059#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:39:21,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {9067#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9063#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} is VALID [2022-04-28 10:39:21,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {9071#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9067#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} is VALID [2022-04-28 10:39:21,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {8902#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {9071#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:39:21,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {8902#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8902#true} is VALID [2022-04-28 10:39:21,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {8902#true} call #t~ret7 := main(); {8902#true} is VALID [2022-04-28 10:39:21,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8902#true} {8902#true} #38#return; {8902#true} is VALID [2022-04-28 10:39:21,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {8902#true} assume true; {8902#true} is VALID [2022-04-28 10:39:21,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {8902#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(26, 2);call #Ultimate.allocInit(12, 3); {8902#true} is VALID [2022-04-28 10:39:21,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {8902#true} call ULTIMATE.init(); {8902#true} is VALID [2022-04-28 10:39:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:21,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483780943] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:39:21,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:39:21,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 35 [2022-04-28 10:39:21,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:39:21,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [699729034] [2022-04-28 10:39:21,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [699729034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:39:21,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:39:21,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:39:21,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789778532] [2022-04-28 10:39:21,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:39:21,765 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 10:39:21,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:39:21,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:21,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:21,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:39:21,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:21,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:39:21,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:39:21,783 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:22,094 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 10:39:22,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:39:22,094 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 10:39:22,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:39:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2022-04-28 10:39:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2022-04-28 10:39:22,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 34 transitions. [2022-04-28 10:39:22,121 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:39:22,122 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:39:22,122 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 10:39:22,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 16 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1123, Invalid=1427, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 10:39:22,123 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:39:22,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 29 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:39:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 10:39:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 10:39:22,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:39:22,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:22,154 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:22,154 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:22,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:22,155 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 10:39:22,155 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 10:39:22,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:22,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:22,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 10:39:22,155 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 10:39:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:22,156 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 10:39:22,156 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 10:39:22,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:22,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:22,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:39:22,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:39:22,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:22,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-28 10:39:22,157 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2022-04-28 10:39:22,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:39:22,157 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-28 10:39:22,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:22,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-28 10:39:22,186 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:39:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 10:39:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:39:22,186 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:39:22,186 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:39:22,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 10:39:22,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-28 10:39:22,391 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:39:22,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:39:22,391 INFO L85 PathProgramCache]: Analyzing trace with hash 935307305, now seen corresponding path program 31 times [2022-04-28 10:39:22,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:22,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [704579289] [2022-04-28 10:39:22,393 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:39:22,394 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:39:22,394 INFO L85 PathProgramCache]: Analyzing trace with hash 935307305, now seen corresponding path program 32 times [2022-04-28 10:39:22,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:39:22,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397775293] [2022-04-28 10:39:22,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:39:22,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:39:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:22,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:39:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:22,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {9337#(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(26, 2);call #Ultimate.allocInit(12, 3); {9315#true} is VALID [2022-04-28 10:39:22,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {9315#true} assume true; {9315#true} is VALID [2022-04-28 10:39:22,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9315#true} {9315#true} #38#return; {9315#true} is VALID [2022-04-28 10:39:22,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {9315#true} call ULTIMATE.init(); {9337#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:39:22,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {9337#(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(26, 2);call #Ultimate.allocInit(12, 3); {9315#true} is VALID [2022-04-28 10:39:22,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {9315#true} assume true; {9315#true} is VALID [2022-04-28 10:39:22,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9315#true} {9315#true} #38#return; {9315#true} is VALID [2022-04-28 10:39:22,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {9315#true} call #t~ret7 := main(); {9315#true} is VALID [2022-04-28 10:39:22,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {9315#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {9315#true} is VALID [2022-04-28 10:39:22,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {9315#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {9320#(= main_~s~0 0)} is VALID [2022-04-28 10:39:22,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {9320#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9321#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:39:22,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {9321#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9322#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:22,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {9322#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9323#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:22,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {9323#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9324#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:39:22,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {9324#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9325#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:39:22,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {9325#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9326#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:39:22,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {9326#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9327#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:39:22,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {9327#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9328#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:22,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {9328#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9329#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:39:22,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {9329#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9330#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:22,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {9330#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9331#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:39:22,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {9331#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9332#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:22,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {9332#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9333#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:22,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {9333#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9334#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:22,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {9334#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9335#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:39:22,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {9335#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9336#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:39:22,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {9336#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {9336#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:39:22,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {9336#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {9316#false} is VALID [2022-04-28 10:39:22,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {9316#false} assume !false; {9316#false} is VALID [2022-04-28 10:39:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:22,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:39:22,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397775293] [2022-04-28 10:39:22,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397775293] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:39:22,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120235041] [2022-04-28 10:39:22,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:39:22,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:22,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:39:22,688 INFO L229 MonitoredProcess]: Starting monitored process 32 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:39:22,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 10:39:22,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:39:22,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:39:22,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:39:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:22,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:39:25,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {9315#true} call ULTIMATE.init(); {9315#true} is VALID [2022-04-28 10:39:25,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {9315#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(26, 2);call #Ultimate.allocInit(12, 3); {9315#true} is VALID [2022-04-28 10:39:25,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {9315#true} assume true; {9315#true} is VALID [2022-04-28 10:39:25,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9315#true} {9315#true} #38#return; {9315#true} is VALID [2022-04-28 10:39:25,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {9315#true} call #t~ret7 := main(); {9315#true} is VALID [2022-04-28 10:39:25,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {9315#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {9315#true} is VALID [2022-04-28 10:39:25,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {9315#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {9320#(= main_~s~0 0)} is VALID [2022-04-28 10:39:25,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {9320#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9321#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:39:25,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {9321#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9322#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:25,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {9322#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9323#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:25,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {9323#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9324#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:39:25,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {9324#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9325#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:39:25,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {9325#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9326#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:39:25,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {9326#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9327#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:39:25,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {9327#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9328#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:25,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {9328#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9329#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:39:25,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {9329#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9330#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:25,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {9330#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9331#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:39:25,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {9331#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9332#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:25,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {9332#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9333#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:25,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {9333#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9334#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:25,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {9334#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9335#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:39:25,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {9335#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9407#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ (mod main_~v~0 256) 3825)))} is VALID [2022-04-28 10:39:25,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {9407#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ (mod main_~v~0 256) 3825)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {9407#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ (mod main_~v~0 256) 3825)))} is VALID [2022-04-28 10:39:25,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {9407#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ (mod main_~v~0 256) 3825)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {9316#false} is VALID [2022-04-28 10:39:25,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {9316#false} assume !false; {9316#false} is VALID [2022-04-28 10:39:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:25,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:39:47,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {9316#false} assume !false; {9316#false} is VALID [2022-04-28 10:39:47,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {9420#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {9316#false} is VALID [2022-04-28 10:39:47,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {9420#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {9420#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:39:47,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {9427#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9420#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:39:47,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {9431#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9427#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:39:47,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {9435#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9431#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:39:47,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {9439#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9435#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:39:47,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {9443#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9439#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:39:47,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {9447#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9443#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:39:47,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {9451#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9447#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:39:47,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {9455#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9451#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-28 10:39:47,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {9459#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9455#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-28 10:39:47,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {9463#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9459#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-28 10:39:47,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {9467#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9463#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-28 10:39:47,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {9471#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9467#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:39:47,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {9475#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9471#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} is VALID [2022-04-28 10:39:47,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {9479#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9475#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:39:47,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {9483#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9479#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} is VALID [2022-04-28 10:39:47,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {9487#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9483#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} is VALID [2022-04-28 10:39:47,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {9315#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {9487#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:39:47,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {9315#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {9315#true} is VALID [2022-04-28 10:39:47,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {9315#true} call #t~ret7 := main(); {9315#true} is VALID [2022-04-28 10:39:47,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9315#true} {9315#true} #38#return; {9315#true} is VALID [2022-04-28 10:39:47,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {9315#true} assume true; {9315#true} is VALID [2022-04-28 10:39:47,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {9315#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(26, 2);call #Ultimate.allocInit(12, 3); {9315#true} is VALID [2022-04-28 10:39:47,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {9315#true} call ULTIMATE.init(); {9315#true} is VALID [2022-04-28 10:39:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:47,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120235041] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:39:47,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:39:47,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:39:47,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:39:47,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [704579289] [2022-04-28 10:39:47,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [704579289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:39:47,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:39:47,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:39:47,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432924896] [2022-04-28 10:39:47,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:39:47,405 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 10:39:47,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:39:47,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:47,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:47,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:39:47,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:47,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:39:47,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=588, Invalid=818, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:39:47,422 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:47,982 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 10:39:47,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:39:47,982 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 10:39:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:39:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2022-04-28 10:39:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2022-04-28 10:39:47,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 37 transitions. [2022-04-28 10:39:48,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:48,011 INFO L225 Difference]: With dead ends: 37 [2022-04-28 10:39:48,011 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 10:39:48,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 21 SyntacticMatches, 15 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1217, Invalid=1753, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:39:48,012 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:39:48,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 43 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:39:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 10:39:48,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-28 10:39:48,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:39:48,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:48,044 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:48,045 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:48,045 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 10:39:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 10:39:48,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:48,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:48,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 10:39:48,052 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 10:39:48,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:48,052 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 10:39:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 10:39:48,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:48,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:48,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:39:48,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:39:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-04-28 10:39:48,054 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2022-04-28 10:39:48,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:39:48,054 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-04-28 10:39:48,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:48,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2022-04-28 10:39:48,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-28 10:39:48,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:39:48,087 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:39:48,087 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:39:48,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 10:39:48,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:48,288 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:39:48,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:39:48,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1070241546, now seen corresponding path program 31 times [2022-04-28 10:39:48,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:48,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1912667881] [2022-04-28 10:39:48,291 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:39:48,291 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:39:48,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1070241546, now seen corresponding path program 32 times [2022-04-28 10:39:48,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:39:48,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884315180] [2022-04-28 10:39:48,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:39:48,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:39:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:48,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:39:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:48,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {9775#(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(26, 2);call #Ultimate.allocInit(12, 3); {9753#true} is VALID [2022-04-28 10:39:48,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {9753#true} assume true; {9753#true} is VALID [2022-04-28 10:39:48,605 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9753#true} {9753#true} #38#return; {9753#true} is VALID [2022-04-28 10:39:48,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {9753#true} call ULTIMATE.init(); {9775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:39:48,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {9775#(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(26, 2);call #Ultimate.allocInit(12, 3); {9753#true} is VALID [2022-04-28 10:39:48,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {9753#true} assume true; {9753#true} is VALID [2022-04-28 10:39:48,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9753#true} {9753#true} #38#return; {9753#true} is VALID [2022-04-28 10:39:48,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {9753#true} call #t~ret7 := main(); {9753#true} is VALID [2022-04-28 10:39:48,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {9753#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {9753#true} is VALID [2022-04-28 10:39:48,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {9753#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {9758#(= main_~s~0 0)} is VALID [2022-04-28 10:39:48,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {9758#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9759#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:39:48,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {9759#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9760#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:48,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {9760#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9761#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:48,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {9761#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9762#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:39:48,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {9762#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9763#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:39:48,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {9763#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9764#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:39:48,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {9764#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9765#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:39:48,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {9765#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9766#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:48,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {9766#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9767#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:39:48,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {9767#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9768#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:48,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {9768#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9769#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:39:48,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {9769#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9770#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:48,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {9770#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9771#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:48,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {9771#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9772#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:48,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {9772#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9773#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:39:48,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {9773#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9774#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:39:48,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {9774#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {9774#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:39:48,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {9774#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {9774#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:39:48,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {9774#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume ~s~0 % 4294967296 > 65025; {9754#false} is VALID [2022-04-28 10:39:48,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {9754#false} assume !false; {9754#false} is VALID [2022-04-28 10:39:48,617 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:48,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:39:48,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884315180] [2022-04-28 10:39:48,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884315180] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:39:48,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682264098] [2022-04-28 10:39:48,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:39:48,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:48,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:39:48,619 INFO L229 MonitoredProcess]: Starting monitored process 33 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:39:48,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 10:39:48,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:39:48,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:39:48,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:39:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:49,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:39:51,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {9753#true} call ULTIMATE.init(); {9753#true} is VALID [2022-04-28 10:39:51,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {9753#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(26, 2);call #Ultimate.allocInit(12, 3); {9753#true} is VALID [2022-04-28 10:39:51,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {9753#true} assume true; {9753#true} is VALID [2022-04-28 10:39:51,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9753#true} {9753#true} #38#return; {9753#true} is VALID [2022-04-28 10:39:51,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {9753#true} call #t~ret7 := main(); {9753#true} is VALID [2022-04-28 10:39:51,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {9753#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {9753#true} is VALID [2022-04-28 10:39:51,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {9753#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {9758#(= main_~s~0 0)} is VALID [2022-04-28 10:39:51,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {9758#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9759#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:39:51,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {9759#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9760#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:51,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {9760#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9761#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:51,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {9761#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9762#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:39:51,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {9762#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9763#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:39:51,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {9763#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9764#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:39:51,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {9764#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9765#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:39:51,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {9765#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9766#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:51,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {9766#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9767#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:39:51,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {9767#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9768#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:51,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {9768#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9769#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:39:51,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {9769#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9770#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:51,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {9770#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9771#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:51,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {9771#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9772#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:39:51,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {9772#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9773#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:39:51,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {9773#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9774#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:39:51,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {9774#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {9774#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:39:51,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {9774#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {9774#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:39:51,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {9774#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume ~s~0 % 4294967296 > 65025; {9754#false} is VALID [2022-04-28 10:39:51,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {9754#false} assume !false; {9754#false} is VALID [2022-04-28 10:39:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:51,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:40:17,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {9754#false} assume !false; {9754#false} is VALID [2022-04-28 10:40:17,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {9860#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {9754#false} is VALID [2022-04-28 10:40:17,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {9860#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {9860#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:40:17,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {9860#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {9860#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:40:17,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {9870#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9860#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:40:17,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {9874#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9870#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:40:17,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {9878#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9874#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:40:17,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {9882#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9878#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:40:17,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {9886#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9882#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:40:17,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {9890#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9886#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:40:17,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {9894#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9890#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-28 10:40:18,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {9898#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9894#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-28 10:40:18,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {9902#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9898#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-28 10:40:18,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {9906#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9902#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is VALID [2022-04-28 10:40:18,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {9910#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9906#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:40:18,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {9914#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9910#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} is VALID [2022-04-28 10:40:18,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {9918#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9914#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:40:18,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {9922#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9918#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} is VALID [2022-04-28 10:40:18,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {9926#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9922#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} is VALID [2022-04-28 10:40:18,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {9930#(<= (div (+ (* (- 1) main_~s~0) (- 64424448495)) (- 4294967296)) (+ 31 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {9926#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:40:18,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {9753#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {9930#(<= (div (+ (* (- 1) main_~s~0) (- 64424448495)) (- 4294967296)) (+ 31 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} is VALID [2022-04-28 10:40:18,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {9753#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {9753#true} is VALID [2022-04-28 10:40:18,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {9753#true} call #t~ret7 := main(); {9753#true} is VALID [2022-04-28 10:40:18,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9753#true} {9753#true} #38#return; {9753#true} is VALID [2022-04-28 10:40:18,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {9753#true} assume true; {9753#true} is VALID [2022-04-28 10:40:18,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {9753#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(26, 2);call #Ultimate.allocInit(12, 3); {9753#true} is VALID [2022-04-28 10:40:18,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {9753#true} call ULTIMATE.init(); {9753#true} is VALID [2022-04-28 10:40:18,080 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:18,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682264098] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:40:18,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:40:18,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 37 [2022-04-28 10:40:18,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:40:18,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1912667881] [2022-04-28 10:40:18,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1912667881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:40:18,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:40:18,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:40:18,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894699780] [2022-04-28 10:40:18,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:40:18,081 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:40:18,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:40:18,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:18,097 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:40:18,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:40:18,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:18,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:40:18,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:40:18,098 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:18,451 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 10:40:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:40:18,451 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:40:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:40:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2022-04-28 10:40:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2022-04-28 10:40:18,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 35 transitions. [2022-04-28 10:40:18,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:18,479 INFO L225 Difference]: With dead ends: 35 [2022-04-28 10:40:18,479 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 10:40:18,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 23 SyntacticMatches, 17 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1261, Invalid=1601, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:40:18,480 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:40:18,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 29 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:40:18,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 10:40:18,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 10:40:18,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:40:18,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:18,511 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:18,511 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:18,511 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 10:40:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 10:40:18,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:18,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:18,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 10:40:18,512 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 10:40:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:18,512 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 10:40:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 10:40:18,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:18,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:18,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:40:18,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:40:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 10:40:18,513 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2022-04-28 10:40:18,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:40:18,513 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 10:40:18,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:18,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 10:40:18,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:18,568 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 10:40:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:40:18,569 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:40:18,569 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:40:18,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 10:40:18,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:40:18,769 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:40:18,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:40:18,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1070192727, now seen corresponding path program 33 times [2022-04-28 10:40:18,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:18,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1652018226] [2022-04-28 10:40:18,772 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:40:18,772 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:40:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1070192727, now seen corresponding path program 34 times [2022-04-28 10:40:18,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:40:18,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382127571] [2022-04-28 10:40:18,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:40:18,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:40:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:19,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:40:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:19,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {10205#(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(26, 2);call #Ultimate.allocInit(12, 3); {10182#true} is VALID [2022-04-28 10:40:19,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {10182#true} assume true; {10182#true} is VALID [2022-04-28 10:40:19,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10182#true} {10182#true} #38#return; {10182#true} is VALID [2022-04-28 10:40:19,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {10182#true} call ULTIMATE.init(); {10205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:40:19,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {10205#(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(26, 2);call #Ultimate.allocInit(12, 3); {10182#true} is VALID [2022-04-28 10:40:19,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {10182#true} assume true; {10182#true} is VALID [2022-04-28 10:40:19,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10182#true} {10182#true} #38#return; {10182#true} is VALID [2022-04-28 10:40:19,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {10182#true} call #t~ret7 := main(); {10182#true} is VALID [2022-04-28 10:40:19,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {10182#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {10182#true} is VALID [2022-04-28 10:40:19,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {10182#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {10187#(= main_~s~0 0)} is VALID [2022-04-28 10:40:19,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {10187#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10188#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:40:19,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {10188#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10189#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:19,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {10189#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10190#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:19,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {10190#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10191#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:40:19,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {10191#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10192#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:40:19,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {10192#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10193#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:40:19,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {10193#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10194#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:40:19,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {10194#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10195#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:19,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {10195#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10196#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:40:19,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {10196#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10197#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:19,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {10197#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10198#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:40:19,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {10198#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10199#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:19,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {10199#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10200#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:19,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {10200#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10201#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:19,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {10201#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10202#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:40:19,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {10202#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10203#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:40:19,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {10203#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10204#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:40:19,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {10204#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {10204#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:40:19,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {10204#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {10183#false} is VALID [2022-04-28 10:40:19,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {10183#false} assume !false; {10183#false} is VALID [2022-04-28 10:40:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:19,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:40:19,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382127571] [2022-04-28 10:40:19,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382127571] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:40:19,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812817819] [2022-04-28 10:40:19,066 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:40:19,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:40:19,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:40:19,067 INFO L229 MonitoredProcess]: Starting monitored process 34 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:40:19,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 10:40:19,221 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:40:19,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:40:19,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:40:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:19,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:40:22,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {10182#true} call ULTIMATE.init(); {10182#true} is VALID [2022-04-28 10:40:22,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {10182#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(26, 2);call #Ultimate.allocInit(12, 3); {10182#true} is VALID [2022-04-28 10:40:22,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {10182#true} assume true; {10182#true} is VALID [2022-04-28 10:40:22,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10182#true} {10182#true} #38#return; {10182#true} is VALID [2022-04-28 10:40:22,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {10182#true} call #t~ret7 := main(); {10182#true} is VALID [2022-04-28 10:40:22,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {10182#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {10182#true} is VALID [2022-04-28 10:40:22,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {10182#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {10187#(= main_~s~0 0)} is VALID [2022-04-28 10:40:22,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {10187#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10188#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:40:22,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {10188#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10189#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:22,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {10189#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10190#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:22,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {10190#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10191#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:40:22,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {10191#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10192#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:40:22,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {10192#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10193#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:40:22,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {10193#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10194#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:40:22,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {10194#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10195#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:22,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {10195#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10196#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:40:22,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {10196#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10197#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:22,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {10197#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10198#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:40:22,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {10198#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10199#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:22,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {10199#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10200#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:22,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {10200#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10201#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:22,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {10201#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10202#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:40:22,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {10202#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10203#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:40:22,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {10203#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10278#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 4080 (mod main_~v~0 256))))} is VALID [2022-04-28 10:40:22,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {10278#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 4080 (mod main_~v~0 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {10278#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 4080 (mod main_~v~0 256))))} is VALID [2022-04-28 10:40:22,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {10278#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 4080 (mod main_~v~0 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {10183#false} is VALID [2022-04-28 10:40:22,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {10183#false} assume !false; {10183#false} is VALID [2022-04-28 10:40:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:22,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:40:42,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {10183#false} assume !false; {10183#false} is VALID [2022-04-28 10:40:42,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {10291#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {10183#false} is VALID [2022-04-28 10:40:42,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {10291#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {10291#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:40:42,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {10298#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10291#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:40:42,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {10302#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10298#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:40:42,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {10306#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10302#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:40:42,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {10310#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10306#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:40:42,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {10314#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10310#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:40:42,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {10318#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10314#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:40:42,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {10322#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10318#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:40:42,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {10326#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10322#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-28 10:40:42,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {10330#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10326#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-28 10:40:42,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {10334#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10330#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-28 10:40:42,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {10338#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10334#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-28 10:40:42,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {10342#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10338#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:40:42,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {10346#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10342#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} is VALID [2022-04-28 10:40:42,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {10350#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10346#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:40:42,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {10354#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10350#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} is VALID [2022-04-28 10:40:42,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {10358#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10354#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} is VALID [2022-04-28 10:40:42,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {10362#(<= (div (+ (- 68719481072) (* (- 1) main_~s~0)) (- 4294967296)) (+ 33 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10358#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:40:42,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {10182#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {10362#(<= (div (+ (- 68719481072) (* (- 1) main_~s~0)) (- 4294967296)) (+ 33 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} is VALID [2022-04-28 10:40:42,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {10182#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {10182#true} is VALID [2022-04-28 10:40:42,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {10182#true} call #t~ret7 := main(); {10182#true} is VALID [2022-04-28 10:40:42,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10182#true} {10182#true} #38#return; {10182#true} is VALID [2022-04-28 10:40:42,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {10182#true} assume true; {10182#true} is VALID [2022-04-28 10:40:42,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {10182#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(26, 2);call #Ultimate.allocInit(12, 3); {10182#true} is VALID [2022-04-28 10:40:42,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {10182#true} call ULTIMATE.init(); {10182#true} is VALID [2022-04-28 10:40:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:42,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812817819] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:40:42,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:40:42,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:40:42,782 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:40:42,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1652018226] [2022-04-28 10:40:42,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1652018226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:40:42,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:40:42,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:40:42,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420386821] [2022-04-28 10:40:42,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:40:42,783 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:40:42,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:40:42,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:42,799 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:40:42,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:40:42,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:42,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:40:42,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=902, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:40:42,800 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:43,394 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 10:40:43,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:40:43,395 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:40:43,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:40:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 38 transitions. [2022-04-28 10:40:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 38 transitions. [2022-04-28 10:40:43,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 38 transitions. [2022-04-28 10:40:43,425 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:40:43,425 INFO L225 Difference]: With dead ends: 38 [2022-04-28 10:40:43,425 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 10:40:43,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 21 SyntacticMatches, 16 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1360, Invalid=1946, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:40:43,426 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:40:43,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 43 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:40:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 10:40:43,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-04-28 10:40:43,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:40:43,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:43,462 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:43,462 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:43,463 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 10:40:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 10:40:43,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:43,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:43,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 10:40:43,463 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 10:40:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:43,463 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 10:40:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 10:40:43,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:43,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:43,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:40:43,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:40:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-04-28 10:40:43,464 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 27 [2022-04-28 10:40:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:40:43,464 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-04-28 10:40:43,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:43,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 34 transitions. [2022-04-28 10:40:43,505 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:40:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-28 10:40:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:40:43,506 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:40:43,506 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:40:43,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-28 10:40:43,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-28 10:40:43,706 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:40:43,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:40:43,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1183766902, now seen corresponding path program 33 times [2022-04-28 10:40:43,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:43,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [370594795] [2022-04-28 10:40:43,709 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:40:43,710 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:40:43,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1183766902, now seen corresponding path program 34 times [2022-04-28 10:40:43,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:40:43,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968627632] [2022-04-28 10:40:43,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:40:43,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:40:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:44,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:40:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:44,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {10659#(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(26, 2);call #Ultimate.allocInit(12, 3); {10636#true} is VALID [2022-04-28 10:40:44,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {10636#true} assume true; {10636#true} is VALID [2022-04-28 10:40:44,034 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10636#true} {10636#true} #38#return; {10636#true} is VALID [2022-04-28 10:40:44,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {10636#true} call ULTIMATE.init(); {10659#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:40:44,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {10659#(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(26, 2);call #Ultimate.allocInit(12, 3); {10636#true} is VALID [2022-04-28 10:40:44,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {10636#true} assume true; {10636#true} is VALID [2022-04-28 10:40:44,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10636#true} {10636#true} #38#return; {10636#true} is VALID [2022-04-28 10:40:44,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {10636#true} call #t~ret7 := main(); {10636#true} is VALID [2022-04-28 10:40:44,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {10636#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {10636#true} is VALID [2022-04-28 10:40:44,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {10636#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {10641#(= main_~s~0 0)} is VALID [2022-04-28 10:40:44,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {10641#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10642#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:40:44,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {10642#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10643#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:44,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {10643#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10644#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:44,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {10644#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10645#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:40:44,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {10645#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10646#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:40:44,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {10646#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10647#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:40:44,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {10647#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10648#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:40:44,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {10648#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10649#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:44,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {10649#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10650#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:40:44,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {10650#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10651#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:44,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {10651#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10652#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:40:44,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {10652#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10653#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:44,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {10653#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10654#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:44,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {10654#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10655#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:44,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {10655#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10656#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:40:44,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {10656#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10657#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:40:44,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {10657#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10658#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:40:44,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {10658#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {10658#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:40:44,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {10658#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {10658#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:40:44,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {10658#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume ~s~0 % 4294967296 > 65025; {10637#false} is VALID [2022-04-28 10:40:44,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {10637#false} assume !false; {10637#false} is VALID [2022-04-28 10:40:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:44,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:40:44,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968627632] [2022-04-28 10:40:44,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968627632] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:40:44,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728209322] [2022-04-28 10:40:44,046 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:40:44,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:40:44,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:40:44,047 INFO L229 MonitoredProcess]: Starting monitored process 35 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:40:44,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 10:40:45,414 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:40:45,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:40:45,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:40:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:45,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:40:47,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {10636#true} call ULTIMATE.init(); {10636#true} is VALID [2022-04-28 10:40:47,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {10636#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(26, 2);call #Ultimate.allocInit(12, 3); {10636#true} is VALID [2022-04-28 10:40:47,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {10636#true} assume true; {10636#true} is VALID [2022-04-28 10:40:47,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10636#true} {10636#true} #38#return; {10636#true} is VALID [2022-04-28 10:40:47,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {10636#true} call #t~ret7 := main(); {10636#true} is VALID [2022-04-28 10:40:47,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {10636#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {10636#true} is VALID [2022-04-28 10:40:47,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {10636#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {10641#(= main_~s~0 0)} is VALID [2022-04-28 10:40:47,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {10641#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10642#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:40:47,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {10642#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10643#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:47,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {10643#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10644#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:47,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {10644#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10645#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:40:47,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {10645#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10646#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:40:47,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {10646#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10647#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:40:47,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {10647#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10648#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:40:47,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {10648#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10649#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:47,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {10649#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10650#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:40:47,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {10650#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10651#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:47,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {10651#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10652#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:40:47,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {10652#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10653#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:47,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {10653#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10654#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:47,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {10654#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10655#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:40:47,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {10655#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10656#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:40:47,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {10656#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10657#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:40:47,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {10657#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10658#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:40:47,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {10658#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {10658#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:40:47,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {10658#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {10658#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:40:48,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {10658#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume ~s~0 % 4294967296 > 65025; {10637#false} is VALID [2022-04-28 10:40:48,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {10637#false} assume !false; {10637#false} is VALID [2022-04-28 10:40:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:48,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:41:14,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {10637#false} assume !false; {10637#false} is VALID [2022-04-28 10:41:14,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {10747#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {10637#false} is VALID [2022-04-28 10:41:14,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {10747#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {10747#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:41:14,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {10747#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {10747#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:41:14,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {10757#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10747#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:41:14,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {10761#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10757#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:41:14,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {10765#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10761#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:41:14,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {10769#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10765#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:41:14,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {10773#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10769#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:41:14,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {10777#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10773#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:41:15,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {10781#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10777#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-28 10:41:15,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {10785#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10781#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-28 10:41:15,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {10789#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10785#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-28 10:41:15,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {10793#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10789#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is VALID [2022-04-28 10:41:15,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {10797#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10793#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:41:15,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {10801#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10797#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} is VALID [2022-04-28 10:41:15,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {10805#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10801#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:41:15,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {10809#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10805#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} is VALID [2022-04-28 10:41:15,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {10813#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10809#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} is VALID [2022-04-28 10:41:15,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {10817#(<= (div (+ (* (- 1) main_~s~0) (- 64424448495)) (- 4294967296)) (+ 31 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10813#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:41:15,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {10821#(<= (div (+ (- 68719416046) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 33))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {10817#(<= (div (+ (* (- 1) main_~s~0) (- 64424448495)) (- 4294967296)) (+ 31 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} is VALID [2022-04-28 10:41:15,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {10636#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {10821#(<= (div (+ (- 68719416046) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 33))} is VALID [2022-04-28 10:41:15,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {10636#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {10636#true} is VALID [2022-04-28 10:41:15,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {10636#true} call #t~ret7 := main(); {10636#true} is VALID [2022-04-28 10:41:15,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10636#true} {10636#true} #38#return; {10636#true} is VALID [2022-04-28 10:41:15,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {10636#true} assume true; {10636#true} is VALID [2022-04-28 10:41:15,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {10636#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(26, 2);call #Ultimate.allocInit(12, 3); {10636#true} is VALID [2022-04-28 10:41:15,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {10636#true} call ULTIMATE.init(); {10636#true} is VALID [2022-04-28 10:41:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:41:15,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728209322] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:41:15,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:41:15,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 39 [2022-04-28 10:41:15,035 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:41:15,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [370594795] [2022-04-28 10:41:15,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [370594795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:41:15,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:41:15,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:41:15,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878324134] [2022-04-28 10:41:15,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:41:15,035 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 10:41:15,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:41:15,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:15,052 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:41:15,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:41:15,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:41:15,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:41:15,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 10:41:15,054 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:15,435 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 10:41:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:41:15,435 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 10:41:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:41:15,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2022-04-28 10:41:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2022-04-28 10:41:15,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 36 transitions. [2022-04-28 10:41:15,462 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:41:15,463 INFO L225 Difference]: With dead ends: 36 [2022-04-28 10:41:15,463 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 10:41:15,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 23 SyntacticMatches, 18 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1407, Invalid=1785, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 10:41:15,463 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:41:15,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:41:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 10:41:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 10:41:15,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:41:15,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:15,498 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:15,498 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:15,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:15,499 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 10:41:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 10:41:15,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:41:15,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:41:15,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 10:41:15,499 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 10:41:15,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:15,499 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 10:41:15,500 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 10:41:15,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:41:15,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:41:15,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:41:15,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:41:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:15,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-28 10:41:15,500 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2022-04-28 10:41:15,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:41:15,500 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-28 10:41:15,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:15,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-28 10:41:15,533 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:41:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 10:41:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:41:15,533 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:41:15,533 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:41:15,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 10:41:15,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-28 10:41:15,734 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:41:15,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:41:15,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1183815721, now seen corresponding path program 35 times [2022-04-28 10:41:15,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:41:15,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1703629841] [2022-04-28 10:41:15,737 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:41:15,737 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:41:15,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1183815721, now seen corresponding path program 36 times [2022-04-28 10:41:15,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:41:15,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317365013] [2022-04-28 10:41:15,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:41:15,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:41:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:16,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:41:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:16,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {11105#(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(26, 2);call #Ultimate.allocInit(12, 3); {11081#true} is VALID [2022-04-28 10:41:16,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {11081#true} assume true; {11081#true} is VALID [2022-04-28 10:41:16,039 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11081#true} {11081#true} #38#return; {11081#true} is VALID [2022-04-28 10:41:16,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {11081#true} call ULTIMATE.init(); {11105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:41:16,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {11105#(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(26, 2);call #Ultimate.allocInit(12, 3); {11081#true} is VALID [2022-04-28 10:41:16,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {11081#true} assume true; {11081#true} is VALID [2022-04-28 10:41:16,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11081#true} {11081#true} #38#return; {11081#true} is VALID [2022-04-28 10:41:16,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {11081#true} call #t~ret7 := main(); {11081#true} is VALID [2022-04-28 10:41:16,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {11081#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {11081#true} is VALID [2022-04-28 10:41:16,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {11081#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {11086#(= main_~s~0 0)} is VALID [2022-04-28 10:41:16,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {11086#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11087#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:41:16,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {11087#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11088#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:16,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {11088#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11089#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:16,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {11089#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11090#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:41:16,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {11090#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11091#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:41:16,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {11091#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11092#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:41:16,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {11092#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11093#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:41:16,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {11093#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11094#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:16,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {11094#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11095#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:41:16,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {11095#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11096#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:16,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {11096#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11097#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:41:16,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {11097#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11098#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:16,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {11098#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11099#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:16,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {11099#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11100#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:16,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {11100#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11101#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:41:16,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {11101#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11102#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:41:16,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {11102#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11103#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:41:16,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {11103#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11104#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:41:16,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {11104#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {11104#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:41:16,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {11104#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {11082#false} is VALID [2022-04-28 10:41:16,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {11082#false} assume !false; {11082#false} is VALID [2022-04-28 10:41:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:41:16,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:41:16,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317365013] [2022-04-28 10:41:16,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317365013] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:41:16,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835427201] [2022-04-28 10:41:16,056 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:41:16,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:41:16,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:41:16,057 INFO L229 MonitoredProcess]: Starting monitored process 36 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:41:16,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 10:41:16,968 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 10:41:16,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:41:16,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:41:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:16,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:41:20,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {11081#true} call ULTIMATE.init(); {11081#true} is VALID [2022-04-28 10:41:20,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {11081#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(26, 2);call #Ultimate.allocInit(12, 3); {11081#true} is VALID [2022-04-28 10:41:20,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {11081#true} assume true; {11081#true} is VALID [2022-04-28 10:41:20,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11081#true} {11081#true} #38#return; {11081#true} is VALID [2022-04-28 10:41:20,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {11081#true} call #t~ret7 := main(); {11081#true} is VALID [2022-04-28 10:41:20,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {11081#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {11081#true} is VALID [2022-04-28 10:41:20,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {11081#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {11086#(= main_~s~0 0)} is VALID [2022-04-28 10:41:20,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {11086#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11087#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:41:20,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {11087#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11088#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:20,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {11088#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11089#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:20,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {11089#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11090#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:41:20,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {11090#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11091#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:41:20,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {11091#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11092#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:41:20,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {11092#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11093#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:41:20,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {11093#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11094#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:20,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {11094#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11095#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:41:20,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {11095#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11096#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:20,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {11096#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11097#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:41:20,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {11097#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11098#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:20,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {11098#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11099#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:20,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {11099#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11100#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:20,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {11100#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11101#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:41:20,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {11101#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11102#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:41:20,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {11102#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11103#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:41:20,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {11103#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11181#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 4335 (mod main_~v~0 256))))} is VALID [2022-04-28 10:41:20,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {11181#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 4335 (mod main_~v~0 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {11181#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 4335 (mod main_~v~0 256))))} is VALID [2022-04-28 10:41:20,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {11181#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 4335 (mod main_~v~0 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {11082#false} is VALID [2022-04-28 10:41:20,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {11082#false} assume !false; {11082#false} is VALID [2022-04-28 10:41:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:41:20,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:41:41,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {11082#false} assume !false; {11082#false} is VALID [2022-04-28 10:41:41,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {11194#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {11082#false} is VALID [2022-04-28 10:41:41,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {11194#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {11194#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:41:41,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {11201#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11194#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:41:41,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {11205#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11201#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:41:41,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {11209#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11205#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:41:41,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {11213#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11209#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:41:41,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {11217#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11213#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:41:41,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {11221#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11217#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:41:41,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {11225#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11221#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:41:41,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {11229#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11225#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-28 10:41:41,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {11233#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11229#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-28 10:41:41,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {11237#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11233#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-28 10:41:41,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {11241#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11237#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-28 10:41:41,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {11245#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11241#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:41:41,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {11249#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11245#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} is VALID [2022-04-28 10:41:41,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {11253#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11249#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:41:41,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {11257#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11253#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} is VALID [2022-04-28 10:41:41,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {11261#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11257#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} is VALID [2022-04-28 10:41:41,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {11265#(<= (div (+ (- 68719481072) (* (- 1) main_~s~0)) (- 4294967296)) (+ 33 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11261#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:41:41,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {11269#(<= (div (+ (* (- 1) main_~s~0) (- 73014448623)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 35))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11265#(<= (div (+ (- 68719481072) (* (- 1) main_~s~0)) (- 4294967296)) (+ 33 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} is VALID [2022-04-28 10:41:41,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {11081#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {11269#(<= (div (+ (* (- 1) main_~s~0) (- 73014448623)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 35))} is VALID [2022-04-28 10:41:41,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {11081#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {11081#true} is VALID [2022-04-28 10:41:41,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {11081#true} call #t~ret7 := main(); {11081#true} is VALID [2022-04-28 10:41:41,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11081#true} {11081#true} #38#return; {11081#true} is VALID [2022-04-28 10:41:41,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {11081#true} assume true; {11081#true} is VALID [2022-04-28 10:41:41,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {11081#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(26, 2);call #Ultimate.allocInit(12, 3); {11081#true} is VALID [2022-04-28 10:41:41,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {11081#true} call ULTIMATE.init(); {11081#true} is VALID [2022-04-28 10:41:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:41:41,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835427201] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:41:41,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:41:41,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:41:41,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:41:41,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1703629841] [2022-04-28 10:41:41,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1703629841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:41:41,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:41:41,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:41:41,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565759120] [2022-04-28 10:41:41,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:41:41,365 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 10:41:41,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:41:41,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:41,382 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:41:41,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:41:41,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:41:41,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:41:41,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=990, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:41:41,383 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:42,023 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 10:41:42,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:41:42,023 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 10:41:42,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:41:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:42,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 39 transitions. [2022-04-28 10:41:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:42,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 39 transitions. [2022-04-28 10:41:42,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 39 transitions. [2022-04-28 10:41:42,057 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:41:42,057 INFO L225 Difference]: With dead ends: 39 [2022-04-28 10:41:42,057 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 10:41:42,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 21 SyntacticMatches, 17 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1511, Invalid=2149, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:41:42,058 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:41:42,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 38 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:41:42,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 10:41:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2022-04-28 10:41:42,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:41:42,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:42,093 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:42,093 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:42,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:42,093 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 10:41:42,093 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 10:41:42,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:41:42,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:41:42,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 10:41:42,094 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 10:41:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:42,094 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 10:41:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 10:41:42,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:41:42,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:41:42,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:41:42,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:41:42,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:42,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-28 10:41:42,095 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 28 [2022-04-28 10:41:42,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:41:42,095 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-28 10:41:42,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:42,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-28 10:41:42,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:41:42,129 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 10:41:42,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:41:42,129 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:41:42,129 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:41:42,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-28 10:41:42,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 10:41:42,330 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:41:42,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:41:42,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1956415242, now seen corresponding path program 35 times [2022-04-28 10:41:42,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:41:42,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [980146771] [2022-04-28 10:41:42,333 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:41:42,333 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:41:42,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1956415242, now seen corresponding path program 36 times [2022-04-28 10:41:42,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:41:42,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762149985] [2022-04-28 10:41:42,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:41:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:41:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:42,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:41:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:42,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {11575#(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(26, 2);call #Ultimate.allocInit(12, 3); {11551#true} is VALID [2022-04-28 10:41:42,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {11551#true} assume true; {11551#true} is VALID [2022-04-28 10:41:42,648 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11551#true} {11551#true} #38#return; {11551#true} is VALID [2022-04-28 10:41:42,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {11551#true} call ULTIMATE.init(); {11575#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:41:42,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {11575#(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(26, 2);call #Ultimate.allocInit(12, 3); {11551#true} is VALID [2022-04-28 10:41:42,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {11551#true} assume true; {11551#true} is VALID [2022-04-28 10:41:42,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11551#true} {11551#true} #38#return; {11551#true} is VALID [2022-04-28 10:41:42,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {11551#true} call #t~ret7 := main(); {11551#true} is VALID [2022-04-28 10:41:42,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {11551#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {11551#true} is VALID [2022-04-28 10:41:42,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {11551#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {11556#(= main_~s~0 0)} is VALID [2022-04-28 10:41:42,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {11556#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11557#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:41:42,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {11557#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11558#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:42,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {11558#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11559#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:42,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {11559#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11560#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:41:42,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {11560#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11561#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:41:42,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {11561#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11562#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:41:42,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {11562#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11563#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:41:42,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {11563#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11564#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:42,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {11564#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11565#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:41:42,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {11565#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11566#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:42,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {11566#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11567#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:41:42,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {11567#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11568#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:42,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {11568#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11569#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:42,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {11569#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11570#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:42,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {11570#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11571#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:41:42,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {11571#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11572#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:41:42,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {11572#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11573#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:41:42,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {11573#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11574#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:42,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {11574#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {11574#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:42,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {11574#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {11574#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:42,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {11574#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {11552#false} is VALID [2022-04-28 10:41:42,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {11552#false} assume !false; {11552#false} is VALID [2022-04-28 10:41:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:41:42,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:41:42,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762149985] [2022-04-28 10:41:42,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762149985] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:41:42,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428815741] [2022-04-28 10:41:42,661 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:41:42,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:41:42,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:41:42,662 INFO L229 MonitoredProcess]: Starting monitored process 37 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:41:42,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 10:41:43,236 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 10:41:43,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:41:43,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:41:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 10:41:45,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:41:47,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {11551#true} call ULTIMATE.init(); {11551#true} is VALID [2022-04-28 10:41:47,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {11551#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(26, 2);call #Ultimate.allocInit(12, 3); {11551#true} is VALID [2022-04-28 10:41:47,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {11551#true} assume true; {11551#true} is VALID [2022-04-28 10:41:47,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11551#true} {11551#true} #38#return; {11551#true} is VALID [2022-04-28 10:41:47,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {11551#true} call #t~ret7 := main(); {11551#true} is VALID [2022-04-28 10:41:47,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {11551#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {11551#true} is VALID [2022-04-28 10:41:47,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {11551#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {11556#(= main_~s~0 0)} is VALID [2022-04-28 10:41:47,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {11556#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11557#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:41:47,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {11557#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11558#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:47,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {11558#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11559#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:47,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {11559#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11560#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:41:47,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {11560#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11561#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:41:47,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {11561#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11562#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:41:47,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {11562#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11563#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:41:47,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {11563#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11564#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:47,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {11564#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11565#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:41:47,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {11565#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11566#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:47,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {11566#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11567#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:41:47,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {11567#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11568#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:47,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {11568#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11569#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:47,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {11569#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11570#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:47,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {11570#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11571#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:41:47,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {11571#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11572#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:41:47,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {11572#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11573#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:41:47,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {11573#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11574#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:47,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {11574#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {11574#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:47,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {11574#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {11574#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:41:47,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {11574#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {11552#false} is VALID [2022-04-28 10:41:47,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {11552#false} assume !false; {11552#false} is VALID [2022-04-28 10:41:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:41:47,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:42:21,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {11552#false} assume !false; {11552#false} is VALID [2022-04-28 10:42:21,020 INFO L290 TraceCheckUtils]: 27: Hoare triple {11666#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {11552#false} is VALID [2022-04-28 10:42:21,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {11666#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {11666#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:42:21,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {11666#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {11666#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:42:21,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {11676#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11666#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:42:21,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {11680#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11676#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:42:21,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {11684#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11680#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:42:21,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {11688#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11684#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:42:21,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {11692#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11688#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:42:21,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {11696#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11692#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:42:21,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {11700#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11696#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-28 10:42:21,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {11704#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11700#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-28 10:42:21,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {11708#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11704#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-28 10:42:21,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {11712#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11708#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is VALID [2022-04-28 10:42:21,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {11716#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11712#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:42:21,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {11720#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11716#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} is VALID [2022-04-28 10:42:21,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {11724#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11720#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:42:21,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {11728#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11724#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} is VALID [2022-04-28 10:42:21,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {11732#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11728#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} is VALID [2022-04-28 10:42:21,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {11736#(<= (div (+ (* (- 1) main_~s~0) (- 64424448495)) (- 4294967296)) (+ 31 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11732#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:42:21,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {11740#(<= (div (+ (- 68719416046) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 33))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11736#(<= (div (+ (* (- 1) main_~s~0) (- 64424448495)) (- 4294967296)) (+ 31 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} is VALID [2022-04-28 10:42:21,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {11744#(<= (div (+ (- 73014383597) (* (- 1) main_~s~0)) (- 4294967296)) (+ 35 (div (+ (- 77309411328) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {11740#(<= (div (+ (- 68719416046) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 33))} is VALID [2022-04-28 10:42:21,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {11551#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {11744#(<= (div (+ (- 73014383597) (* (- 1) main_~s~0)) (- 4294967296)) (+ 35 (div (+ (- 77309411328) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:42:21,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {11551#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {11551#true} is VALID [2022-04-28 10:42:21,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {11551#true} call #t~ret7 := main(); {11551#true} is VALID [2022-04-28 10:42:21,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11551#true} {11551#true} #38#return; {11551#true} is VALID [2022-04-28 10:42:21,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {11551#true} assume true; {11551#true} is VALID [2022-04-28 10:42:21,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {11551#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(26, 2);call #Ultimate.allocInit(12, 3); {11551#true} is VALID [2022-04-28 10:42:21,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {11551#true} call ULTIMATE.init(); {11551#true} is VALID [2022-04-28 10:42:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:42:21,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428815741] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:42:21,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:42:21,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 41 [2022-04-28 10:42:21,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:42:21,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [980146771] [2022-04-28 10:42:21,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [980146771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:42:21,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:42:21,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:42:21,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31100868] [2022-04-28 10:42:21,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:42:21,405 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 10:42:21,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:42:21,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:21,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:42:21,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:42:21,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:42:21,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:42:21,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 10:42:21,423 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:21,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:21,851 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 10:42:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:42:21,851 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 10:42:21,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:42:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. [2022-04-28 10:42:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. [2022-04-28 10:42:21,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 37 transitions. [2022-04-28 10:42:21,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:42:21,895 INFO L225 Difference]: With dead ends: 37 [2022-04-28 10:42:21,895 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 10:42:21,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 23 SyntacticMatches, 19 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1561, Invalid=1979, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 10:42:21,896 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:42:21,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 54 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:42:21,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 10:42:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 10:42:21,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:42:21,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:21,933 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:21,933 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:21,933 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 10:42:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 10:42:21,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:42:21,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:42:21,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 10:42:21,935 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 10:42:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:21,935 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 10:42:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 10:42:21,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:42:21,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:42:21,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:42:21,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:42:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-28 10:42:21,936 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2022-04-28 10:42:21,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:42:21,936 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-28 10:42:21,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:21,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-28 10:42:21,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:42:21,973 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 10:42:21,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:42:21,974 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:42:21,974 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:42:21,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-04-28 10:42:22,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:42:22,174 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:42:22,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:42:22,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1956366423, now seen corresponding path program 37 times [2022-04-28 10:42:22,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:42:22,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2065862300] [2022-04-28 10:42:22,177 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:42:22,177 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:42:22,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1956366423, now seen corresponding path program 38 times [2022-04-28 10:42:22,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:42:22,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096557058] [2022-04-28 10:42:22,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:42:22,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:42:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:22,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:42:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:22,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {12037#(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(26, 2);call #Ultimate.allocInit(12, 3); {12012#true} is VALID [2022-04-28 10:42:22,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {12012#true} assume true; {12012#true} is VALID [2022-04-28 10:42:22,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12012#true} {12012#true} #38#return; {12012#true} is VALID [2022-04-28 10:42:22,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {12012#true} call ULTIMATE.init(); {12037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:42:22,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {12037#(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(26, 2);call #Ultimate.allocInit(12, 3); {12012#true} is VALID [2022-04-28 10:42:22,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {12012#true} assume true; {12012#true} is VALID [2022-04-28 10:42:22,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12012#true} {12012#true} #38#return; {12012#true} is VALID [2022-04-28 10:42:22,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {12012#true} call #t~ret7 := main(); {12012#true} is VALID [2022-04-28 10:42:22,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {12012#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12012#true} is VALID [2022-04-28 10:42:22,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {12012#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {12017#(= main_~s~0 0)} is VALID [2022-04-28 10:42:22,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {12017#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12018#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:42:22,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {12018#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12019#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:22,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {12019#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12020#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:22,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {12020#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12021#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:42:22,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {12021#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12022#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:42:22,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {12022#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12023#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:42:22,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {12023#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12024#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:42:22,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {12024#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12025#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:22,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {12025#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12026#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:42:22,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {12026#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12027#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:22,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {12027#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12028#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:42:22,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {12028#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12029#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:22,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {12029#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12030#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:22,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {12030#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12031#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:22,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {12031#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12032#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:42:22,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {12032#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12033#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:42:22,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {12033#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12034#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:42:22,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {12034#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12035#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:22,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {12035#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12036#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:42:22,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {12036#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {12036#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:42:22,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {12036#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {12013#false} is VALID [2022-04-28 10:42:22,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {12013#false} assume !false; {12013#false} is VALID [2022-04-28 10:42:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:42:22,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:42:22,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096557058] [2022-04-28 10:42:22,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096557058] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:42:22,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679208229] [2022-04-28 10:42:22,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:42:22,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:42:22,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:42:22,518 INFO L229 MonitoredProcess]: Starting monitored process 38 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:42:22,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 10:42:22,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:42:22,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:42:22,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:42:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:22,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:42:26,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {12012#true} call ULTIMATE.init(); {12012#true} is VALID [2022-04-28 10:42:26,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {12012#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(26, 2);call #Ultimate.allocInit(12, 3); {12012#true} is VALID [2022-04-28 10:42:26,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {12012#true} assume true; {12012#true} is VALID [2022-04-28 10:42:26,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12012#true} {12012#true} #38#return; {12012#true} is VALID [2022-04-28 10:42:26,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {12012#true} call #t~ret7 := main(); {12012#true} is VALID [2022-04-28 10:42:26,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {12012#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12012#true} is VALID [2022-04-28 10:42:26,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {12012#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {12017#(= main_~s~0 0)} is VALID [2022-04-28 10:42:26,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {12017#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12018#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:42:26,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {12018#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12019#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:26,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {12019#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12020#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:26,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {12020#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12021#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:42:26,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {12021#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12022#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:42:26,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {12022#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12023#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:42:26,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {12023#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12024#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:42:26,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {12024#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12025#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:26,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {12025#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12026#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:42:26,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {12026#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12027#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:26,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {12027#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12028#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:42:26,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {12028#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12029#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:26,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {12029#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12030#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:26,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {12030#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12031#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:26,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {12031#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12032#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:42:26,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {12032#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12033#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:42:26,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {12033#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12034#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:42:26,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {12034#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12035#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:26,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {12035#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12116#(and (<= main_~s~0 (+ (mod main_~v~0 256) 4590)) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-28 10:42:26,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {12116#(and (<= main_~s~0 (+ (mod main_~v~0 256) 4590)) (<= (mod main_~v~0 256) main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {12116#(and (<= main_~s~0 (+ (mod main_~v~0 256) 4590)) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-28 10:42:26,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {12116#(and (<= main_~s~0 (+ (mod main_~v~0 256) 4590)) (<= (mod main_~v~0 256) main_~s~0))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {12013#false} is VALID [2022-04-28 10:42:26,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {12013#false} assume !false; {12013#false} is VALID [2022-04-28 10:42:26,021 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:42:26,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:42:49,961 INFO L290 TraceCheckUtils]: 28: Hoare triple {12013#false} assume !false; {12013#false} is VALID [2022-04-28 10:42:49,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {12129#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {12013#false} is VALID [2022-04-28 10:42:49,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {12129#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {12129#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:42:49,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {12136#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12129#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:42:49,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {12140#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12136#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:42:49,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {12144#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12140#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:42:49,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {12148#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12144#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:42:49,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {12152#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12148#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:42:49,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {12156#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12152#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:42:49,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {12160#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12156#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:42:49,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {12164#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12160#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-28 10:42:49,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {12168#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12164#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-28 10:42:49,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {12172#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12168#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-28 10:42:49,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {12176#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12172#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-28 10:42:49,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {12180#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12176#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:42:49,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {12184#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12180#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} is VALID [2022-04-28 10:42:50,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {12188#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12184#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:42:50,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {12192#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12188#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} is VALID [2022-04-28 10:42:50,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {12196#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12192#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} is VALID [2022-04-28 10:42:50,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {12200#(<= (div (+ (- 68719481072) (* (- 1) main_~s~0)) (- 4294967296)) (+ 33 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12196#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:42:50,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {12204#(<= (div (+ (* (- 1) main_~s~0) (- 73014448623)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 35))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12200#(<= (div (+ (- 68719481072) (* (- 1) main_~s~0)) (- 4294967296)) (+ 33 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} is VALID [2022-04-28 10:42:50,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {12208#(<= (div (+ (* (- 1) main_~s~0) (- 77309416174)) (- 4294967296)) (+ (div (+ (- 77309411328) main_~s~0) 4294967296) 37))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12204#(<= (div (+ (* (- 1) main_~s~0) (- 73014448623)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 35))} is VALID [2022-04-28 10:42:50,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {12012#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {12208#(<= (div (+ (* (- 1) main_~s~0) (- 77309416174)) (- 4294967296)) (+ (div (+ (- 77309411328) main_~s~0) 4294967296) 37))} is VALID [2022-04-28 10:42:50,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {12012#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12012#true} is VALID [2022-04-28 10:42:50,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {12012#true} call #t~ret7 := main(); {12012#true} is VALID [2022-04-28 10:42:50,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12012#true} {12012#true} #38#return; {12012#true} is VALID [2022-04-28 10:42:50,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {12012#true} assume true; {12012#true} is VALID [2022-04-28 10:42:50,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {12012#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(26, 2);call #Ultimate.allocInit(12, 3); {12012#true} is VALID [2022-04-28 10:42:50,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {12012#true} call ULTIMATE.init(); {12012#true} is VALID [2022-04-28 10:42:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:42:50,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679208229] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:42:50,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:42:50,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:42:50,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:42:50,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2065862300] [2022-04-28 10:42:50,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2065862300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:42:50,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:42:50,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:42:50,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681723364] [2022-04-28 10:42:50,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:42:50,447 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 10:42:50,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:42:50,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:50,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:42:50,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:42:50,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:42:50,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:42:50,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=810, Invalid=1082, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:42:50,465 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:51,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:51,124 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 10:42:51,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:42:51,124 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 10:42:51,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:42:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. [2022-04-28 10:42:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. [2022-04-28 10:42:51,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 40 transitions. [2022-04-28 10:42:51,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:42:51,156 INFO L225 Difference]: With dead ends: 40 [2022-04-28 10:42:51,156 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 10:42:51,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 21 SyntacticMatches, 18 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1670, Invalid=2362, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:42:51,157 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:42:51,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:42:51,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 10:42:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-04-28 10:42:51,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:42:51,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:51,194 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:51,194 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:51,195 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 10:42:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 10:42:51,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:42:51,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:42:51,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 10:42:51,195 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 10:42:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:51,196 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 10:42:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 10:42:51,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:42:51,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:42:51,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:42:51,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:42:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-04-28 10:42:51,196 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 29 [2022-04-28 10:42:51,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:42:51,197 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-04-28 10:42:51,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:51,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 36 transitions. [2022-04-28 10:42:51,229 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:42:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-04-28 10:42:51,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:42:51,230 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:42:51,230 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:42:51,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 10:42:51,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 10:42:51,431 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:42:51,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:42:51,431 INFO L85 PathProgramCache]: Analyzing trace with hash -517813898, now seen corresponding path program 37 times [2022-04-28 10:42:51,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:42:51,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1823022951] [2022-04-28 10:42:51,434 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:42:51,434 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:42:51,434 INFO L85 PathProgramCache]: Analyzing trace with hash -517813898, now seen corresponding path program 38 times [2022-04-28 10:42:51,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:42:51,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569153602] [2022-04-28 10:42:51,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:42:51,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:42:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:51,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:42:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:51,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {12523#(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(26, 2);call #Ultimate.allocInit(12, 3); {12498#true} is VALID [2022-04-28 10:42:51,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {12498#true} assume true; {12498#true} is VALID [2022-04-28 10:42:51,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12498#true} {12498#true} #38#return; {12498#true} is VALID [2022-04-28 10:42:51,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {12498#true} call ULTIMATE.init(); {12523#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:42:51,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {12523#(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(26, 2);call #Ultimate.allocInit(12, 3); {12498#true} is VALID [2022-04-28 10:42:51,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {12498#true} assume true; {12498#true} is VALID [2022-04-28 10:42:51,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12498#true} {12498#true} #38#return; {12498#true} is VALID [2022-04-28 10:42:51,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {12498#true} call #t~ret7 := main(); {12498#true} is VALID [2022-04-28 10:42:51,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {12498#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12498#true} is VALID [2022-04-28 10:42:51,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {12498#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {12503#(= main_~s~0 0)} is VALID [2022-04-28 10:42:51,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {12503#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12504#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:42:51,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {12504#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12505#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:51,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {12505#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12506#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:51,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {12506#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12507#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:42:51,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {12507#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12508#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:42:51,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {12508#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12509#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:42:51,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {12509#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12510#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:42:51,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {12510#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12511#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:51,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {12511#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12512#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:42:51,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {12512#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12513#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:51,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {12513#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12514#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:42:51,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {12514#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12515#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:51,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {12515#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12516#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:51,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {12516#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12517#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:51,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {12517#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12518#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:42:51,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {12518#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12519#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:42:51,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {12519#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12520#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:42:51,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {12520#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12521#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:51,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {12521#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12522#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:42:51,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {12522#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {12522#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:42:51,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {12522#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {12522#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:42:51,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {12522#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume ~s~0 % 4294967296 > 65025; {12499#false} is VALID [2022-04-28 10:42:51,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {12499#false} assume !false; {12499#false} is VALID [2022-04-28 10:42:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:42:51,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:42:51,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569153602] [2022-04-28 10:42:51,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569153602] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:42:51,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865416967] [2022-04-28 10:42:51,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:42:51,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:42:51,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:42:51,775 INFO L229 MonitoredProcess]: Starting monitored process 39 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:42:51,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 10:42:51,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:42:51,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:42:51,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:42:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:51,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:42:54,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {12498#true} call ULTIMATE.init(); {12498#true} is VALID [2022-04-28 10:42:54,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {12498#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(26, 2);call #Ultimate.allocInit(12, 3); {12498#true} is VALID [2022-04-28 10:42:54,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {12498#true} assume true; {12498#true} is VALID [2022-04-28 10:42:54,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12498#true} {12498#true} #38#return; {12498#true} is VALID [2022-04-28 10:42:54,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {12498#true} call #t~ret7 := main(); {12498#true} is VALID [2022-04-28 10:42:54,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {12498#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12498#true} is VALID [2022-04-28 10:42:54,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {12498#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {12503#(= main_~s~0 0)} is VALID [2022-04-28 10:42:54,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {12503#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12504#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:42:54,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {12504#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12505#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:54,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {12505#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12506#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:54,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {12506#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12507#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:42:54,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {12507#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12508#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:42:54,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {12508#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12509#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:42:54,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {12509#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12510#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:42:54,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {12510#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12511#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:54,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {12511#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12512#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:42:54,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {12512#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12513#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:54,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {12513#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12514#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:42:54,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {12514#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12515#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:54,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {12515#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12516#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:54,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {12516#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12517#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:54,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {12517#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12518#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:42:54,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {12518#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12519#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:42:54,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {12519#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12520#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:42:54,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {12520#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12521#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:42:54,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {12521#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12522#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:42:54,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {12522#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {12522#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:42:54,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {12522#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {12522#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:42:54,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {12522#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume ~s~0 % 4294967296 > 65025; {12499#false} is VALID [2022-04-28 10:42:54,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {12499#false} assume !false; {12499#false} is VALID [2022-04-28 10:42:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:42:54,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:43:32,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {12499#false} assume !false; {12499#false} is VALID [2022-04-28 10:43:32,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {12617#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {12499#false} is VALID [2022-04-28 10:43:32,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {12617#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {12617#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:43:32,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {12617#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {12617#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:43:32,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {12627#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12617#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:43:32,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {12631#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12627#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:43:32,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {12635#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12631#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:43:32,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {12639#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12635#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:43:32,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {12643#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12639#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:43:32,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {12647#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12643#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:43:32,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {12651#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12647#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-28 10:43:32,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {12655#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12651#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-28 10:43:32,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {12659#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12655#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-28 10:43:34,255 WARN L290 TraceCheckUtils]: 16: Hoare triple {12663#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12659#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is UNKNOWN [2022-04-28 10:43:34,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {12667#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12663#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:43:34,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {12671#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12667#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} is VALID [2022-04-28 10:43:34,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {12675#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12671#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:43:34,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {12679#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12675#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} is VALID [2022-04-28 10:43:34,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {12683#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12679#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} is VALID [2022-04-28 10:43:34,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {12687#(<= (div (+ (* (- 1) main_~s~0) (- 64424448495)) (- 4294967296)) (+ 31 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12683#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:43:34,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {12691#(<= (div (+ (- 68719416046) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 33))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12687#(<= (div (+ (* (- 1) main_~s~0) (- 64424448495)) (- 4294967296)) (+ 31 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} is VALID [2022-04-28 10:43:34,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {12695#(<= (div (+ (- 73014383597) (* (- 1) main_~s~0)) (- 4294967296)) (+ 35 (div (+ (- 77309411328) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12691#(<= (div (+ (- 68719416046) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 33))} is VALID [2022-04-28 10:43:34,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {12699#(<= (div (+ (- 77309351148) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 37))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12695#(<= (div (+ (- 73014383597) (* (- 1) main_~s~0)) (- 4294967296)) (+ 35 (div (+ (- 77309411328) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:43:34,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {12498#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {12699#(<= (div (+ (- 77309351148) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 37))} is VALID [2022-04-28 10:43:34,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {12498#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12498#true} is VALID [2022-04-28 10:43:34,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {12498#true} call #t~ret7 := main(); {12498#true} is VALID [2022-04-28 10:43:34,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12498#true} {12498#true} #38#return; {12498#true} is VALID [2022-04-28 10:43:34,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {12498#true} assume true; {12498#true} is VALID [2022-04-28 10:43:34,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {12498#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(26, 2);call #Ultimate.allocInit(12, 3); {12498#true} is VALID [2022-04-28 10:43:34,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {12498#true} call ULTIMATE.init(); {12498#true} is VALID [2022-04-28 10:43:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:43:34,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865416967] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:43:34,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:43:34,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 43 [2022-04-28 10:43:34,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:34,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1823022951] [2022-04-28 10:43:34,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1823022951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:34,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:34,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:43:34,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205829007] [2022-04-28 10:43:34,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:34,375 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 10:43:34,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:34,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:34,393 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:43:34,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:43:34,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:34,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:43:34,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:43:34,394 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:34,795 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 10:43:34,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:43:34,795 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 10:43:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2022-04-28 10:43:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2022-04-28 10:43:34,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 38 transitions. [2022-04-28 10:43:34,833 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:43:34,833 INFO L225 Difference]: With dead ends: 38 [2022-04-28 10:43:34,833 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 10:43:34,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 23 SyntacticMatches, 20 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1723, Invalid=2183, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 10:43:34,834 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:34,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 24 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:43:34,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 10:43:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 10:43:34,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:34,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:34,873 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:34,873 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:34,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:34,874 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 10:43:34,874 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 10:43:34,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:34,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:34,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 10:43:34,876 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 10:43:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:34,876 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 10:43:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 10:43:34,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:34,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:34,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:34,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-28 10:43:34,877 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2022-04-28 10:43:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:34,878 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-28 10:43:34,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:34,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-28 10:43:34,911 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:43:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 10:43:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:43:34,912 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:34,912 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:34,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-04-28 10:43:35,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 10:43:35,114 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:35,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:35,114 INFO L85 PathProgramCache]: Analyzing trace with hash -517765079, now seen corresponding path program 39 times [2022-04-28 10:43:35,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:35,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1233309915] [2022-04-28 10:43:35,116 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:43:35,116 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:43:35,116 INFO L85 PathProgramCache]: Analyzing trace with hash -517765079, now seen corresponding path program 40 times [2022-04-28 10:43:35,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:35,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831889018] [2022-04-28 10:43:35,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:35,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:35,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:43:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:35,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {13001#(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(26, 2);call #Ultimate.allocInit(12, 3); {12975#true} is VALID [2022-04-28 10:43:35,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {12975#true} assume true; {12975#true} is VALID [2022-04-28 10:43:35,514 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12975#true} {12975#true} #38#return; {12975#true} is VALID [2022-04-28 10:43:35,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {12975#true} call ULTIMATE.init(); {13001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:43:35,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {13001#(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(26, 2);call #Ultimate.allocInit(12, 3); {12975#true} is VALID [2022-04-28 10:43:35,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {12975#true} assume true; {12975#true} is VALID [2022-04-28 10:43:35,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12975#true} {12975#true} #38#return; {12975#true} is VALID [2022-04-28 10:43:35,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {12975#true} call #t~ret7 := main(); {12975#true} is VALID [2022-04-28 10:43:35,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {12975#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12975#true} is VALID [2022-04-28 10:43:35,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {12975#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {12980#(= main_~s~0 0)} is VALID [2022-04-28 10:43:35,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {12980#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12981#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:43:35,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {12981#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12982#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:43:35,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {12982#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12983#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:43:35,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {12983#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12984#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:43:35,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {12984#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12985#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:43:35,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {12985#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12986#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:43:35,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {12986#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12987#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:43:35,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {12987#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12988#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:43:35,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {12988#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12989#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:43:35,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {12989#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12990#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:43:35,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {12990#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12991#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:43:35,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {12991#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12992#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:43:35,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {12992#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12993#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:43:35,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {12993#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12994#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:43:35,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {12994#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12995#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:43:35,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {12995#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12996#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:43:35,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {12996#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12997#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:43:35,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {12997#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12998#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:43:35,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {12998#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12999#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:43:35,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {12999#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13000#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:43:35,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {13000#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {13000#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:43:35,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {13000#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {12976#false} is VALID [2022-04-28 10:43:35,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {12976#false} assume !false; {12976#false} is VALID [2022-04-28 10:43:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:43:35,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:35,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831889018] [2022-04-28 10:43:35,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831889018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:43:35,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572177521] [2022-04-28 10:43:35,537 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:43:35,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:35,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:35,538 INFO L229 MonitoredProcess]: Starting monitored process 40 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:43:35,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 10:43:35,599 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:43:35,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:35,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:43:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:35,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:39,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {12975#true} call ULTIMATE.init(); {12975#true} is VALID [2022-04-28 10:43:39,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {12975#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(26, 2);call #Ultimate.allocInit(12, 3); {12975#true} is VALID [2022-04-28 10:43:39,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {12975#true} assume true; {12975#true} is VALID [2022-04-28 10:43:39,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12975#true} {12975#true} #38#return; {12975#true} is VALID [2022-04-28 10:43:39,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {12975#true} call #t~ret7 := main(); {12975#true} is VALID [2022-04-28 10:43:39,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {12975#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12975#true} is VALID [2022-04-28 10:43:39,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {12975#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {12980#(= main_~s~0 0)} is VALID [2022-04-28 10:43:39,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {12980#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12981#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:43:39,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {12981#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12982#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:43:39,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {12982#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12983#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:43:39,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {12983#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12984#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:43:39,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {12984#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12985#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:43:39,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {12985#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12986#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:43:39,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {12986#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12987#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:43:39,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {12987#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12988#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:43:39,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {12988#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12989#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:43:39,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {12989#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12990#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:43:39,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {12990#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12991#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:43:39,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {12991#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12992#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:43:39,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {12992#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12993#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:43:39,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {12993#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12994#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:43:39,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {12994#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12995#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:43:39,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {12995#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12996#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:43:39,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {12996#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12997#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:43:39,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {12997#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12998#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:43:39,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {12998#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {12999#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:43:39,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {12999#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13083#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ (mod main_~v~0 256) 4845)))} is VALID [2022-04-28 10:43:39,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {13083#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ (mod main_~v~0 256) 4845)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {13083#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ (mod main_~v~0 256) 4845)))} is VALID [2022-04-28 10:43:39,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {13083#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ (mod main_~v~0 256) 4845)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {12976#false} is VALID [2022-04-28 10:43:39,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {12976#false} assume !false; {12976#false} is VALID [2022-04-28 10:43:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:43:39,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:44:06,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {12976#false} assume !false; {12976#false} is VALID [2022-04-28 10:44:06,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {13096#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {12976#false} is VALID [2022-04-28 10:44:06,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {13096#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {13096#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:44:06,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {13103#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13096#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:44:06,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {13107#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13103#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:44:06,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {13111#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13107#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:44:06,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {13115#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13111#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:44:06,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {13119#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13115#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:44:06,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {13123#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13119#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:44:06,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {13127#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13123#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:44:06,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {13131#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13127#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-28 10:44:06,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {13135#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13131#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-28 10:44:06,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {13139#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13135#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-28 10:44:06,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {13143#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13139#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-28 10:44:07,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {13147#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13143#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:44:07,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {13151#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13147#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} is VALID [2022-04-28 10:44:07,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {13155#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13151#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:44:07,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {13159#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13155#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} is VALID [2022-04-28 10:44:07,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {13163#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13159#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} is VALID [2022-04-28 10:44:07,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {13167#(<= (div (+ (- 68719481072) (* (- 1) main_~s~0)) (- 4294967296)) (+ 33 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13163#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:44:07,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {13171#(<= (div (+ (* (- 1) main_~s~0) (- 73014448623)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 35))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13167#(<= (div (+ (- 68719481072) (* (- 1) main_~s~0)) (- 4294967296)) (+ 33 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} is VALID [2022-04-28 10:44:07,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {13175#(<= (div (+ (* (- 1) main_~s~0) (- 77309416174)) (- 4294967296)) (+ (div (+ (- 77309411328) main_~s~0) 4294967296) 37))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13171#(<= (div (+ (* (- 1) main_~s~0) (- 73014448623)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 35))} is VALID [2022-04-28 10:44:07,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {13179#(<= (div (+ (- 81604383725) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13175#(<= (div (+ (* (- 1) main_~s~0) (- 77309416174)) (- 4294967296)) (+ (div (+ (- 77309411328) main_~s~0) 4294967296) 37))} is VALID [2022-04-28 10:44:07,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {12975#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {13179#(<= (div (+ (- 81604383725) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 39))} is VALID [2022-04-28 10:44:07,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {12975#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12975#true} is VALID [2022-04-28 10:44:07,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {12975#true} call #t~ret7 := main(); {12975#true} is VALID [2022-04-28 10:44:07,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12975#true} {12975#true} #38#return; {12975#true} is VALID [2022-04-28 10:44:07,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {12975#true} assume true; {12975#true} is VALID [2022-04-28 10:44:07,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {12975#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(26, 2);call #Ultimate.allocInit(12, 3); {12975#true} is VALID [2022-04-28 10:44:07,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {12975#true} call ULTIMATE.init(); {12975#true} is VALID [2022-04-28 10:44:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:44:07,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572177521] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:44:07,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:44:07,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:44:07,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:07,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1233309915] [2022-04-28 10:44:07,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1233309915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:07,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:07,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:44:07,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095767513] [2022-04-28 10:44:07,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:07,212 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 10:44:07,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:07,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:07,229 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:44:07,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:44:07,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:07,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:44:07,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=892, Invalid=1178, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:44:07,230 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:07,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:07,922 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 10:44:07,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:44:07,923 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 10:44:07,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:44:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 41 transitions. [2022-04-28 10:44:07,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 41 transitions. [2022-04-28 10:44:07,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 41 transitions. [2022-04-28 10:44:07,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:07,960 INFO L225 Difference]: With dead ends: 41 [2022-04-28 10:44:07,960 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 10:44:07,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 21 SyntacticMatches, 19 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1837, Invalid=2585, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:44:07,961 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:44:07,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 43 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:44:07,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 10:44:08,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-04-28 10:44:08,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:44:08,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:08,001 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:08,001 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:08,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:08,002 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 10:44:08,002 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 10:44:08,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:08,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:08,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 10:44:08,002 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 10:44:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:08,003 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 10:44:08,003 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 10:44:08,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:08,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:08,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:44:08,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:44:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-04-28 10:44:08,004 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2022-04-28 10:44:08,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:44:08,004 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-04-28 10:44:08,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:08,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 37 transitions. [2022-04-28 10:44:08,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-04-28 10:44:08,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:44:08,041 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:08,041 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:44:08,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 10:44:08,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 10:44:08,241 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:08,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:08,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1129154806, now seen corresponding path program 39 times [2022-04-28 10:44:08,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:08,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [7375838] [2022-04-28 10:44:08,244 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:44:08,244 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:44:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1129154806, now seen corresponding path program 40 times [2022-04-28 10:44:08,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:08,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073255620] [2022-04-28 10:44:08,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:08,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:08,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:44:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:08,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {13503#(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(26, 2);call #Ultimate.allocInit(12, 3); {13477#true} is VALID [2022-04-28 10:44:08,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {13477#true} assume true; {13477#true} is VALID [2022-04-28 10:44:08,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13477#true} {13477#true} #38#return; {13477#true} is VALID [2022-04-28 10:44:08,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {13477#true} call ULTIMATE.init(); {13503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:44:08,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {13503#(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(26, 2);call #Ultimate.allocInit(12, 3); {13477#true} is VALID [2022-04-28 10:44:08,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {13477#true} assume true; {13477#true} is VALID [2022-04-28 10:44:08,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13477#true} {13477#true} #38#return; {13477#true} is VALID [2022-04-28 10:44:08,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {13477#true} call #t~ret7 := main(); {13477#true} is VALID [2022-04-28 10:44:08,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {13477#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {13477#true} is VALID [2022-04-28 10:44:08,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {13477#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {13482#(= main_~s~0 0)} is VALID [2022-04-28 10:44:08,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {13482#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13483#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:44:08,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {13483#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13484#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:08,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {13484#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13485#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:08,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {13485#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13486#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:44:08,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {13486#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13487#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:44:08,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {13487#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13488#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:44:08,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {13488#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13489#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:44:08,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {13489#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13490#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:08,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {13490#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13491#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:44:08,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {13491#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13492#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:08,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {13492#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13493#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:44:08,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {13493#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13494#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:08,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {13494#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13495#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:08,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {13495#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13496#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:08,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {13496#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13497#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:44:08,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {13497#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13498#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:44:08,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {13498#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13499#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:44:08,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {13499#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13500#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:08,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {13500#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13501#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:44:08,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {13501#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13502#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-28 10:44:08,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {13502#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {13502#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-28 10:44:08,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {13502#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {13502#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-28 10:44:08,624 INFO L290 TraceCheckUtils]: 29: Hoare triple {13502#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume ~s~0 % 4294967296 > 65025; {13478#false} is VALID [2022-04-28 10:44:08,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {13478#false} assume !false; {13478#false} is VALID [2022-04-28 10:44:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:44:08,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:08,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073255620] [2022-04-28 10:44:08,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073255620] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:44:08,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025697869] [2022-04-28 10:44:08,625 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:44:08,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:08,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:08,626 INFO L229 MonitoredProcess]: Starting monitored process 41 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:44:08,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 10:44:08,685 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:44:08,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:44:08,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:44:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:08,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:44:11,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {13477#true} call ULTIMATE.init(); {13477#true} is VALID [2022-04-28 10:44:11,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {13477#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(26, 2);call #Ultimate.allocInit(12, 3); {13477#true} is VALID [2022-04-28 10:44:11,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {13477#true} assume true; {13477#true} is VALID [2022-04-28 10:44:11,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13477#true} {13477#true} #38#return; {13477#true} is VALID [2022-04-28 10:44:11,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {13477#true} call #t~ret7 := main(); {13477#true} is VALID [2022-04-28 10:44:11,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {13477#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {13477#true} is VALID [2022-04-28 10:44:11,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {13477#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {13482#(= main_~s~0 0)} is VALID [2022-04-28 10:44:11,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {13482#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13483#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:44:11,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {13483#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13484#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:11,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {13484#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13485#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:11,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {13485#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13486#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:44:11,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {13486#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13487#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:44:11,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {13487#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13488#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:44:11,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {13488#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13489#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:44:11,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {13489#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13490#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:11,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {13490#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13491#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:44:11,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {13491#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13492#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:11,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {13492#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13493#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:44:11,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {13493#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13494#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:11,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {13494#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13495#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:11,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {13495#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13496#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:11,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {13496#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13497#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:44:11,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {13497#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13498#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:44:11,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {13498#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13499#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:44:11,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {13499#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13500#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:11,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {13500#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13501#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:44:11,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {13501#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13502#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-28 10:44:11,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {13502#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {13502#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-28 10:44:11,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {13502#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {13502#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-28 10:44:11,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {13502#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume ~s~0 % 4294967296 > 65025; {13478#false} is VALID [2022-04-28 10:44:11,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {13478#false} assume !false; {13478#false} is VALID [2022-04-28 10:44:11,479 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:44:11,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:44:46,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {13478#false} assume !false; {13478#false} is VALID [2022-04-28 10:44:46,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {13600#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {13478#false} is VALID [2022-04-28 10:44:46,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {13600#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {13600#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:44:46,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {13600#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {13600#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:44:46,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {13610#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13600#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:44:46,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {13614#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13610#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:44:46,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {13618#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13614#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:44:46,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {13622#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13618#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:44:46,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {13626#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13622#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:44:46,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {13630#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13626#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:44:46,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {13634#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13630#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-28 10:44:46,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {13638#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13634#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-28 10:44:46,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {13642#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13638#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-28 10:44:46,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {13646#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13642#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is VALID [2022-04-28 10:44:46,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {13650#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13646#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:44:46,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {13654#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13650#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} is VALID [2022-04-28 10:44:46,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {13658#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13654#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:44:46,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {13662#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13658#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} is VALID [2022-04-28 10:44:46,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {13666#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13662#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} is VALID [2022-04-28 10:44:46,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {13670#(<= (div (+ (* (- 1) main_~s~0) (- 64424448495)) (- 4294967296)) (+ 31 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13666#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:44:46,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {13674#(<= (div (+ (- 68719416046) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 33))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13670#(<= (div (+ (* (- 1) main_~s~0) (- 64424448495)) (- 4294967296)) (+ 31 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} is VALID [2022-04-28 10:44:46,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {13678#(<= (div (+ (- 73014383597) (* (- 1) main_~s~0)) (- 4294967296)) (+ 35 (div (+ (- 77309411328) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13674#(<= (div (+ (- 68719416046) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 33))} is VALID [2022-04-28 10:44:46,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {13682#(<= (div (+ (- 77309351148) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 37))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13678#(<= (div (+ (- 73014383597) (* (- 1) main_~s~0)) (- 4294967296)) (+ 35 (div (+ (- 77309411328) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:44:46,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {13686#(<= (div (+ (- 81604318699) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 85899345920)) 4294967296) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13682#(<= (div (+ (- 77309351148) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 37))} is VALID [2022-04-28 10:44:46,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {13477#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {13686#(<= (div (+ (- 81604318699) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 85899345920)) 4294967296) 39))} is VALID [2022-04-28 10:44:46,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {13477#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {13477#true} is VALID [2022-04-28 10:44:46,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {13477#true} call #t~ret7 := main(); {13477#true} is VALID [2022-04-28 10:44:46,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13477#true} {13477#true} #38#return; {13477#true} is VALID [2022-04-28 10:44:46,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {13477#true} assume true; {13477#true} is VALID [2022-04-28 10:44:46,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {13477#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(26, 2);call #Ultimate.allocInit(12, 3); {13477#true} is VALID [2022-04-28 10:44:46,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {13477#true} call ULTIMATE.init(); {13477#true} is VALID [2022-04-28 10:44:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:44:46,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025697869] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:44:46,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:44:46,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 45 [2022-04-28 10:44:46,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:46,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [7375838] [2022-04-28 10:44:46,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [7375838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:46,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:46,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:44:46,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004428930] [2022-04-28 10:44:46,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:46,526 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 10:44:46,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:46,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:46,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:46,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:44:46,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:46,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:44:46,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 10:44:46,547 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:46,998 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 10:44:46,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:44:46,998 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 10:44:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:44:46,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2022-04-28 10:44:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2022-04-28 10:44:46,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 39 transitions. [2022-04-28 10:44:47,028 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:44:47,028 INFO L225 Difference]: With dead ends: 39 [2022-04-28 10:44:47,028 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 10:44:47,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 23 SyntacticMatches, 21 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1893, Invalid=2397, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 10:44:47,029 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:44:47,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 29 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:44:47,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 10:44:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 10:44:47,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:44:47,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:47,072 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:47,073 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:47,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:47,073 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 10:44:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 10:44:47,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:47,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:47,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 10:44:47,074 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 10:44:47,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:47,074 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 10:44:47,074 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 10:44:47,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:47,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:47,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:44:47,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:44:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-28 10:44:47,075 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2022-04-28 10:44:47,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:44:47,075 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-28 10:44:47,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:47,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-28 10:44:47,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:47,111 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 10:44:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:44:47,111 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:47,111 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:44:47,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-28 10:44:47,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-04-28 10:44:47,312 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1129203625, now seen corresponding path program 41 times [2022-04-28 10:44:47,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:47,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1439082816] [2022-04-28 10:44:47,315 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:44:47,315 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:44:47,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1129203625, now seen corresponding path program 42 times [2022-04-28 10:44:47,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:47,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970856550] [2022-04-28 10:44:47,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:47,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:47,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:44:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:47,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {13997#(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(26, 2);call #Ultimate.allocInit(12, 3); {13970#true} is VALID [2022-04-28 10:44:47,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {13970#true} assume true; {13970#true} is VALID [2022-04-28 10:44:47,654 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13970#true} {13970#true} #38#return; {13970#true} is VALID [2022-04-28 10:44:47,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {13970#true} call ULTIMATE.init(); {13997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:44:47,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {13997#(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(26, 2);call #Ultimate.allocInit(12, 3); {13970#true} is VALID [2022-04-28 10:44:47,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {13970#true} assume true; {13970#true} is VALID [2022-04-28 10:44:47,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13970#true} {13970#true} #38#return; {13970#true} is VALID [2022-04-28 10:44:47,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {13970#true} call #t~ret7 := main(); {13970#true} is VALID [2022-04-28 10:44:47,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {13970#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {13970#true} is VALID [2022-04-28 10:44:47,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {13970#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {13975#(= main_~s~0 0)} is VALID [2022-04-28 10:44:47,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {13975#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13976#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:44:47,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {13976#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13977#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:47,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {13977#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13978#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:47,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {13978#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13979#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:44:47,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {13979#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13980#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:44:47,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {13980#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13981#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:44:47,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {13981#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13982#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:44:47,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {13982#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13983#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:47,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {13983#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13984#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:44:47,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {13984#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13985#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:47,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {13985#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13986#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:44:47,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {13986#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13987#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:47,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {13987#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13988#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:47,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {13988#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13989#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:47,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {13989#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13990#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:44:47,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {13990#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13991#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:44:47,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {13991#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13992#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:44:47,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {13992#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13993#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:47,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {13993#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13994#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:44:47,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {13994#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13995#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-28 10:44:47,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {13995#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13996#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:44:47,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {13996#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {13996#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:44:47,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {13996#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {13971#false} is VALID [2022-04-28 10:44:47,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {13971#false} assume !false; {13971#false} is VALID [2022-04-28 10:44:47,669 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:44:47,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:47,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970856550] [2022-04-28 10:44:47,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970856550] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:44:47,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46595418] [2022-04-28 10:44:47,669 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:44:47,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:47,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:47,670 INFO L229 MonitoredProcess]: Starting monitored process 42 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:44:47,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-28 10:44:48,643 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 10:44:48,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:44:48,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:44:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:48,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:44:52,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {13970#true} call ULTIMATE.init(); {13970#true} is VALID [2022-04-28 10:44:52,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {13970#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(26, 2);call #Ultimate.allocInit(12, 3); {13970#true} is VALID [2022-04-28 10:44:52,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {13970#true} assume true; {13970#true} is VALID [2022-04-28 10:44:52,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13970#true} {13970#true} #38#return; {13970#true} is VALID [2022-04-28 10:44:52,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {13970#true} call #t~ret7 := main(); {13970#true} is VALID [2022-04-28 10:44:52,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {13970#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {13970#true} is VALID [2022-04-28 10:44:52,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {13970#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {13975#(= main_~s~0 0)} is VALID [2022-04-28 10:44:52,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {13975#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13976#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:44:52,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {13976#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13977#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:52,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {13977#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13978#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:52,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {13978#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13979#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:44:52,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {13979#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13980#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:44:52,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {13980#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13981#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:44:52,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {13981#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13982#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:44:52,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {13982#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13983#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:52,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {13983#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13984#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:44:52,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {13984#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13985#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:52,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {13985#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13986#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:44:52,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {13986#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13987#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:52,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {13987#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13988#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:52,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {13988#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13989#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:52,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {13989#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13990#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:44:52,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {13990#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13991#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:44:52,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {13991#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13992#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:44:52,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {13992#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13993#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:44:52,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {13993#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13994#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:44:52,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {13994#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {13995#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-28 10:44:52,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {13995#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14082#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 5100 (mod main_~v~0 256))))} is VALID [2022-04-28 10:44:52,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {14082#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 5100 (mod main_~v~0 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {14082#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 5100 (mod main_~v~0 256))))} is VALID [2022-04-28 10:44:52,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {14082#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 5100 (mod main_~v~0 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {13971#false} is VALID [2022-04-28 10:44:52,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {13971#false} assume !false; {13971#false} is VALID [2022-04-28 10:44:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:44:52,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:45:18,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {13971#false} assume !false; {13971#false} is VALID [2022-04-28 10:45:18,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {14095#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {13971#false} is VALID [2022-04-28 10:45:18,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {14095#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {14095#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:45:18,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {14102#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14095#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:45:18,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {14106#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14102#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:45:18,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {14110#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14106#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:45:18,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {14114#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14110#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:45:18,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {14118#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14114#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:45:18,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {14122#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14118#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:45:18,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {14126#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14122#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:45:18,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {14130#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14126#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-28 10:45:18,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {14134#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14130#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-28 10:45:18,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {14138#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14134#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-28 10:45:18,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {14142#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14138#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-28 10:45:18,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {14146#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14142#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:45:18,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {14150#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14146#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} is VALID [2022-04-28 10:45:18,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {14154#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14150#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:45:18,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {14158#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14154#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} is VALID [2022-04-28 10:45:18,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {14162#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14158#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} is VALID [2022-04-28 10:45:18,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {14166#(<= (div (+ (- 68719481072) (* (- 1) main_~s~0)) (- 4294967296)) (+ 33 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14162#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:45:18,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {14170#(<= (div (+ (* (- 1) main_~s~0) (- 73014448623)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 35))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14166#(<= (div (+ (- 68719481072) (* (- 1) main_~s~0)) (- 4294967296)) (+ 33 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} is VALID [2022-04-28 10:45:19,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {14174#(<= (div (+ (* (- 1) main_~s~0) (- 77309416174)) (- 4294967296)) (+ (div (+ (- 77309411328) main_~s~0) 4294967296) 37))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14170#(<= (div (+ (* (- 1) main_~s~0) (- 73014448623)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 35))} is VALID [2022-04-28 10:45:19,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {14178#(<= (div (+ (- 81604383725) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14174#(<= (div (+ (* (- 1) main_~s~0) (- 77309416174)) (- 4294967296)) (+ (div (+ (- 77309411328) main_~s~0) 4294967296) 37))} is VALID [2022-04-28 10:45:19,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {14182#(<= (div (+ (* (- 1) main_~s~0) (- 85899351276)) (- 4294967296)) (+ 41 (div (+ main_~s~0 (- 85899345920)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14178#(<= (div (+ (- 81604383725) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 39))} is VALID [2022-04-28 10:45:19,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {13970#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {14182#(<= (div (+ (* (- 1) main_~s~0) (- 85899351276)) (- 4294967296)) (+ 41 (div (+ main_~s~0 (- 85899345920)) 4294967296)))} is VALID [2022-04-28 10:45:19,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {13970#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {13970#true} is VALID [2022-04-28 10:45:19,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {13970#true} call #t~ret7 := main(); {13970#true} is VALID [2022-04-28 10:45:19,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13970#true} {13970#true} #38#return; {13970#true} is VALID [2022-04-28 10:45:19,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {13970#true} assume true; {13970#true} is VALID [2022-04-28 10:45:19,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {13970#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(26, 2);call #Ultimate.allocInit(12, 3); {13970#true} is VALID [2022-04-28 10:45:19,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {13970#true} call ULTIMATE.init(); {13970#true} is VALID [2022-04-28 10:45:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:45:19,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46595418] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:45:19,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:45:19,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:45:19,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:45:19,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1439082816] [2022-04-28 10:45:19,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1439082816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:45:19,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:45:19,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:45:19,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154372901] [2022-04-28 10:45:19,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:45:19,157 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 10:45:19,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:45:19,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:19,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:45:19,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:45:19,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:45:19,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:45:19,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=978, Invalid=1278, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:45:19,179 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:20,019 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 10:45:20,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:45:20,020 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 10:45:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:45:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2022-04-28 10:45:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2022-04-28 10:45:20,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 42 transitions. [2022-04-28 10:45:20,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:45:20,061 INFO L225 Difference]: With dead ends: 42 [2022-04-28 10:45:20,061 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 10:45:20,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 21 SyntacticMatches, 20 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2012, Invalid=2818, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:45:20,062 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:45:20,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 53 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:45:20,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 10:45:20,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-28 10:45:20,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:45:20,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:20,104 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:20,105 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:20,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:20,105 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 10:45:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 10:45:20,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:45:20,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:45:20,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-28 10:45:20,106 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-28 10:45:20,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:20,106 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 10:45:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 10:45:20,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:45:20,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:45:20,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:45:20,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:45:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-28 10:45:20,107 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 31 [2022-04-28 10:45:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:45:20,108 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-28 10:45:20,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:20,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-28 10:45:20,153 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:45:20,154 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-28 10:45:20,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:45:20,154 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:45:20,154 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:45:20,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-28 10:45:20,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:45:20,355 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:45:20,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:45:20,355 INFO L85 PathProgramCache]: Analyzing trace with hash 645577078, now seen corresponding path program 41 times [2022-04-28 10:45:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:45:20,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1052247742] [2022-04-28 10:45:20,358 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:45:20,358 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:45:20,358 INFO L85 PathProgramCache]: Analyzing trace with hash 645577078, now seen corresponding path program 42 times [2022-04-28 10:45:20,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:45:20,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815796141] [2022-04-28 10:45:20,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:45:20,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:45:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:20,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:45:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:20,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {14515#(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(26, 2);call #Ultimate.allocInit(12, 3); {14488#true} is VALID [2022-04-28 10:45:20,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {14488#true} assume true; {14488#true} is VALID [2022-04-28 10:45:20,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14488#true} {14488#true} #38#return; {14488#true} is VALID [2022-04-28 10:45:20,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {14488#true} call ULTIMATE.init(); {14515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:45:20,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {14515#(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(26, 2);call #Ultimate.allocInit(12, 3); {14488#true} is VALID [2022-04-28 10:45:20,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {14488#true} assume true; {14488#true} is VALID [2022-04-28 10:45:20,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14488#true} {14488#true} #38#return; {14488#true} is VALID [2022-04-28 10:45:20,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {14488#true} call #t~ret7 := main(); {14488#true} is VALID [2022-04-28 10:45:20,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {14488#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {14488#true} is VALID [2022-04-28 10:45:20,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {14488#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {14493#(= main_~s~0 0)} is VALID [2022-04-28 10:45:20,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {14493#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14494#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:45:20,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {14494#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14495#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:45:20,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {14495#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14496#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:45:20,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {14496#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14497#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:45:20,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {14497#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14498#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:45:20,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {14498#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14499#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:45:20,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {14499#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14500#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:45:20,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {14500#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14501#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:45:20,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {14501#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14502#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:45:20,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {14502#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14503#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:45:20,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {14503#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14504#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:45:20,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {14504#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14505#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:45:20,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {14505#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14506#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:45:20,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {14506#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14507#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:45:20,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {14507#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14508#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:45:20,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {14508#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14509#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:45:20,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {14509#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14510#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:45:20,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {14510#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14511#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:45:20,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {14511#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14512#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:45:20,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {14512#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14513#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-28 10:45:20,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {14513#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14514#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-28 10:45:20,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {14514#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {14514#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-28 10:45:20,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {14514#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {14514#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-28 10:45:20,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {14514#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} assume ~s~0 % 4294967296 > 65025; {14489#false} is VALID [2022-04-28 10:45:20,759 INFO L290 TraceCheckUtils]: 31: Hoare triple {14489#false} assume !false; {14489#false} is VALID [2022-04-28 10:45:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:45:20,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:45:20,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815796141] [2022-04-28 10:45:20,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815796141] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:45:20,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398159846] [2022-04-28 10:45:20,760 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:45:20,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:45:20,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:45:20,761 INFO L229 MonitoredProcess]: Starting monitored process 43 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:45:20,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-28 10:45:21,934 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 10:45:21,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:45:21,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:45:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:21,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:45:24,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {14488#true} call ULTIMATE.init(); {14488#true} is VALID [2022-04-28 10:45:24,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {14488#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(26, 2);call #Ultimate.allocInit(12, 3); {14488#true} is VALID [2022-04-28 10:45:24,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {14488#true} assume true; {14488#true} is VALID [2022-04-28 10:45:24,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14488#true} {14488#true} #38#return; {14488#true} is VALID [2022-04-28 10:45:24,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {14488#true} call #t~ret7 := main(); {14488#true} is VALID [2022-04-28 10:45:24,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {14488#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {14488#true} is VALID [2022-04-28 10:45:24,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {14488#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {14493#(= main_~s~0 0)} is VALID [2022-04-28 10:45:24,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {14493#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14494#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:45:24,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {14494#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14495#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:45:24,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {14495#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14496#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:45:24,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {14496#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14497#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:45:24,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {14497#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14498#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:45:24,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {14498#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14499#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:45:24,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {14499#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14500#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:45:24,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {14500#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14501#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:45:24,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {14501#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14502#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:45:24,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {14502#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14503#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:45:24,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {14503#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14504#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:45:24,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {14504#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14505#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:45:24,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {14505#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14506#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:45:24,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {14506#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14507#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:45:24,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {14507#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14508#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:45:24,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {14508#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14509#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:45:24,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {14509#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14510#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:45:24,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {14510#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14511#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:45:24,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {14511#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14512#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:45:24,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {14512#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14513#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-28 10:45:24,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {14513#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14514#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-28 10:45:24,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {14514#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {14514#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-28 10:45:24,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {14514#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {14514#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-28 10:45:24,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {14514#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} assume ~s~0 % 4294967296 > 65025; {14489#false} is VALID [2022-04-28 10:45:24,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {14489#false} assume !false; {14489#false} is VALID [2022-04-28 10:45:24,934 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:45:24,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:46:05,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {14489#false} assume !false; {14489#false} is VALID [2022-04-28 10:46:05,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {14615#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {14489#false} is VALID [2022-04-28 10:46:05,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {14615#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {14615#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:46:05,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {14615#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {14615#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:46:05,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {14625#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14615#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-28 10:46:05,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {14629#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14625#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-28 10:46:05,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {14633#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14629#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-28 10:46:05,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {14637#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14633#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:46:05,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {14641#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14637#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:46:05,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {14645#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14641#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-28 10:46:05,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {14649#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14645#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-28 10:46:05,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {14653#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14649#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-28 10:46:05,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {14657#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14653#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-28 10:46:05,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {14661#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14657#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is VALID [2022-04-28 10:46:05,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {14665#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14661#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:46:05,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {14669#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14665#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} is VALID [2022-04-28 10:46:05,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {14673#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14669#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:46:05,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {14677#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14673#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} is VALID [2022-04-28 10:46:05,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {14681#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14677#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} is VALID [2022-04-28 10:46:05,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {14685#(<= (div (+ (* (- 1) main_~s~0) (- 64424448495)) (- 4294967296)) (+ 31 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14681#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:46:06,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {14689#(<= (div (+ (- 68719416046) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 33))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14685#(<= (div (+ (* (- 1) main_~s~0) (- 64424448495)) (- 4294967296)) (+ 31 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} is VALID [2022-04-28 10:46:06,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {14693#(<= (div (+ (- 73014383597) (* (- 1) main_~s~0)) (- 4294967296)) (+ 35 (div (+ (- 77309411328) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14689#(<= (div (+ (- 68719416046) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 33))} is VALID [2022-04-28 10:46:06,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {14697#(<= (div (+ (- 77309351148) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 37))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14693#(<= (div (+ (- 73014383597) (* (- 1) main_~s~0)) (- 4294967296)) (+ 35 (div (+ (- 77309411328) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:46:06,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {14701#(<= (div (+ (- 81604318699) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 85899345920)) 4294967296) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14697#(<= (div (+ (- 77309351148) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 37))} is VALID [2022-04-28 10:46:06,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {14705#(<= (div (+ (* (- 1) main_~s~0) (- 85899286250)) (- 4294967296)) (+ 41 (div (+ main_~s~0 (- 90194313216)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {14701#(<= (div (+ (- 81604318699) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 85899345920)) 4294967296) 39))} is VALID [2022-04-28 10:46:06,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {14488#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {14705#(<= (div (+ (* (- 1) main_~s~0) (- 85899286250)) (- 4294967296)) (+ 41 (div (+ main_~s~0 (- 90194313216)) 4294967296)))} is VALID [2022-04-28 10:46:06,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {14488#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {14488#true} is VALID [2022-04-28 10:46:06,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {14488#true} call #t~ret7 := main(); {14488#true} is VALID [2022-04-28 10:46:06,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14488#true} {14488#true} #38#return; {14488#true} is VALID [2022-04-28 10:46:06,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {14488#true} assume true; {14488#true} is VALID [2022-04-28 10:46:06,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {14488#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(26, 2);call #Ultimate.allocInit(12, 3); {14488#true} is VALID [2022-04-28 10:46:06,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {14488#true} call ULTIMATE.init(); {14488#true} is VALID [2022-04-28 10:46:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:46:06,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398159846] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:46:06,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:46:06,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 47 [2022-04-28 10:46:06,029 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:46:06,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1052247742] [2022-04-28 10:46:06,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1052247742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:46:06,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:46:06,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:46:06,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368827025] [2022-04-28 10:46:06,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:46:06,029 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 10:46:06,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:46:06,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:06,049 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:46:06,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:46:06,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:46:06,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:46:06,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 10:46:06,050 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:06,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:06,533 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 10:46:06,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:46:06,533 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 10:46:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:46:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2022-04-28 10:46:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2022-04-28 10:46:06,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 40 transitions. [2022-04-28 10:46:06,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:46:06,562 INFO L225 Difference]: With dead ends: 40 [2022-04-28 10:46:06,562 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 10:46:06,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 23 SyntacticMatches, 22 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2071, Invalid=2621, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 10:46:06,563 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:46:06,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 29 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:46:06,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 10:46:06,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 10:46:06,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:46:06,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:06,603 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:06,604 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:06,605 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 10:46:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 10:46:06,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:46:06,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:46:06,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 10:46:06,605 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 10:46:06,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:06,606 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 10:46:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 10:46:06,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:46:06,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:46:06,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:46:06,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:46:06,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:06,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-28 10:46:06,607 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2022-04-28 10:46:06,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:46:06,607 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-28 10:46:06,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:06,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-28 10:46:06,641 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:46:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 10:46:06,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:46:06,641 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:46:06,641 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:46:06,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 10:46:06,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:46:06,842 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:46:06,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:46:06,842 INFO L85 PathProgramCache]: Analyzing trace with hash 645625897, now seen corresponding path program 43 times [2022-04-28 10:46:06,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:46:06,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [495164524] [2022-04-28 10:46:06,845 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:46:06,845 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:46:06,845 INFO L85 PathProgramCache]: Analyzing trace with hash 645625897, now seen corresponding path program 44 times [2022-04-28 10:46:06,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:46:06,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525765704] [2022-04-28 10:46:06,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:46:06,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:46:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:07,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:46:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:07,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {15025#(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(26, 2);call #Ultimate.allocInit(12, 3); {14997#true} is VALID [2022-04-28 10:46:07,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {14997#true} assume true; {14997#true} is VALID [2022-04-28 10:46:07,231 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14997#true} {14997#true} #38#return; {14997#true} is VALID [2022-04-28 10:46:07,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {14997#true} call ULTIMATE.init(); {15025#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:46:07,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {15025#(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(26, 2);call #Ultimate.allocInit(12, 3); {14997#true} is VALID [2022-04-28 10:46:07,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {14997#true} assume true; {14997#true} is VALID [2022-04-28 10:46:07,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14997#true} {14997#true} #38#return; {14997#true} is VALID [2022-04-28 10:46:07,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {14997#true} call #t~ret7 := main(); {14997#true} is VALID [2022-04-28 10:46:07,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {14997#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {14997#true} is VALID [2022-04-28 10:46:07,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {14997#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {15002#(= main_~s~0 0)} is VALID [2022-04-28 10:46:07,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {15002#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15003#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:46:07,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {15003#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15004#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:07,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {15004#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15005#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:07,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {15005#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15006#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:46:07,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {15006#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15007#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:46:07,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {15007#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15008#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:46:07,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {15008#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15009#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:46:07,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {15009#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15010#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:07,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {15010#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15011#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:46:07,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {15011#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15012#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:07,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {15012#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15013#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:46:07,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {15013#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15014#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:07,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {15014#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15015#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:07,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {15015#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15016#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:07,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {15016#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15017#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:46:07,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {15017#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15018#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:46:07,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {15018#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15019#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:46:07,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {15019#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15020#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:07,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {15020#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15021#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:46:07,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {15021#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15022#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-28 10:46:07,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {15022#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15023#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-28 10:46:07,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {15023#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15024#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:46:07,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {15024#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {15024#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-28 10:46:07,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {15024#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {14998#false} is VALID [2022-04-28 10:46:07,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {14998#false} assume !false; {14998#false} is VALID [2022-04-28 10:46:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:46:07,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:46:07,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525765704] [2022-04-28 10:46:07,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525765704] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:46:07,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589522648] [2022-04-28 10:46:07,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:46:07,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:46:07,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:46:07,249 INFO L229 MonitoredProcess]: Starting monitored process 44 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:46:07,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-28 10:46:07,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:46:07,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:46:07,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:46:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:07,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:46:11,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {14997#true} call ULTIMATE.init(); {14997#true} is VALID [2022-04-28 10:46:11,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {14997#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(26, 2);call #Ultimate.allocInit(12, 3); {14997#true} is VALID [2022-04-28 10:46:11,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {14997#true} assume true; {14997#true} is VALID [2022-04-28 10:46:11,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14997#true} {14997#true} #38#return; {14997#true} is VALID [2022-04-28 10:46:11,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {14997#true} call #t~ret7 := main(); {14997#true} is VALID [2022-04-28 10:46:11,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {14997#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {14997#true} is VALID [2022-04-28 10:46:11,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {14997#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {15002#(= main_~s~0 0)} is VALID [2022-04-28 10:46:11,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {15002#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15003#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:46:11,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {15003#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15004#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:11,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {15004#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15005#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:11,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {15005#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15006#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:46:11,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {15006#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15007#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:46:11,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {15007#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15008#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:46:11,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {15008#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15009#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:46:11,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {15009#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15010#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:11,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {15010#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15011#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:46:11,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {15011#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15012#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:11,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {15012#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15013#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:46:11,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {15013#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15014#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:11,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {15014#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15015#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:11,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {15015#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15016#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:11,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {15016#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15017#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:46:11,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {15017#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15018#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:46:11,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {15018#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15019#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:46:11,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {15019#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15020#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:11,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {15020#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15021#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:46:11,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {15021#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15022#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-28 10:46:11,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {15022#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15023#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-28 10:46:11,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {15023#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15113#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 5355 (mod main_~v~0 256))))} is VALID [2022-04-28 10:46:11,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {15113#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 5355 (mod main_~v~0 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {15113#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 5355 (mod main_~v~0 256))))} is VALID [2022-04-28 10:46:11,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {15113#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 5355 (mod main_~v~0 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {14998#false} is VALID [2022-04-28 10:46:11,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {14998#false} assume !false; {14998#false} is VALID [2022-04-28 10:46:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:46:11,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:46:44,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {14998#false} assume !false; {14998#false} is VALID [2022-04-28 10:46:44,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {15126#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {14998#false} is VALID [2022-04-28 10:46:44,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {15126#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {15126#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:46:44,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {15133#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15126#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-28 10:46:44,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {15137#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15133#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-28 10:46:44,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {15141#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15137#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-28 10:46:44,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {15145#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15141#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:46:44,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {15149#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15145#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-28 10:46:44,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {15153#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15149#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-28 10:46:44,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {15157#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15153#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-28 10:46:44,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {15161#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15157#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-28 10:46:44,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {15165#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15161#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-28 10:46:44,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {15169#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15165#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-28 10:46:44,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {15173#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15169#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-28 10:46:44,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {15177#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15173#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:46:44,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {15181#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15177#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} is VALID [2022-04-28 10:46:44,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {15185#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15181#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:46:44,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {15189#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15185#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} is VALID [2022-04-28 10:46:44,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {15193#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15189#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} is VALID [2022-04-28 10:46:44,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {15197#(<= (div (+ (- 68719481072) (* (- 1) main_~s~0)) (- 4294967296)) (+ 33 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15193#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-28 10:46:44,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {15201#(<= (div (+ (* (- 1) main_~s~0) (- 73014448623)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 35))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15197#(<= (div (+ (- 68719481072) (* (- 1) main_~s~0)) (- 4294967296)) (+ 33 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} is VALID [2022-04-28 10:46:44,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {15205#(<= (div (+ (* (- 1) main_~s~0) (- 77309416174)) (- 4294967296)) (+ (div (+ (- 77309411328) main_~s~0) 4294967296) 37))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15201#(<= (div (+ (* (- 1) main_~s~0) (- 73014448623)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 35))} is VALID [2022-04-28 10:46:44,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {15209#(<= (div (+ (- 81604383725) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15205#(<= (div (+ (* (- 1) main_~s~0) (- 77309416174)) (- 4294967296)) (+ (div (+ (- 77309411328) main_~s~0) 4294967296) 37))} is VALID [2022-04-28 10:46:44,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {15213#(<= (div (+ (* (- 1) main_~s~0) (- 85899351276)) (- 4294967296)) (+ 41 (div (+ main_~s~0 (- 85899345920)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15209#(<= (div (+ (- 81604383725) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 39))} is VALID [2022-04-28 10:46:44,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {15217#(<= (div (+ (- 90194318827) (* (- 1) main_~s~0)) (- 4294967296)) (+ 43 (div (+ main_~s~0 (- 90194313216)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15213#(<= (div (+ (* (- 1) main_~s~0) (- 85899351276)) (- 4294967296)) (+ 41 (div (+ main_~s~0 (- 85899345920)) 4294967296)))} is VALID [2022-04-28 10:46:44,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {14997#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {15217#(<= (div (+ (- 90194318827) (* (- 1) main_~s~0)) (- 4294967296)) (+ 43 (div (+ main_~s~0 (- 90194313216)) 4294967296)))} is VALID [2022-04-28 10:46:44,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {14997#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {14997#true} is VALID [2022-04-28 10:46:44,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {14997#true} call #t~ret7 := main(); {14997#true} is VALID [2022-04-28 10:46:44,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14997#true} {14997#true} #38#return; {14997#true} is VALID [2022-04-28 10:46:44,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {14997#true} assume true; {14997#true} is VALID [2022-04-28 10:46:44,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {14997#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(26, 2);call #Ultimate.allocInit(12, 3); {14997#true} is VALID [2022-04-28 10:46:44,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {14997#true} call ULTIMATE.init(); {14997#true} is VALID [2022-04-28 10:46:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:46:44,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589522648] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:46:44,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:46:44,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:46:44,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:46:44,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [495164524] [2022-04-28 10:46:44,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [495164524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:46:44,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:46:44,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:46:44,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758899170] [2022-04-28 10:46:44,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:46:44,714 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 10:46:44,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:46:44,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:44,732 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:46:44,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:46:44,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:46:44,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:46:44,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1068, Invalid=1382, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:46:44,733 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:45,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:45,524 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 10:46:45,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:46:45,524 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 10:46:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:46:45,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions. [2022-04-28 10:46:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions. [2022-04-28 10:46:45,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 43 transitions. [2022-04-28 10:46:45,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:46:45,560 INFO L225 Difference]: With dead ends: 43 [2022-04-28 10:46:45,575 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 10:46:45,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 21 SyntacticMatches, 21 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2195, Invalid=3061, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 10:46:45,576 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:46:45,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:46:45,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 10:46:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-04-28 10:46:45,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:46:45,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:45,620 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:45,620 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:45,620 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 10:46:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 10:46:45,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:46:45,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:46:45,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 10:46:45,621 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 10:46:45,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:45,621 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 10:46:45,621 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 10:46:45,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:46:45,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:46:45,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:46:45,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:46:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2022-04-28 10:46:45,622 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 32 [2022-04-28 10:46:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:46:45,622 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2022-04-28 10:46:45,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:46:45,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 39 transitions. [2022-04-28 10:46:45,660 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:46:45,660 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-04-28 10:46:45,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:46:45,660 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:46:45,661 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:46:45,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-28 10:46:45,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-28 10:46:45,878 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:46:45,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:46:45,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1460430602, now seen corresponding path program 43 times [2022-04-28 10:46:45,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:46:45,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [737839712] [2022-04-28 10:46:45,881 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:46:45,881 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:46:45,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1460430602, now seen corresponding path program 44 times [2022-04-28 10:46:45,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:46:45,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833314981] [2022-04-28 10:46:45,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:46:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:46:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:46,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:46:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:46,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {15559#(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(26, 2);call #Ultimate.allocInit(12, 3); {15531#true} is VALID [2022-04-28 10:46:46,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {15531#true} assume true; {15531#true} is VALID [2022-04-28 10:46:46,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15531#true} {15531#true} #38#return; {15531#true} is VALID [2022-04-28 10:46:46,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {15531#true} call ULTIMATE.init(); {15559#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:46:46,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {15559#(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(26, 2);call #Ultimate.allocInit(12, 3); {15531#true} is VALID [2022-04-28 10:46:46,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {15531#true} assume true; {15531#true} is VALID [2022-04-28 10:46:46,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15531#true} {15531#true} #38#return; {15531#true} is VALID [2022-04-28 10:46:46,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {15531#true} call #t~ret7 := main(); {15531#true} is VALID [2022-04-28 10:46:46,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {15531#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {15531#true} is VALID [2022-04-28 10:46:46,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {15531#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {15536#(= main_~s~0 0)} is VALID [2022-04-28 10:46:46,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {15536#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15537#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:46:46,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {15537#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15538#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:46,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {15538#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15539#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:46,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {15539#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15540#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:46:46,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {15540#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15541#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:46:46,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {15541#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15542#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:46:46,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {15542#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15543#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:46:46,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {15543#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15544#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:46,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {15544#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15545#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:46:46,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {15545#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15546#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:46,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {15546#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15547#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:46:46,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {15547#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15548#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:46,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {15548#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15549#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:46,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {15549#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15550#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:46,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {15550#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15551#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:46:46,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {15551#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15552#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:46:46,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {15552#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15553#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:46:46,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {15553#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15554#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:46,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {15554#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15555#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:46:46,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {15555#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15556#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-28 10:46:46,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {15556#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15557#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-28 10:46:46,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {15557#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15558#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:46,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {15558#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {15558#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:46,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {15558#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {15558#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:46,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {15558#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {15532#false} is VALID [2022-04-28 10:46:46,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {15532#false} assume !false; {15532#false} is VALID [2022-04-28 10:46:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:46:46,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:46:46,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833314981] [2022-04-28 10:46:46,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833314981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:46:46,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764802804] [2022-04-28 10:46:46,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:46:46,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:46:46,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:46:46,296 INFO L229 MonitoredProcess]: Starting monitored process 45 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:46:46,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-28 10:46:46,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:46:46,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:46:46,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:46:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:46,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:46:49,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {15531#true} call ULTIMATE.init(); {15531#true} is VALID [2022-04-28 10:46:49,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {15531#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(26, 2);call #Ultimate.allocInit(12, 3); {15531#true} is VALID [2022-04-28 10:46:49,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {15531#true} assume true; {15531#true} is VALID [2022-04-28 10:46:49,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15531#true} {15531#true} #38#return; {15531#true} is VALID [2022-04-28 10:46:49,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {15531#true} call #t~ret7 := main(); {15531#true} is VALID [2022-04-28 10:46:49,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {15531#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {15531#true} is VALID [2022-04-28 10:46:49,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {15531#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {15536#(= main_~s~0 0)} is VALID [2022-04-28 10:46:49,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {15536#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15537#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-28 10:46:49,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {15537#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15538#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:49,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {15538#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15539#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:49,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {15539#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15540#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-28 10:46:49,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {15540#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15541#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-28 10:46:49,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {15541#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15542#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-28 10:46:49,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {15542#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15543#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-28 10:46:49,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {15543#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15544#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:49,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {15544#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15545#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-28 10:46:49,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {15545#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15546#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:49,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {15546#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15547#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-28 10:46:49,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {15547#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15548#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:49,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {15548#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15549#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:49,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {15549#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15550#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:49,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {15550#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15551#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-28 10:46:49,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {15551#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15552#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-28 10:46:49,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {15552#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15553#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-28 10:46:49,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {15553#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15554#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:49,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {15554#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15555#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-28 10:46:49,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {15555#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15556#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-28 10:46:49,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {15556#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15557#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-28 10:46:49,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {15557#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {15558#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:49,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {15558#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {15558#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:49,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {15558#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {15558#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} is VALID [2022-04-28 10:46:49,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {15558#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {15532#false} is VALID [2022-04-28 10:46:49,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {15532#false} assume !false; {15532#false} is VALID [2022-04-28 10:46:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:46:49,777 INFO L328 TraceCheckSpWp]: Computing backward predicates...