/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:05:43,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:05:43,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:05:43,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:05:43,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:05:43,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:05:43,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:05:43,579 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:05:43,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:05:43,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:05:43,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:05:43,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:05:43,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:05:43,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:05:43,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:05:43,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:05:43,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:05:43,591 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:05:43,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:05:43,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:05:43,594 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:05:43,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:05:43,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:05:43,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:05:43,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:05:43,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:05:43,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:05:43,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:05:43,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:05:43,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:05:43,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:05:43,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:05:43,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:05:43,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:05:43,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:05:43,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:05:43,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:05:43,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:05:43,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:05:43,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:05:43,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:05:43,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:05:43,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:05:43,621 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:05:43,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:05:43,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:05:43,622 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:05:43,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:05:43,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:05:43,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:05:43,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:05:43,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:05:43,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:05:43,623 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:05:43,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:05:43,623 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:05:43,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:05:43,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:05:43,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:05:43,624 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:05:43,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:05:43,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:05:43,624 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:05:43,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:05:43,624 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:05:43,624 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:05:43,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:05:43,624 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:05:43,624 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 04:05:43,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:05:43,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:05:43,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:05:43,843 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:05:43,844 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:05:43,844 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 04:05:43,887 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e608f72cc/7503ab0a55ec4bf7aef8e2f2fd80789b/FLAG232044964 [2022-04-28 04:05:44,167 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:05:44,168 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c [2022-04-28 04:05:44,171 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e608f72cc/7503ab0a55ec4bf7aef8e2f2fd80789b/FLAG232044964 [2022-04-28 04:05:44,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e608f72cc/7503ab0a55ec4bf7aef8e2f2fd80789b [2022-04-28 04:05:44,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:05:44,614 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:05:44,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:05:44,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:05:44,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:05:44,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:05:44" (1/1) ... [2022-04-28 04:05:44,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49102fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:44, skipping insertion in model container [2022-04-28 04:05:44,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:05:44" (1/1) ... [2022-04-28 04:05:44,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:05:44,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:05:44,746 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 04:05:44,749 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 04:05:44,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:05:44,763 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:05:44,775 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 04:05:44,775 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 04:05:44,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:05:44,786 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:05:44,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:44 WrapperNode [2022-04-28 04:05:44,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:05:44,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:05:44,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:05:44,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:05:44,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:44" (1/1) ... [2022-04-28 04:05:44,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:44" (1/1) ... [2022-04-28 04:05:44,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:44" (1/1) ... [2022-04-28 04:05:44,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:44" (1/1) ... [2022-04-28 04:05:44,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:44" (1/1) ... [2022-04-28 04:05:44,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:44" (1/1) ... [2022-04-28 04:05:44,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:44" (1/1) ... [2022-04-28 04:05:44,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:05:44,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:05:44,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:05:44,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:05:44,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:44" (1/1) ... [2022-04-28 04:05:44,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:05:44,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:05:44,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 04:05:44,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 04:05:44,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:05:44,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:05:44,861 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:05:44,861 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:05:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:05:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:05:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:05:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2022-04-28 04:05:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:05:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:05:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:05:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:05:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:05:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:05:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:05:44,909 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:05:44,910 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:05:45,044 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:05:45,049 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:05:45,049 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:05:45,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:05:45 BoogieIcfgContainer [2022-04-28 04:05:45,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:05:45,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:05:45,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:05:45,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:05:45,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:05:44" (1/3) ... [2022-04-28 04:05:45,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ccafc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:05:45, skipping insertion in model container [2022-04-28 04:05:45,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:44" (2/3) ... [2022-04-28 04:05:45,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ccafc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:05:45, skipping insertion in model container [2022-04-28 04:05:45,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:05:45" (3/3) ... [2022-04-28 04:05:45,056 INFO L111 eAbstractionObserver]: Analyzing ICFG linear-inequality-inv-a.c [2022-04-28 04:05:45,066 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:05:45,066 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-04-28 04:05:45,093 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:05:45,106 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@231016ec, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31c45269 [2022-04-28 04:05:45,106 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-04-28 04:05:45,112 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 04:05:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-28 04:05:45,117 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:05:45,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:05:45,117 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:05:45,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:05:45,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1624254505, now seen corresponding path program 1 times [2022-04-28 04:05:45,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:45,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [566921329] [2022-04-28 04:05:45,139 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:05:45,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1624254505, now seen corresponding path program 2 times [2022-04-28 04:05:45,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:05:45,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647879772] [2022-04-28 04:05:45,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:45,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:05:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:45,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:05:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:45,369 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 04:05:45,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 04:05:45,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #38#return; {21#true} is VALID [2022-04-28 04:05:45,371 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 04:05:45,371 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 04:05:45,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 04:05:45,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #38#return; {21#true} is VALID [2022-04-28 04:05:45,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret7 := main(); {21#true} is VALID [2022-04-28 04:05:45,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {21#true} is VALID [2022-04-28 04:05:45,373 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 04:05:45,374 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 04:05:45,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {22#false} is VALID [2022-04-28 04:05:45,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-28 04:05:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:05:45,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:05:45,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647879772] [2022-04-28 04:05:45,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647879772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:45,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:45,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:05:45,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:05:45,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [566921329] [2022-04-28 04:05:45,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [566921329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:45,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:45,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:05:45,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557913611] [2022-04-28 04:05:45,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:05:45,385 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 04:05:45,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:05:45,388 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 04:05:45,404 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 04:05:45,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 04:05:45,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:45,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 04:05:45,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 04:05:45,427 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 04:05:45,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:45,553 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-28 04:05:45,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 04:05:45,554 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 04:05:45,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:05:45,555 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 04:05:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-04-28 04:05:45,561 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 04:05:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-04-28 04:05:45,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2022-04-28 04:05:45,609 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 04:05:45,614 INFO L225 Difference]: With dead ends: 29 [2022-04-28 04:05:45,614 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 04:05:45,616 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 04:05:45,618 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 04:05:45,619 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 04:05:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 04:05:45,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 04:05:45,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:05:45,646 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 04:05:45,647 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 04:05:45,647 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 04:05:45,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:45,649 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 04:05:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 04:05:45,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:45,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:45,650 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 04:05:45,650 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 04:05:45,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:45,652 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 04:05:45,652 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 04:05:45,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:45,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:45,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:05:45,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:05:45,653 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 04:05:45,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 04:05:45,655 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2022-04-28 04:05:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:05:45,655 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 04:05:45,656 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 04:05:45,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 04:05:45,670 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 04:05:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 04:05:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 04:05:45,671 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:05:45,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:05:45,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:05:45,671 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:05:45,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:05:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1187666007, now seen corresponding path program 1 times [2022-04-28 04:05:45,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:45,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [932110112] [2022-04-28 04:05:45,690 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:05:45,690 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:05:45,690 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:05:45,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1187666007, now seen corresponding path program 2 times [2022-04-28 04:05:45,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:05:45,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462512663] [2022-04-28 04:05:45,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:45,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:05:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:45,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:05:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:45,774 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 04:05:45,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#true} assume true; {150#true} is VALID [2022-04-28 04:05:45,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {150#true} {150#true} #38#return; {150#true} is VALID [2022-04-28 04:05:45,775 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 04:05:45,776 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 04:05:45,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} assume true; {150#true} is VALID [2022-04-28 04:05:45,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150#true} {150#true} #38#return; {150#true} is VALID [2022-04-28 04:05:45,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {150#true} call #t~ret7 := main(); {150#true} is VALID [2022-04-28 04:05:45,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {150#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {150#true} is VALID [2022-04-28 04:05:45,777 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 04:05:45,777 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 04:05:45,778 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 04:05:45,779 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 04:05:45,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#false} assume !false; {151#false} is VALID [2022-04-28 04:05:45,779 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 04:05:45,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:05:45,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462512663] [2022-04-28 04:05:45,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462512663] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:05:45,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567266120] [2022-04-28 04:05:45,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:05:45,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:05:45,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:05:45,786 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 04:05:45,787 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 04:05:45,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:05:45,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:05:45,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 04:05:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:45,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:05:45,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {150#true} call ULTIMATE.init(); {150#true} is VALID [2022-04-28 04:05:45,909 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 04:05:45,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} assume true; {150#true} is VALID [2022-04-28 04:05:45,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150#true} {150#true} #38#return; {150#true} is VALID [2022-04-28 04:05:45,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {150#true} call #t~ret7 := main(); {150#true} is VALID [2022-04-28 04:05:45,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {150#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {150#true} is VALID [2022-04-28 04:05:45,909 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 04:05:45,910 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 04:05:45,910 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 04:05:45,911 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 04:05:45,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#false} assume !false; {151#false} is VALID [2022-04-28 04:05:45,912 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 04:05:45,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:05:46,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#false} assume !false; {151#false} is VALID [2022-04-28 04:05:46,240 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 04:05:46,240 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 04:05:46,243 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 04:05:46,244 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 04:05:46,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {150#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {150#true} is VALID [2022-04-28 04:05:46,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {150#true} call #t~ret7 := main(); {150#true} is VALID [2022-04-28 04:05:46,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150#true} {150#true} #38#return; {150#true} is VALID [2022-04-28 04:05:46,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} assume true; {150#true} is VALID [2022-04-28 04:05:46,245 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 04:05:46,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {150#true} call ULTIMATE.init(); {150#true} is VALID [2022-04-28 04:05:46,246 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 04:05:46,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567266120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:05:46,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:05:46,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 04:05:46,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:05:46,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [932110112] [2022-04-28 04:05:46,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [932110112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:46,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:46,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:05:46,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238881138] [2022-04-28 04:05:46,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:05:46,249 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 04:05:46,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:05:46,250 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 04:05:46,261 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 04:05:46,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:05:46,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:46,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:05:46,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:05:46,270 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 04:05:46,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:46,391 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 04:05:46,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:05:46,391 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 04:05:46,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:05:46,392 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 04:05:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-04-28 04:05:46,398 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 04:05:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-04-28 04:05:46,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2022-04-28 04:05:46,423 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 04:05:46,424 INFO L225 Difference]: With dead ends: 22 [2022-04-28 04:05:46,424 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 04:05:46,425 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 04:05:46,425 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 04:05:46,426 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 04:05:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 04:05:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-04-28 04:05:46,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:05:46,437 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 04:05:46,437 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 04:05:46,437 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 04:05:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:46,438 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 04:05:46,438 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 04:05:46,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:46,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:46,439 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 04:05:46,439 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 04:05:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:46,440 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 04:05:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 04:05:46,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:46,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:46,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:05:46,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:05:46,441 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 04:05:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-28 04:05:46,441 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2022-04-28 04:05:46,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:05:46,442 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-28 04:05:46,442 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 04:05:46,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-28 04:05:46,462 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 04:05:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 04:05:46,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:05:46,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:05:46,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:05:46,479 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 04:05:46,678 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 04:05:46,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:05:46,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:05:46,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1837062518, now seen corresponding path program 1 times [2022-04-28 04:05:46,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:46,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1325541106] [2022-04-28 04:05:46,689 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:05:46,689 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:05:46,689 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:05:46,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1837062518, now seen corresponding path program 2 times [2022-04-28 04:05:46,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:05:46,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790232374] [2022-04-28 04:05:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:46,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:05:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:46,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:05:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:46,774 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 04:05:46,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-28 04:05:46,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} #38#return; {348#true} is VALID [2022-04-28 04:05:46,775 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 04:05:46,775 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 04:05:46,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-28 04:05:46,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #38#return; {348#true} is VALID [2022-04-28 04:05:46,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret7 := main(); {348#true} is VALID [2022-04-28 04:05:46,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {348#true} is VALID [2022-04-28 04:05:46,776 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 04:05:46,777 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 04:05:46,778 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 04:05:46,778 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 04:05:46,779 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 04:05:46,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-28 04:05:46,779 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 04:05:46,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:05:46,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790232374] [2022-04-28 04:05:46,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790232374] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:05:46,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751541940] [2022-04-28 04:05:46,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:05:46,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:05:46,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:05:46,781 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 04:05:46,782 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 04:05:46,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:05:46,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:05:46,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 04:05:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:46,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:05:47,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-28 04:05:47,041 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 04:05:47,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-28 04:05:47,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #38#return; {348#true} is VALID [2022-04-28 04:05:47,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret7 := main(); {348#true} is VALID [2022-04-28 04:05:47,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {348#true} is VALID [2022-04-28 04:05:47,042 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 04:05:47,043 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 04:05:47,043 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 04:05:47,044 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 04:05:47,044 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 04:05:47,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-28 04:05:47,045 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 04:05:47,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:05:47,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-28 04:05:47,756 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 04:05:47,756 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 04:05:47,757 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 04:05:47,765 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 04:05:47,766 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 04:05:47,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {348#true} is VALID [2022-04-28 04:05:47,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret7 := main(); {348#true} is VALID [2022-04-28 04:05:47,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #38#return; {348#true} is VALID [2022-04-28 04:05:47,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-28 04:05:47,767 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 04:05:47,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-28 04:05:47,767 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 04:05:47,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751541940] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:05:47,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:05:47,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-28 04:05:47,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:05:47,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1325541106] [2022-04-28 04:05:47,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1325541106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:47,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:47,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:05:47,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470684420] [2022-04-28 04:05:47,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:05:47,771 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 04:05:47,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:05:47,772 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 04:05:47,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:47,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:05:47,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:47,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:05:47,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:05:47,782 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 04:05:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:47,860 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 04:05:47,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:05:47,860 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 04:05:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:05:47,861 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 04:05:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-28 04:05:47,862 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 04:05:47,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-28 04:05:47,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2022-04-28 04:05:47,879 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 04:05:47,880 INFO L225 Difference]: With dead ends: 20 [2022-04-28 04:05:47,880 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 04:05:47,880 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 04:05:47,881 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 04:05:47,881 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 04:05:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 04:05:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 04:05:47,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:05:47,893 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 04:05:47,893 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 04:05:47,893 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 04:05:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:47,898 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 04:05:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 04:05:47,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:47,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:47,899 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 04:05:47,899 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 04:05:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:47,900 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 04:05:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 04:05:47,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:47,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:47,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:05:47,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:05:47,901 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 04:05:47,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 04:05:47,902 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-04-28 04:05:47,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:05:47,902 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 04:05:47,903 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 04:05:47,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 04:05:47,915 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 04:05:47,915 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 04:05:47,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:05:47,916 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:05:47,916 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:05:47,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 04:05:48,131 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 04:05:48,132 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:05:48,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:05:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1837111337, now seen corresponding path program 3 times [2022-04-28 04:05:48,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:48,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1147879267] [2022-04-28 04:05:48,135 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:05:48,135 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:05:48,135 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:05:48,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1837111337, now seen corresponding path program 4 times [2022-04-28 04:05:48,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:05:48,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69560543] [2022-04-28 04:05:48,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:48,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:05:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:48,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:05:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:48,211 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 04:05:48,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {537#true} assume true; {537#true} is VALID [2022-04-28 04:05:48,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {537#true} {537#true} #38#return; {537#true} is VALID [2022-04-28 04:05:48,213 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 04:05:48,214 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 04:05:48,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {537#true} assume true; {537#true} is VALID [2022-04-28 04:05:48,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {537#true} {537#true} #38#return; {537#true} is VALID [2022-04-28 04:05:48,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {537#true} call #t~ret7 := main(); {537#true} is VALID [2022-04-28 04:05:48,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {537#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {537#true} is VALID [2022-04-28 04:05:48,215 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 04:05:48,215 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 04:05:48,216 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 04:05:48,217 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 04:05:48,217 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 04:05:48,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#false} assume !false; {538#false} is VALID [2022-04-28 04:05:48,218 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 04:05:48,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:05:48,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69560543] [2022-04-28 04:05:48,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69560543] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:05:48,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541603043] [2022-04-28 04:05:48,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:05:48,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:05:48,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:05:48,219 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 04:05:48,220 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 04:05:48,253 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:05:48,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:05:48,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:05:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:48,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:05:49,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {537#true} call ULTIMATE.init(); {537#true} is VALID [2022-04-28 04:05:49,137 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 04:05:49,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {537#true} assume true; {537#true} is VALID [2022-04-28 04:05:49,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {537#true} {537#true} #38#return; {537#true} is VALID [2022-04-28 04:05:49,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {537#true} call #t~ret7 := main(); {537#true} is VALID [2022-04-28 04:05:49,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {537#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {537#true} is VALID [2022-04-28 04:05:49,138 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 04:05:49,138 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 04:05:49,139 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 04:05:49,139 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 04:05:49,140 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 04:05:49,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#false} assume !false; {538#false} is VALID [2022-04-28 04:05:49,140 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 04:05:49,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:05:50,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#false} assume !false; {538#false} is VALID [2022-04-28 04:05:50,455 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 04:05:50,455 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 04:05:50,457 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 04:05:50,459 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 04:05:50,459 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 04:05:50,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {537#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {537#true} is VALID [2022-04-28 04:05:50,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {537#true} call #t~ret7 := main(); {537#true} is VALID [2022-04-28 04:05:50,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {537#true} {537#true} #38#return; {537#true} is VALID [2022-04-28 04:05:50,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {537#true} assume true; {537#true} is VALID [2022-04-28 04:05:50,460 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 04:05:50,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {537#true} call ULTIMATE.init(); {537#true} is VALID [2022-04-28 04:05:50,460 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 04:05:50,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541603043] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:05:50,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:05:50,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 04:05:50,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:05:50,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1147879267] [2022-04-28 04:05:50,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1147879267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:50,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:50,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:05:50,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672407911] [2022-04-28 04:05:50,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:05:50,461 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 04:05:50,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:05:50,462 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 04:05:50,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:50,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:05:50,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:50,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:05:50,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:05:50,471 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 04:05:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:50,584 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 04:05:50,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:05:50,584 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 04:05:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:05:50,584 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 04:05:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-28 04:05:50,585 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 04:05:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-28 04:05:50,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-04-28 04:05:50,602 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 04:05:50,603 INFO L225 Difference]: With dead ends: 23 [2022-04-28 04:05:50,603 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 04:05:50,603 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 04:05:50,603 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 04:05:50,604 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 04:05:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 04:05:50,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-04-28 04:05:50,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:05:50,613 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 04:05:50,613 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 04:05:50,614 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 04:05:50,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:50,614 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 04:05:50,614 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 04:05:50,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:50,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:50,615 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 04:05:50,615 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 04:05:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:50,616 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 04:05:50,616 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 04:05:50,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:50,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:50,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:05:50,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:05:50,617 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 04:05:50,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-28 04:05:50,617 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2022-04-28 04:05:50,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:05:50,617 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-28 04:05:50,617 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 04:05:50,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-28 04:05:50,633 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 04:05:50,633 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 04:05:50,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 04:05:50,633 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:05:50,633 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:05:50,652 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 04:05:50,833 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 04:05:50,834 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:05:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:05:50,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1115879670, now seen corresponding path program 3 times [2022-04-28 04:05:50,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:50,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [428057540] [2022-04-28 04:05:50,838 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:05:50,838 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:05:50,838 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:05:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1115879670, now seen corresponding path program 4 times [2022-04-28 04:05:50,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:05:50,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104420787] [2022-04-28 04:05:50,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:50,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:05:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:50,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:05:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:50,926 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 04:05:50,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {751#true} assume true; {751#true} is VALID [2022-04-28 04:05:50,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {751#true} {751#true} #38#return; {751#true} is VALID [2022-04-28 04:05:50,927 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 04:05:50,927 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 04:05:50,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {751#true} assume true; {751#true} is VALID [2022-04-28 04:05:50,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {751#true} {751#true} #38#return; {751#true} is VALID [2022-04-28 04:05:50,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {751#true} call #t~ret7 := main(); {751#true} is VALID [2022-04-28 04:05:50,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {751#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {751#true} is VALID [2022-04-28 04:05:50,928 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 04:05:50,928 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 04:05:50,929 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 04:05:50,929 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 04:05:50,930 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 04:05:50,930 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 04:05:50,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {752#false} assume !false; {752#false} is VALID [2022-04-28 04:05:50,931 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 04:05:50,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:05:50,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104420787] [2022-04-28 04:05:50,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104420787] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:05:50,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288194614] [2022-04-28 04:05:50,931 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:05:50,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:05:50,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:05:50,939 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 04:05:50,942 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 04:05:50,982 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:05:50,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:05:50,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:05:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:50,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:05:51,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {751#true} call ULTIMATE.init(); {751#true} is VALID [2022-04-28 04:05:51,318 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 04:05:51,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {751#true} assume true; {751#true} is VALID [2022-04-28 04:05:51,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {751#true} {751#true} #38#return; {751#true} is VALID [2022-04-28 04:05:51,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {751#true} call #t~ret7 := main(); {751#true} is VALID [2022-04-28 04:05:51,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {751#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {751#true} is VALID [2022-04-28 04:05:51,319 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 04:05:51,320 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 04:05:51,320 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 04:05:51,321 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 04:05:51,321 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 04:05:51,322 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 04:05:51,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {752#false} assume !false; {752#false} is VALID [2022-04-28 04:05:51,322 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 04:05:51,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:05:53,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {752#false} assume !false; {752#false} is VALID [2022-04-28 04:05:53,783 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 04:05:53,784 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 04:05:53,784 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 04:05:53,785 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 04:05:53,787 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 04:05:53,788 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 04:05:53,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {751#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {751#true} is VALID [2022-04-28 04:05:53,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {751#true} call #t~ret7 := main(); {751#true} is VALID [2022-04-28 04:05:53,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {751#true} {751#true} #38#return; {751#true} is VALID [2022-04-28 04:05:53,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {751#true} assume true; {751#true} is VALID [2022-04-28 04:05:53,789 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 04:05:53,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {751#true} call ULTIMATE.init(); {751#true} is VALID [2022-04-28 04:05:53,789 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 04:05:53,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288194614] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:05:53,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:05:53,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-04-28 04:05:53,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:05:53,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [428057540] [2022-04-28 04:05:53,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [428057540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:53,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:53,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:05:53,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338431007] [2022-04-28 04:05:53,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:05:53,790 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 04:05:53,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:05:53,790 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 04:05:53,800 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 04:05:53,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:05:53,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:53,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:05:53,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:05:53,801 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 04:05:53,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:53,897 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 04:05:53,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:05:53,897 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 04:05:53,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:05:53,898 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 04:05:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-28 04:05:53,898 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 04:05:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-28 04:05:53,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 21 transitions. [2022-04-28 04:05:53,912 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 04:05:53,913 INFO L225 Difference]: With dead ends: 21 [2022-04-28 04:05:53,913 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 04:05:53,914 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 04:05:53,917 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 04:05:53,917 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 04:05:53,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 04:05:53,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 04:05:53,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:05:53,930 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 04:05:53,930 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 04:05:53,930 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 04:05:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:53,934 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 04:05:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 04:05:53,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:53,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:53,953 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 04:05:53,953 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 04:05:53,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:53,954 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 04:05:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 04:05:53,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:53,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:53,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:05:53,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:05:53,954 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 04:05:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 04:05:53,955 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2022-04-28 04:05:53,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:05:53,955 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 04:05:53,955 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 04:05:53,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 04:05:53,973 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 04:05:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 04:05:53,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 04:05:53,974 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:05:53,974 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:05:53,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 04:05:54,174 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 04:05:54,174 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:05:54,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:05:54,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1115928489, now seen corresponding path program 5 times [2022-04-28 04:05:54,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:54,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [622773339] [2022-04-28 04:05:54,177 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:05:54,177 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:05:54,178 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:05:54,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1115928489, now seen corresponding path program 6 times [2022-04-28 04:05:54,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:05:54,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613896177] [2022-04-28 04:05:54,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:54,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:05:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:54,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:05:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:54,264 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 04:05:54,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {956#true} assume true; {956#true} is VALID [2022-04-28 04:05:54,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {956#true} {956#true} #38#return; {956#true} is VALID [2022-04-28 04:05:54,264 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 04:05:54,265 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 04:05:54,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {956#true} assume true; {956#true} is VALID [2022-04-28 04:05:54,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {956#true} {956#true} #38#return; {956#true} is VALID [2022-04-28 04:05:54,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {956#true} call #t~ret7 := main(); {956#true} is VALID [2022-04-28 04:05:54,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {956#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {956#true} is VALID [2022-04-28 04:05:54,266 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 04:05:54,267 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 04:05:54,268 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 04:05:54,268 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 04:05:54,269 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 04:05:54,271 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 04:05:54,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {957#false} assume !false; {957#false} is VALID [2022-04-28 04:05:54,271 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 04:05:54,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:05:54,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613896177] [2022-04-28 04:05:54,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613896177] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:05:54,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983594242] [2022-04-28 04:05:54,272 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:05:54,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:05:54,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:05:54,273 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 04:05:54,274 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 04:05:54,314 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 04:05:54,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:05:54,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:05:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:54,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:05:55,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {956#true} call ULTIMATE.init(); {956#true} is VALID [2022-04-28 04:05:55,363 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 04:05:55,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {956#true} assume true; {956#true} is VALID [2022-04-28 04:05:55,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {956#true} {956#true} #38#return; {956#true} is VALID [2022-04-28 04:05:55,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {956#true} call #t~ret7 := main(); {956#true} is VALID [2022-04-28 04:05:55,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {956#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {956#true} is VALID [2022-04-28 04:05:55,367 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 04:05:55,368 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 04:05:55,368 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 04:05:55,369 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 04:05:55,370 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 04:05:55,370 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 04:05:55,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {957#false} assume !false; {957#false} is VALID [2022-04-28 04:05:55,370 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 04:05:55,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:05:57,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {957#false} assume !false; {957#false} is VALID [2022-04-28 04:05:57,565 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 04:05:57,566 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 04:05:58,096 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 04:05:58,099 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 04:05:58,105 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 04:05:58,106 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 04:05:58,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {956#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {956#true} is VALID [2022-04-28 04:05:58,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {956#true} call #t~ret7 := main(); {956#true} is VALID [2022-04-28 04:05:58,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {956#true} {956#true} #38#return; {956#true} is VALID [2022-04-28 04:05:58,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {956#true} assume true; {956#true} is VALID [2022-04-28 04:05:58,107 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 04:05:58,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {956#true} call ULTIMATE.init(); {956#true} is VALID [2022-04-28 04:05:58,107 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 04:05:58,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983594242] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:05:58,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:05:58,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 04:05:58,108 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:05:58,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [622773339] [2022-04-28 04:05:58,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [622773339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:58,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:58,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:05:58,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236877549] [2022-04-28 04:05:58,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:05:58,108 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 04:05:58,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:05:58,109 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 04:05:58,118 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 04:05:58,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:05:58,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:58,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:05:58,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:05:58,119 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 04:05:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:58,282 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 04:05:58,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:05:58,282 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 04:05:58,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:05:58,282 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 04:05:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-04-28 04:05:58,283 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 04:05:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-04-28 04:05:58,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2022-04-28 04:05:58,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:58,312 INFO L225 Difference]: With dead ends: 24 [2022-04-28 04:05:58,312 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 04:05:58,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2022-04-28 04:05:58,313 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 04:05:58,313 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 04:05:58,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 04:05:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-04-28 04:05:58,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:05:58,335 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 04:05:58,335 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 04:05:58,335 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 04:05:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:58,336 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 04:05:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 04:05:58,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:58,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:58,337 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 04:05:58,337 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 04:05:58,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:58,338 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 04:05:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 04:05:58,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:58,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:58,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:05:58,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:05:58,338 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 04:05:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-28 04:05:58,339 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2022-04-28 04:05:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:05:58,339 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-28 04:05:58,339 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 04:05:58,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-28 04:05:58,358 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 04:05:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 04:05:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 04:05:58,358 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:05:58,358 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:05:58,375 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 04:05:58,574 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 04:05:58,574 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:05:58,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:05:58,575 INFO L85 PathProgramCache]: Analyzing trace with hash 234047862, now seen corresponding path program 5 times [2022-04-28 04:05:58,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:58,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1002338327] [2022-04-28 04:05:58,577 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:05:58,577 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:05:58,577 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:05:58,577 INFO L85 PathProgramCache]: Analyzing trace with hash 234047862, now seen corresponding path program 6 times [2022-04-28 04:05:58,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:05:58,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279135041] [2022-04-28 04:05:58,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:58,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:05:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:58,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:05:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:58,700 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 04:05:58,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {1186#true} assume true; {1186#true} is VALID [2022-04-28 04:05:58,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1186#true} {1186#true} #38#return; {1186#true} is VALID [2022-04-28 04:05:58,701 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 04:05:58,701 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 04:05:58,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {1186#true} assume true; {1186#true} is VALID [2022-04-28 04:05:58,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1186#true} {1186#true} #38#return; {1186#true} is VALID [2022-04-28 04:05:58,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {1186#true} call #t~ret7 := main(); {1186#true} is VALID [2022-04-28 04:05:58,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {1186#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1186#true} is VALID [2022-04-28 04:05:58,702 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 04:05:58,703 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 04:05:58,704 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 04:05:58,704 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 04:05:58,705 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 04:05:58,705 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 04:05:58,706 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 04:05:58,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {1187#false} assume !false; {1187#false} is VALID [2022-04-28 04:05:58,706 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 04:05:58,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:05:58,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279135041] [2022-04-28 04:05:58,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279135041] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:05:58,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556903358] [2022-04-28 04:05:58,706 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:05:58,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:05:58,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:05:58,707 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 04:05:58,709 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 04:05:58,747 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 04:05:58,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:05:58,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:05:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:58,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:05:59,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {1186#true} call ULTIMATE.init(); {1186#true} is VALID [2022-04-28 04:05:59,252 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 04:05:59,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {1186#true} assume true; {1186#true} is VALID [2022-04-28 04:05:59,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1186#true} {1186#true} #38#return; {1186#true} is VALID [2022-04-28 04:05:59,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {1186#true} call #t~ret7 := main(); {1186#true} is VALID [2022-04-28 04:05:59,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {1186#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1186#true} is VALID [2022-04-28 04:05:59,253 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 04:05:59,254 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 04:05:59,254 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 04:05:59,255 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 04:05:59,255 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 04:05:59,256 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 04:05:59,257 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 04:05:59,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {1187#false} assume !false; {1187#false} is VALID [2022-04-28 04:05:59,257 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 04:05:59,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:06:04,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {1187#false} assume !false; {1187#false} is VALID [2022-04-28 04:06:04,554 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 04:06:04,555 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 04:06:04,555 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 04:06:04,560 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 04:06:04,561 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 04:06:04,576 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 04:06:04,576 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 04:06:04,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {1186#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1186#true} is VALID [2022-04-28 04:06:04,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {1186#true} call #t~ret7 := main(); {1186#true} is VALID [2022-04-28 04:06:04,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1186#true} {1186#true} #38#return; {1186#true} is VALID [2022-04-28 04:06:04,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {1186#true} assume true; {1186#true} is VALID [2022-04-28 04:06:04,577 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 04:06:04,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {1186#true} call ULTIMATE.init(); {1186#true} is VALID [2022-04-28 04:06:04,577 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 04:06:04,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556903358] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:06:04,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:06:04,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-04-28 04:06:04,578 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:06:04,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1002338327] [2022-04-28 04:06:04,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1002338327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:04,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:04,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:06:04,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111445622] [2022-04-28 04:06:04,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:06:04,578 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 04:06:04,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:06:04,579 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 04:06:04,588 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 04:06:04,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:06:04,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:04,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:06:04,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:06:04,589 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 04:06:04,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:04,708 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 04:06:04,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:06:04,708 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 04:06:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:06:04,708 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 04:06:04,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2022-04-28 04:06:04,709 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 04:06:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2022-04-28 04:06:04,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 22 transitions. [2022-04-28 04:06:04,726 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 04:06:04,727 INFO L225 Difference]: With dead ends: 22 [2022-04-28 04:06:04,727 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 04:06:04,727 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 04:06:04,727 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 04:06:04,728 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 04:06:04,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 04:06:04,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 04:06:04,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:06:04,739 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 04:06:04,740 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 04:06:04,740 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 04:06:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:04,742 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 04:06:04,742 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 04:06:04,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:04,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:04,742 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 04:06:04,742 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 04:06:04,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:04,743 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 04:06:04,743 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 04:06:04,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:04,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:04,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:06:04,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:06:04,743 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 04:06:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-28 04:06:04,744 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2022-04-28 04:06:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:06:04,744 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-28 04:06:04,744 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 04:06:04,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-28 04:06:04,758 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 04:06:04,759 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 04:06:04,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 04:06:04,759 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:06:04,759 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:06:04,774 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 04:06:04,963 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 04:06:04,963 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:06:04,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:06:04,964 INFO L85 PathProgramCache]: Analyzing trace with hash 234096681, now seen corresponding path program 7 times [2022-04-28 04:06:04,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:04,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [475937113] [2022-04-28 04:06:04,979 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:06:04,979 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:06:04,979 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:06:04,979 INFO L85 PathProgramCache]: Analyzing trace with hash 234096681, now seen corresponding path program 8 times [2022-04-28 04:06:04,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:04,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886973138] [2022-04-28 04:06:04,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:04,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:05,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:05,091 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 04:06:05,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {1407#true} assume true; {1407#true} is VALID [2022-04-28 04:06:05,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1407#true} {1407#true} #38#return; {1407#true} is VALID [2022-04-28 04:06:05,092 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 04:06:05,092 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 04:06:05,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {1407#true} assume true; {1407#true} is VALID [2022-04-28 04:06:05,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1407#true} {1407#true} #38#return; {1407#true} is VALID [2022-04-28 04:06:05,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {1407#true} call #t~ret7 := main(); {1407#true} is VALID [2022-04-28 04:06:05,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {1407#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1407#true} is VALID [2022-04-28 04:06:05,093 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 04:06:05,094 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 04:06:05,094 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 04:06:05,095 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 04:06:05,096 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 04:06:05,096 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 04:06:05,097 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 04:06:05,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {1408#false} assume !false; {1408#false} is VALID [2022-04-28 04:06:05,097 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 04:06:05,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:05,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886973138] [2022-04-28 04:06:05,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886973138] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:06:05,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209842321] [2022-04-28 04:06:05,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:06:05,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:06:05,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:06:05,098 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 04:06:05,099 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 04:06:05,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:06:05,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:06:05,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 04:06:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:05,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:06:06,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {1407#true} call ULTIMATE.init(); {1407#true} is VALID [2022-04-28 04:06:06,342 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 04:06:06,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {1407#true} assume true; {1407#true} is VALID [2022-04-28 04:06:06,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1407#true} {1407#true} #38#return; {1407#true} is VALID [2022-04-28 04:06:06,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {1407#true} call #t~ret7 := main(); {1407#true} is VALID [2022-04-28 04:06:06,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {1407#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1407#true} is VALID [2022-04-28 04:06:06,343 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 04:06:06,344 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 04:06:06,344 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 04:06:06,345 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 04:06:06,345 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 04:06:06,346 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 04:06:06,346 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 04:06:06,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {1408#false} assume !false; {1408#false} is VALID [2022-04-28 04:06:06,347 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 04:06:06,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:06:11,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {1408#false} assume !false; {1408#false} is VALID [2022-04-28 04:06:11,888 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 04:06:11,889 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 04:06:11,900 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 04:06:11,902 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 04:06:11,903 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 04:06:11,905 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 04:06:11,905 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 04:06:11,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {1407#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1407#true} is VALID [2022-04-28 04:06:11,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {1407#true} call #t~ret7 := main(); {1407#true} is VALID [2022-04-28 04:06:11,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1407#true} {1407#true} #38#return; {1407#true} is VALID [2022-04-28 04:06:11,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {1407#true} assume true; {1407#true} is VALID [2022-04-28 04:06:11,906 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 04:06:11,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {1407#true} call ULTIMATE.init(); {1407#true} is VALID [2022-04-28 04:06:11,906 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 04:06:11,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209842321] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:06:11,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:06:11,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 04:06:11,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:06:11,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [475937113] [2022-04-28 04:06:11,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [475937113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:11,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:11,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:06:11,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120823668] [2022-04-28 04:06:11,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:06:11,907 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 04:06:11,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:06:11,907 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 04:06:11,919 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 04:06:11,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:06:11,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:11,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:06:11,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-28 04:06:11,920 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 04:06:12,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:12,087 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 04:06:12,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:06:12,087 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 04:06:12,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:06:12,087 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 04:06:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2022-04-28 04:06:12,088 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 04:06:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2022-04-28 04:06:12,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 25 transitions. [2022-04-28 04:06:12,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:06:12,110 INFO L225 Difference]: With dead ends: 25 [2022-04-28 04:06:12,110 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 04:06:12,111 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 04:06:12,111 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 04:06:12,111 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 04:06:12,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 04:06:12,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-04-28 04:06:12,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:06:12,126 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 04:06:12,126 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 04:06:12,126 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 04:06:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:12,126 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 04:06:12,127 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 04:06:12,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:12,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:12,127 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 04:06:12,127 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 04:06:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:12,128 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 04:06:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 04:06:12,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:12,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:12,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:06:12,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:06:12,128 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 04:06:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-04-28 04:06:12,129 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2022-04-28 04:06:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:06:12,129 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-04-28 04:06:12,129 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 04:06:12,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2022-04-28 04:06:12,151 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 04:06:12,151 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-28 04:06:12,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 04:06:12,151 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:06:12,151 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:06:12,168 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 04:06:12,352 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 04:06:12,352 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:06:12,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:06:12,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1332934410, now seen corresponding path program 7 times [2022-04-28 04:06:12,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:12,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [525267260] [2022-04-28 04:06:12,354 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:06:12,354 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:06:12,355 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:06:12,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1332934410, now seen corresponding path program 8 times [2022-04-28 04:06:12,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:12,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361960042] [2022-04-28 04:06:12,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:12,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:12,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:12,458 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 04:06:12,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {1653#true} assume true; {1653#true} is VALID [2022-04-28 04:06:12,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1653#true} {1653#true} #38#return; {1653#true} is VALID [2022-04-28 04:06:12,458 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 04:06:12,458 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 04:06:12,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {1653#true} assume true; {1653#true} is VALID [2022-04-28 04:06:12,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1653#true} {1653#true} #38#return; {1653#true} is VALID [2022-04-28 04:06:12,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {1653#true} call #t~ret7 := main(); {1653#true} is VALID [2022-04-28 04:06:12,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {1653#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1653#true} is VALID [2022-04-28 04:06:12,459 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 04:06:12,460 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 04:06:12,461 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 04:06:12,461 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 04:06:12,462 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 04:06:12,462 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 04:06:12,463 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 04:06:12,465 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 04:06:12,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#false} assume !false; {1654#false} is VALID [2022-04-28 04:06:12,465 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 04:06:12,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:12,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361960042] [2022-04-28 04:06:12,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361960042] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:06:12,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375189420] [2022-04-28 04:06:12,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:06:12,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:06:12,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:06:12,481 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 04:06:12,481 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 04:06:12,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:06:12,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:06:12,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 04:06:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:12,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:06:13,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {1653#true} call ULTIMATE.init(); {1653#true} is VALID [2022-04-28 04:06:13,158 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 04:06:13,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {1653#true} assume true; {1653#true} is VALID [2022-04-28 04:06:13,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1653#true} {1653#true} #38#return; {1653#true} is VALID [2022-04-28 04:06:13,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {1653#true} call #t~ret7 := main(); {1653#true} is VALID [2022-04-28 04:06:13,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {1653#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1653#true} is VALID [2022-04-28 04:06:13,159 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 04:06:13,159 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 04:06:13,160 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 04:06:13,160 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 04:06:13,161 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 04:06:13,161 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 04:06:13,162 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 04:06:13,162 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 04:06:13,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#false} assume !false; {1654#false} is VALID [2022-04-28 04:06:13,162 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 04:06:13,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:06:19,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#false} assume !false; {1654#false} is VALID [2022-04-28 04:06:19,146 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 04:06:19,146 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 04:06:19,147 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 04:06:19,153 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 04:06:19,155 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 04:06:19,160 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 04:06:19,164 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 04:06:19,165 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 04:06:19,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {1653#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1653#true} is VALID [2022-04-28 04:06:19,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {1653#true} call #t~ret7 := main(); {1653#true} is VALID [2022-04-28 04:06:19,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1653#true} {1653#true} #38#return; {1653#true} is VALID [2022-04-28 04:06:19,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {1653#true} assume true; {1653#true} is VALID [2022-04-28 04:06:19,165 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 04:06:19,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {1653#true} call ULTIMATE.init(); {1653#true} is VALID [2022-04-28 04:06:19,166 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 04:06:19,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375189420] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:06:19,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:06:19,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-28 04:06:19,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:06:19,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [525267260] [2022-04-28 04:06:19,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [525267260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:19,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:19,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:06:19,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157889904] [2022-04-28 04:06:19,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:06:19,167 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 04:06:19,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:06:19,167 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 04:06:19,179 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 04:06:19,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:06:19,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:19,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:06:19,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:06:19,180 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 04:06:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:19,291 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 04:06:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:06:19,291 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 04:06:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:06:19,291 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 04:06:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2022-04-28 04:06:19,292 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 04:06:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2022-04-28 04:06:19,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 23 transitions. [2022-04-28 04:06:19,311 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 04:06:19,311 INFO L225 Difference]: With dead ends: 23 [2022-04-28 04:06:19,311 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 04:06:19,312 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 04:06:19,312 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 04:06:19,312 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 04:06:19,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 04:06:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 04:06:19,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:06:19,324 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 04:06:19,324 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 04:06:19,324 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 04:06:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:19,325 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 04:06:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 04:06:19,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:19,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:19,325 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 04:06:19,325 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 04:06:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:19,326 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 04:06:19,326 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 04:06:19,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:19,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:19,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:06:19,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:06:19,326 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 04:06:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-28 04:06:19,327 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2022-04-28 04:06:19,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:06:19,327 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-28 04:06:19,327 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 04:06:19,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-28 04:06:19,342 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 04:06:19,343 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 04:06:19,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 04:06:19,343 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:06:19,343 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:06:19,346 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 04:06:19,543 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 04:06:19,544 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:06:19,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:06:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1332885591, now seen corresponding path program 9 times [2022-04-28 04:06:19,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:19,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1020422911] [2022-04-28 04:06:19,546 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:06:19,546 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:06:19,546 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:06:19,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1332885591, now seen corresponding path program 10 times [2022-04-28 04:06:19,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:19,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073908160] [2022-04-28 04:06:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:19,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:19,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:19,636 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 04:06:19,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-28 04:06:19,636 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1890#true} {1890#true} #38#return; {1890#true} is VALID [2022-04-28 04:06:19,637 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 04:06:19,637 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 04:06:19,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-28 04:06:19,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1890#true} {1890#true} #38#return; {1890#true} is VALID [2022-04-28 04:06:19,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {1890#true} call #t~ret7 := main(); {1890#true} is VALID [2022-04-28 04:06:19,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {1890#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1890#true} is VALID [2022-04-28 04:06:19,637 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 04:06:19,638 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 04:06:19,638 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 04:06:19,639 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 04:06:19,640 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 04:06:19,640 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 04:06:19,641 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 04:06:19,642 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 04:06:19,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {1891#false} assume !false; {1891#false} is VALID [2022-04-28 04:06:19,642 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 04:06:19,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:19,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073908160] [2022-04-28 04:06:19,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073908160] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:06:19,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830405790] [2022-04-28 04:06:19,642 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:06:19,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:06:19,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:06:19,643 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 04:06:19,644 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 04:06:19,679 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:06:19,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:06:19,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 04:06:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:19,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:06:20,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {1890#true} call ULTIMATE.init(); {1890#true} is VALID [2022-04-28 04:06:20,978 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 04:06:20,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-28 04:06:20,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1890#true} {1890#true} #38#return; {1890#true} is VALID [2022-04-28 04:06:20,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {1890#true} call #t~ret7 := main(); {1890#true} is VALID [2022-04-28 04:06:20,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {1890#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1890#true} is VALID [2022-04-28 04:06:20,979 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 04:06:20,980 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 04:06:20,980 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 04:06:20,981 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 04:06:20,981 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 04:06:20,984 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 04:06:20,986 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 04:06:20,993 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 04:06:20,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {1891#false} assume !false; {1891#false} is VALID [2022-04-28 04:06:20,993 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 04:06:20,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:06:24,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {1891#false} assume !false; {1891#false} is VALID [2022-04-28 04:06:24,520 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 04:06:24,521 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 04:06:24,537 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 04:06:24,540 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 04:06:24,543 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 04:06:24,544 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 04:06:24,545 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 04:06:24,546 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 04:06:24,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {1890#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1890#true} is VALID [2022-04-28 04:06:24,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {1890#true} call #t~ret7 := main(); {1890#true} is VALID [2022-04-28 04:06:24,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1890#true} {1890#true} #38#return; {1890#true} is VALID [2022-04-28 04:06:24,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-28 04:06:24,547 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 04:06:24,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {1890#true} call ULTIMATE.init(); {1890#true} is VALID [2022-04-28 04:06:24,547 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 04:06:24,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830405790] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:06:24,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:06:24,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 04:06:24,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:06:24,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1020422911] [2022-04-28 04:06:24,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1020422911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:24,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:24,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:06:24,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712815924] [2022-04-28 04:06:24,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:06:24,548 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 04:06:24,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:06:24,548 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 04:06:24,558 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 04:06:24,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 04:06:24,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:24,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 04:06:24,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-04-28 04:06:24,559 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 04:06:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:24,753 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 04:06:24,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:06:24,753 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 04:06:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:06:24,754 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 04:06:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-04-28 04:06:24,754 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 04:06:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-04-28 04:06:24,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 26 transitions. [2022-04-28 04:06:24,803 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 04:06:24,804 INFO L225 Difference]: With dead ends: 26 [2022-04-28 04:06:24,804 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 04:06:24,804 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 04:06:24,805 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 04:06:24,805 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 04:06:24,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 04:06:24,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-04-28 04:06:24,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:06:24,827 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 04:06:24,828 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 04:06:24,833 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 04:06:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:24,835 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 04:06:24,835 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 04:06:24,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:24,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:24,835 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 04:06:24,836 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 04:06:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:24,836 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 04:06:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 04:06:24,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:24,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:24,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:06:24,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:06:24,837 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 04:06:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-28 04:06:24,837 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2022-04-28 04:06:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:06:24,837 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-28 04:06:24,837 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 04:06:24,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-28 04:06:24,856 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 04:06:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-28 04:06:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 04:06:24,856 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:06:24,857 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:06:24,872 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 04:06:25,057 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 04:06:25,058 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:06:25,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:06:25,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1630222710, now seen corresponding path program 9 times [2022-04-28 04:06:25,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:25,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1993723986] [2022-04-28 04:06:25,060 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:06:25,060 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:06:25,060 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:06:25,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1630222710, now seen corresponding path program 10 times [2022-04-28 04:06:25,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:25,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907522392] [2022-04-28 04:06:25,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:25,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:25,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:25,160 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 04:06:25,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {2152#true} assume true; {2152#true} is VALID [2022-04-28 04:06:25,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2152#true} {2152#true} #38#return; {2152#true} is VALID [2022-04-28 04:06:25,161 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 04:06:25,161 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 04:06:25,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {2152#true} assume true; {2152#true} is VALID [2022-04-28 04:06:25,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2152#true} {2152#true} #38#return; {2152#true} is VALID [2022-04-28 04:06:25,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {2152#true} call #t~ret7 := main(); {2152#true} is VALID [2022-04-28 04:06:25,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {2152#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2152#true} is VALID [2022-04-28 04:06:25,161 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 04:06:25,162 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 04:06:25,163 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 04:06:25,163 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 04:06:25,164 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 04:06:25,165 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 04:06:25,165 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 04:06:25,165 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 04:06:25,166 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 04:06:25,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {2153#false} assume !false; {2153#false} is VALID [2022-04-28 04:06:25,166 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 04:06:25,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:25,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907522392] [2022-04-28 04:06:25,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907522392] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:06:25,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15589751] [2022-04-28 04:06:25,167 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:06:25,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:06:25,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:06:25,168 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 04:06:25,187 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 04:06:25,209 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:06:25,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:06:25,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 04:06:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:25,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:06:25,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {2152#true} call ULTIMATE.init(); {2152#true} is VALID [2022-04-28 04:06:25,985 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 04:06:25,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {2152#true} assume true; {2152#true} is VALID [2022-04-28 04:06:25,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2152#true} {2152#true} #38#return; {2152#true} is VALID [2022-04-28 04:06:25,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {2152#true} call #t~ret7 := main(); {2152#true} is VALID [2022-04-28 04:06:25,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {2152#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2152#true} is VALID [2022-04-28 04:06:25,985 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 04:06:25,986 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 04:06:25,986 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 04:06:25,987 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 04:06:25,988 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 04:06:25,988 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 04:06:25,989 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 04:06:25,989 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 04:06:25,989 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 04:06:25,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {2153#false} assume !false; {2153#false} is VALID [2022-04-28 04:06:25,990 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 04:06:25,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:06:34,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {2153#false} assume !false; {2153#false} is VALID [2022-04-28 04:06:34,167 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 04:06:34,167 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 04:06:34,167 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 04:06:34,169 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 04:06:34,184 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 04:06:34,186 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 04:06:34,200 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 04:06:34,221 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 04:06:34,221 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 04:06:34,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {2152#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2152#true} is VALID [2022-04-28 04:06:34,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {2152#true} call #t~ret7 := main(); {2152#true} is VALID [2022-04-28 04:06:34,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2152#true} {2152#true} #38#return; {2152#true} is VALID [2022-04-28 04:06:34,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {2152#true} assume true; {2152#true} is VALID [2022-04-28 04:06:34,222 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 04:06:34,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {2152#true} call ULTIMATE.init(); {2152#true} is VALID [2022-04-28 04:06:34,222 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 04:06:34,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15589751] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:06:34,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:06:34,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-28 04:06:34,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:06:34,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1993723986] [2022-04-28 04:06:34,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1993723986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:34,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:34,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:06:34,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242965422] [2022-04-28 04:06:34,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:06:34,223 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 04:06:34,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:06:34,223 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 04:06:34,233 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 04:06:34,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 04:06:34,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:34,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 04:06:34,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2022-04-28 04:06:34,234 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 04:06:34,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:34,388 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 04:06:34,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:06:34,388 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 04:06:34,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:06:34,388 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 04:06:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-28 04:06:34,389 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 04:06:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-28 04:06:34,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 24 transitions. [2022-04-28 04:06:34,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:06:34,412 INFO L225 Difference]: With dead ends: 24 [2022-04-28 04:06:34,412 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 04:06:34,413 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 04:06:34,415 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 04:06:34,415 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 04:06:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 04:06:34,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 04:06:34,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:06:34,432 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 04:06:34,432 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 04:06:34,432 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 04:06:34,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:34,437 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 04:06:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 04:06:34,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:34,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:34,437 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 04:06:34,437 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 04:06:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:34,439 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 04:06:34,439 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 04:06:34,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:34,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:34,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:06:34,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:06:34,440 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 04:06:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-28 04:06:34,440 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2022-04-28 04:06:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:06:34,441 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-28 04:06:34,441 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 04:06:34,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-28 04:06:34,457 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 04:06:34,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 04:06:34,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 04:06:34,458 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:06:34,458 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:06:34,474 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 04:06:34,658 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 04:06:34,658 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:06:34,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:06:34,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1630271529, now seen corresponding path program 11 times [2022-04-28 04:06:34,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:34,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1249795128] [2022-04-28 04:06:34,661 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:06:34,661 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:06:34,661 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:06:34,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1630271529, now seen corresponding path program 12 times [2022-04-28 04:06:34,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:34,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100841842] [2022-04-28 04:06:34,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:34,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:34,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:34,769 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 04:06:34,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {2405#true} assume true; {2405#true} is VALID [2022-04-28 04:06:34,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2405#true} {2405#true} #38#return; {2405#true} is VALID [2022-04-28 04:06:34,769 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 04:06:34,769 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 04:06:34,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {2405#true} assume true; {2405#true} is VALID [2022-04-28 04:06:34,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2405#true} {2405#true} #38#return; {2405#true} is VALID [2022-04-28 04:06:34,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {2405#true} call #t~ret7 := main(); {2405#true} is VALID [2022-04-28 04:06:34,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {2405#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2405#true} is VALID [2022-04-28 04:06:34,770 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 04:06:34,771 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 04:06:34,771 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 04:06:34,772 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 04:06:34,773 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 04:06:34,773 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 04:06:34,774 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 04:06:34,774 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 04:06:34,775 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 04:06:34,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {2406#false} assume !false; {2406#false} is VALID [2022-04-28 04:06:34,775 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 04:06:34,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:34,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100841842] [2022-04-28 04:06:34,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100841842] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:06:34,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377196022] [2022-04-28 04:06:34,776 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:06:34,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:06:34,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:06:34,777 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 04:06:34,798 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 04:06:34,845 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 04:06:34,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:06:34,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 04:06:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:34,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:06:36,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {2405#true} call ULTIMATE.init(); {2405#true} is VALID [2022-04-28 04:06:36,284 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 04:06:36,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {2405#true} assume true; {2405#true} is VALID [2022-04-28 04:06:36,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2405#true} {2405#true} #38#return; {2405#true} is VALID [2022-04-28 04:06:36,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {2405#true} call #t~ret7 := main(); {2405#true} is VALID [2022-04-28 04:06:36,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {2405#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2405#true} is VALID [2022-04-28 04:06:36,285 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 04:06:36,286 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 04:06:36,286 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 04:06:36,287 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 04:06:36,288 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 04:06:36,288 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 04:06:36,289 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 04:06:36,289 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 04:06:36,290 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 04:06:36,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {2406#false} assume !false; {2406#false} is VALID [2022-04-28 04:06:36,290 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 04:06:36,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:06:44,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {2406#false} assume !false; {2406#false} is VALID [2022-04-28 04:06:44,058 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 04:06:44,059 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 04:06:44,060 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 04:06:44,069 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 04:06:44,076 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 04:06:44,078 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 04:06:44,080 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 04:06:44,092 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 04:06:44,092 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 04:06:44,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {2405#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2405#true} is VALID [2022-04-28 04:06:44,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {2405#true} call #t~ret7 := main(); {2405#true} is VALID [2022-04-28 04:06:44,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2405#true} {2405#true} #38#return; {2405#true} is VALID [2022-04-28 04:06:44,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {2405#true} assume true; {2405#true} is VALID [2022-04-28 04:06:44,093 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 04:06:44,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {2405#true} call ULTIMATE.init(); {2405#true} is VALID [2022-04-28 04:06:44,093 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 04:06:44,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377196022] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:06:44,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:06:44,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 04:06:44,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:06:44,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1249795128] [2022-04-28 04:06:44,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1249795128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:44,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:44,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 04:06:44,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130101158] [2022-04-28 04:06:44,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:06:44,094 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 04:06:44,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:06:44,094 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 04:06:44,104 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 04:06:44,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 04:06:44,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:44,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 04:06:44,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2022-04-28 04:06:44,105 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 04:06:44,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:44,340 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 04:06:44,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 04:06:44,341 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 04:06:44,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:06:44,341 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 04:06:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2022-04-28 04:06:44,341 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 04:06:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2022-04-28 04:06:44,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 27 transitions. [2022-04-28 04:06:44,365 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 04:06:44,366 INFO L225 Difference]: With dead ends: 27 [2022-04-28 04:06:44,366 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 04:06:44,366 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 04:06:44,370 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 04:06:44,370 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 04:06:44,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 04:06:44,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-28 04:06:44,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:06:44,389 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 04:06:44,389 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 04:06:44,389 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 04:06:44,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:44,390 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 04:06:44,390 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 04:06:44,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:44,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:44,390 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 04:06:44,390 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 04:06:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:44,391 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 04:06:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 04:06:44,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:44,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:44,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:06:44,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:06:44,391 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 04:06:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-28 04:06:44,392 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2022-04-28 04:06:44,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:06:44,392 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-28 04:06:44,392 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 04:06:44,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-28 04:06:44,418 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 04:06:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 04:06:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 04:06:44,418 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:06:44,418 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:06:44,435 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 04:06:44,623 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 04:06:44,623 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:06:44,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:06:44,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1001187082, now seen corresponding path program 11 times [2022-04-28 04:06:44,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:44,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1156418085] [2022-04-28 04:06:44,626 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:06:44,626 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:06:44,626 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:06:44,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1001187082, now seen corresponding path program 12 times [2022-04-28 04:06:44,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:44,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286848673] [2022-04-28 04:06:44,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:44,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:44,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:44,735 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 04:06:44,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {2683#true} assume true; {2683#true} is VALID [2022-04-28 04:06:44,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2683#true} {2683#true} #38#return; {2683#true} is VALID [2022-04-28 04:06:44,736 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 04:06:44,736 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 04:06:44,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {2683#true} assume true; {2683#true} is VALID [2022-04-28 04:06:44,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2683#true} {2683#true} #38#return; {2683#true} is VALID [2022-04-28 04:06:44,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {2683#true} call #t~ret7 := main(); {2683#true} is VALID [2022-04-28 04:06:44,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {2683#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2683#true} is VALID [2022-04-28 04:06:44,736 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 04:06:44,737 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 04:06:44,738 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 04:06:44,738 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 04:06:44,739 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 04:06:44,740 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 04:06:44,740 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 04:06:44,741 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 04:06:44,741 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 04:06:44,742 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 04:06:44,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {2684#false} assume !false; {2684#false} is VALID [2022-04-28 04:06:44,742 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 04:06:44,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:44,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286848673] [2022-04-28 04:06:44,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286848673] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:06:44,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620130664] [2022-04-28 04:06:44,742 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:06:44,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:06:44,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:06:44,743 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 04:06:44,744 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 04:06:44,791 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 04:06:44,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:06:44,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 04:06:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:44,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:06:45,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {2683#true} call ULTIMATE.init(); {2683#true} is VALID [2022-04-28 04:06:45,722 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 04:06:45,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {2683#true} assume true; {2683#true} is VALID [2022-04-28 04:06:45,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2683#true} {2683#true} #38#return; {2683#true} is VALID [2022-04-28 04:06:45,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {2683#true} call #t~ret7 := main(); {2683#true} is VALID [2022-04-28 04:06:45,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {2683#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2683#true} is VALID [2022-04-28 04:06:45,723 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 04:06:45,724 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 04:06:45,724 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 04:06:45,725 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 04:06:45,726 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 04:06:45,726 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 04:06:45,727 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 04:06:45,727 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 04:06:45,728 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 04:06:45,728 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 04:06:45,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {2684#false} assume !false; {2684#false} is VALID [2022-04-28 04:06:45,729 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 04:06:45,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:06:56,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {2684#false} assume !false; {2684#false} is VALID [2022-04-28 04:06:56,824 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 04:06:56,824 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 04:06:56,825 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 04:06:56,826 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 04:06:56,828 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 04:06:56,829 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 04:06:56,831 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 04:06:56,838 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 04:06:56,859 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 04:06:56,859 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 04:06:56,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {2683#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2683#true} is VALID [2022-04-28 04:06:56,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {2683#true} call #t~ret7 := main(); {2683#true} is VALID [2022-04-28 04:06:56,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2683#true} {2683#true} #38#return; {2683#true} is VALID [2022-04-28 04:06:56,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {2683#true} assume true; {2683#true} is VALID [2022-04-28 04:06:56,859 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 04:06:56,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {2683#true} call ULTIMATE.init(); {2683#true} is VALID [2022-04-28 04:06:56,860 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 04:06:56,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620130664] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:06:56,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:06:56,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2022-04-28 04:06:56,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:06:56,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1156418085] [2022-04-28 04:06:56,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1156418085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:56,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:56,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 04:06:56,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615543102] [2022-04-28 04:06:56,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:06:56,861 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 04:06:56,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:06:56,861 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 04:06:56,871 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 04:06:56,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 04:06:56,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:56,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 04:06:56,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2022-04-28 04:06:56,872 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 04:06:57,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:57,010 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 04:06:57,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 04:06:57,010 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 04:06:57,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:06:57,010 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 04:06:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2022-04-28 04:06:57,011 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 04:06:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2022-04-28 04:06:57,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 25 transitions. [2022-04-28 04:06:57,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:06:57,032 INFO L225 Difference]: With dead ends: 25 [2022-04-28 04:06:57,032 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 04:06:57,032 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 04:06:57,033 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 04:06:57,033 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 04:06:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 04:06:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 04:06:57,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:06:57,052 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 04:06:57,052 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 04:06:57,052 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 04:06:57,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:57,052 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 04:06:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 04:06:57,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:57,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:57,053 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 04:06:57,053 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 04:06:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:57,053 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 04:06:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 04:06:57,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:57,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:57,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:06:57,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:06:57,054 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 04:06:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-28 04:06:57,054 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2022-04-28 04:06:57,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:06:57,054 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-28 04:06:57,054 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 04:06:57,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-28 04:06:57,073 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 04:06:57,073 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 04:06:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 04:06:57,073 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:06:57,073 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:06:57,089 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 04:06:57,274 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 04:06:57,274 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:06:57,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:06:57,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1001138263, now seen corresponding path program 13 times [2022-04-28 04:06:57,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:57,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [694045050] [2022-04-28 04:06:57,276 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:06:57,276 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:06:57,276 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:06:57,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1001138263, now seen corresponding path program 14 times [2022-04-28 04:06:57,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:57,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137193801] [2022-04-28 04:06:57,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:57,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:57,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:57,391 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 04:06:57,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-28 04:06:57,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2952#true} {2952#true} #38#return; {2952#true} is VALID [2022-04-28 04:06:57,392 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 04:06:57,392 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 04:06:57,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-28 04:06:57,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2952#true} {2952#true} #38#return; {2952#true} is VALID [2022-04-28 04:06:57,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {2952#true} call #t~ret7 := main(); {2952#true} is VALID [2022-04-28 04:06:57,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {2952#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2952#true} is VALID [2022-04-28 04:06:57,393 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 04:06:57,394 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 04:06:57,394 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 04:06:57,395 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 04:06:57,395 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 04:06:57,396 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 04:06:57,397 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 04:06:57,397 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 04:06:57,398 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 04:06:57,398 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 04:06:57,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {2953#false} assume !false; {2953#false} is VALID [2022-04-28 04:06:57,399 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 04:06:57,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:57,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137193801] [2022-04-28 04:06:57,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137193801] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:06:57,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726723678] [2022-04-28 04:06:57,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:06:57,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:06:57,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:06:57,400 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 04:06:57,401 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 04:06:57,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:06:57,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:06:57,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 04:06:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:57,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:06:59,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {2952#true} call ULTIMATE.init(); {2952#true} is VALID [2022-04-28 04:06:59,027 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 04:06:59,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-28 04:06:59,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2952#true} {2952#true} #38#return; {2952#true} is VALID [2022-04-28 04:06:59,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {2952#true} call #t~ret7 := main(); {2952#true} is VALID [2022-04-28 04:06:59,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {2952#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2952#true} is VALID [2022-04-28 04:06:59,027 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 04:06:59,028 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 04:06:59,029 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 04:06:59,029 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 04:06:59,030 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 04:06:59,030 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 04:06:59,031 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 04:06:59,031 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 04:06:59,032 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 04:06:59,032 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 04:06:59,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {2953#false} assume !false; {2953#false} is VALID [2022-04-28 04:06:59,032 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 04:06:59,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:07:05,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {2953#false} assume !false; {2953#false} is VALID [2022-04-28 04:07:05,858 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 04:07:05,858 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 04:07:05,859 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 04:07:05,861 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 04:07:05,863 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 04:07:05,864 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 04:07:05,866 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 04:07:05,870 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 04:07:05,873 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 04:07:05,874 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 04:07:05,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {2952#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2952#true} is VALID [2022-04-28 04:07:05,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {2952#true} call #t~ret7 := main(); {2952#true} is VALID [2022-04-28 04:07:05,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2952#true} {2952#true} #38#return; {2952#true} is VALID [2022-04-28 04:07:05,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-28 04:07:05,874 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 04:07:05,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {2952#true} call ULTIMATE.init(); {2952#true} is VALID [2022-04-28 04:07:05,875 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 04:07:05,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726723678] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:07:05,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:07:05,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 04:07:05,875 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:05,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [694045050] [2022-04-28 04:07:05,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [694045050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:05,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:05,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 04:07:05,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842579110] [2022-04-28 04:07:05,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:05,876 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 04:07:05,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:05,876 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 04:07:05,888 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 04:07:05,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 04:07:05,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:05,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 04:07:05,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2022-04-28 04:07:05,888 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 04:07:06,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:06,133 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 04:07:06,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 04:07:06,133 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 04:07:06,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:06,133 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 04:07:06,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2022-04-28 04:07:06,134 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 04:07:06,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2022-04-28 04:07:06,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 28 transitions. [2022-04-28 04:07:06,157 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 04:07:06,158 INFO L225 Difference]: With dead ends: 28 [2022-04-28 04:07:06,158 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 04:07:06,159 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 04:07:06,159 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 04:07:06,159 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 04:07:06,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 04:07:06,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-04-28 04:07:06,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:06,178 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 04:07:06,178 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 04:07:06,178 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 04:07:06,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:06,179 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 04:07:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 04:07:06,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:06,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:06,179 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 04:07:06,179 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 04:07:06,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:06,180 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 04:07:06,180 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 04:07:06,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:06,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:06,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:06,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:06,180 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 04:07:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-04-28 04:07:06,181 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2022-04-28 04:07:06,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:06,181 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-04-28 04:07:06,181 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 04:07:06,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2022-04-28 04:07:06,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-28 04:07:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 04:07:06,202 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:06,202 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:06,221 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 04:07:06,405 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 04:07:06,405 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:06,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:06,405 INFO L85 PathProgramCache]: Analyzing trace with hash -970512010, now seen corresponding path program 13 times [2022-04-28 04:07:06,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:06,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1937752583] [2022-04-28 04:07:06,407 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:07:06,408 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:07:06,408 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:07:06,408 INFO L85 PathProgramCache]: Analyzing trace with hash -970512010, now seen corresponding path program 14 times [2022-04-28 04:07:06,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:06,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123766086] [2022-04-28 04:07:06,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:06,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:06,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:06,548 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 04:07:06,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {3246#true} assume true; {3246#true} is VALID [2022-04-28 04:07:06,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3246#true} {3246#true} #38#return; {3246#true} is VALID [2022-04-28 04:07:06,548 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 04:07:06,549 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 04:07:06,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {3246#true} assume true; {3246#true} is VALID [2022-04-28 04:07:06,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3246#true} {3246#true} #38#return; {3246#true} is VALID [2022-04-28 04:07:06,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {3246#true} call #t~ret7 := main(); {3246#true} is VALID [2022-04-28 04:07:06,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {3246#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3246#true} is VALID [2022-04-28 04:07:06,549 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 04:07:06,550 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 04:07:06,550 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 04:07:06,551 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 04:07:06,552 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 04:07:06,552 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 04:07:06,553 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 04:07:06,553 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 04:07:06,554 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 04:07:06,554 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 04:07:06,555 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 04:07:06,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {3247#false} assume !false; {3247#false} is VALID [2022-04-28 04:07:06,555 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 04:07:06,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:06,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123766086] [2022-04-28 04:07:06,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123766086] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:07:06,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493322763] [2022-04-28 04:07:06,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:07:06,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:07:06,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:07:06,556 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 04:07:06,557 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 04:07:06,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:07:06,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:07:06,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 04:07:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:06,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:07:07,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {3246#true} call ULTIMATE.init(); {3246#true} is VALID [2022-04-28 04:07:07,624 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 04:07:07,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {3246#true} assume true; {3246#true} is VALID [2022-04-28 04:07:07,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3246#true} {3246#true} #38#return; {3246#true} is VALID [2022-04-28 04:07:07,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {3246#true} call #t~ret7 := main(); {3246#true} is VALID [2022-04-28 04:07:07,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {3246#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3246#true} is VALID [2022-04-28 04:07:07,625 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 04:07:07,626 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 04:07:07,626 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 04:07:07,627 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 04:07:07,628 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 04:07:07,628 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 04:07:07,629 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 04:07:07,630 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 04:07:07,630 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 04:07:07,630 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 04:07:07,632 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 04:07:07,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {3247#false} assume !false; {3247#false} is VALID [2022-04-28 04:07:07,632 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 04:07:07,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:07:22,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {3247#false} assume !false; {3247#false} is VALID [2022-04-28 04:07:22,762 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 04:07:22,762 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 04:07:22,762 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 04:07:22,764 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 04:07:22,765 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 04:07:22,771 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 04:07:22,805 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 04:07:22,807 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 04:07:22,809 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 04:07:22,811 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 04:07:22,811 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 04:07:22,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {3246#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3246#true} is VALID [2022-04-28 04:07:22,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {3246#true} call #t~ret7 := main(); {3246#true} is VALID [2022-04-28 04:07:22,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3246#true} {3246#true} #38#return; {3246#true} is VALID [2022-04-28 04:07:22,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {3246#true} assume true; {3246#true} is VALID [2022-04-28 04:07:22,812 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 04:07:22,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {3246#true} call ULTIMATE.init(); {3246#true} is VALID [2022-04-28 04:07:22,812 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 04:07:22,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493322763] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:07:22,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:07:22,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-04-28 04:07:22,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:22,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1937752583] [2022-04-28 04:07:22,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1937752583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:22,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:22,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 04:07:22,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717353900] [2022-04-28 04:07:22,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:22,813 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 04:07:22,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:22,813 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 04:07:22,826 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 04:07:22,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 04:07:22,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:22,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 04:07:22,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2022-04-28 04:07:22,827 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 04:07:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:22,971 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 04:07:22,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 04:07:22,971 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 04:07:22,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:22,971 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 04:07:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2022-04-28 04:07:22,972 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 04:07:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2022-04-28 04:07:22,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 26 transitions. [2022-04-28 04:07:22,993 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 04:07:22,994 INFO L225 Difference]: With dead ends: 26 [2022-04-28 04:07:22,994 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 04:07:22,994 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 04:07:22,995 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 04:07:22,995 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 04:07:22,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 04:07:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 04:07:23,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:23,011 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 04:07:23,013 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 04:07:23,013 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 04:07:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:23,014 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 04:07:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 04:07:23,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:23,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:23,014 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 04:07:23,014 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 04:07:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:23,015 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 04:07:23,015 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 04:07:23,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:23,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:23,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:23,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:23,015 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 04:07:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-28 04:07:23,015 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2022-04-28 04:07:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:23,016 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-28 04:07:23,016 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 04:07:23,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-28 04:07:23,035 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 04:07:23,035 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 04:07:23,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 04:07:23,035 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:23,035 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:23,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 04:07:23,236 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 04:07:23,236 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:23,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash -970463191, now seen corresponding path program 15 times [2022-04-28 04:07:23,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:23,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [871890964] [2022-04-28 04:07:23,238 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:07:23,238 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:07:23,239 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:07:23,239 INFO L85 PathProgramCache]: Analyzing trace with hash -970463191, now seen corresponding path program 16 times [2022-04-28 04:07:23,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:23,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519423066] [2022-04-28 04:07:23,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:23,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:23,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:23,372 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 04:07:23,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {3531#true} assume true; {3531#true} is VALID [2022-04-28 04:07:23,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3531#true} {3531#true} #38#return; {3531#true} is VALID [2022-04-28 04:07:23,373 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 04:07:23,373 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 04:07:23,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {3531#true} assume true; {3531#true} is VALID [2022-04-28 04:07:23,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3531#true} {3531#true} #38#return; {3531#true} is VALID [2022-04-28 04:07:23,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {3531#true} call #t~ret7 := main(); {3531#true} is VALID [2022-04-28 04:07:23,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {3531#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3531#true} is VALID [2022-04-28 04:07:23,373 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 04:07:23,374 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 04:07:23,375 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 04:07:23,375 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 04:07:23,376 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 04:07:23,376 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 04:07:23,377 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 04:07:23,377 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 04:07:23,378 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 04:07:23,379 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 04:07:23,379 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 04:07:23,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {3532#false} assume !false; {3532#false} is VALID [2022-04-28 04:07:23,379 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 04:07:23,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:23,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519423066] [2022-04-28 04:07:23,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519423066] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:07:23,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491144183] [2022-04-28 04:07:23,380 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:07:23,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:07:23,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:07:23,381 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 04:07:23,382 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 04:07:23,440 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:07:23,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:07:23,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 04:07:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:23,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:07:25,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {3531#true} call ULTIMATE.init(); {3531#true} is VALID [2022-04-28 04:07:25,140 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 04:07:25,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {3531#true} assume true; {3531#true} is VALID [2022-04-28 04:07:25,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3531#true} {3531#true} #38#return; {3531#true} is VALID [2022-04-28 04:07:25,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {3531#true} call #t~ret7 := main(); {3531#true} is VALID [2022-04-28 04:07:25,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {3531#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3531#true} is VALID [2022-04-28 04:07:25,140 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 04:07:25,141 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 04:07:25,142 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 04:07:25,142 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 04:07:25,143 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 04:07:25,143 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 04:07:25,144 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 04:07:25,145 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 04:07:25,145 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 04:07:25,146 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 04:07:25,146 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 04:07:25,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {3532#false} assume !false; {3532#false} is VALID [2022-04-28 04:07:25,146 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 04:07:25,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:07:33,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {3532#false} assume !false; {3532#false} is VALID [2022-04-28 04:07:33,649 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 04:07:33,649 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 04:07:33,650 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 04:07:33,655 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 04:07:33,657 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 04:07:33,660 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 04:07:33,662 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 04:07:33,664 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 04:07:33,666 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 04:07:33,667 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 04:07:33,668 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 04:07:33,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {3531#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3531#true} is VALID [2022-04-28 04:07:33,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {3531#true} call #t~ret7 := main(); {3531#true} is VALID [2022-04-28 04:07:33,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3531#true} {3531#true} #38#return; {3531#true} is VALID [2022-04-28 04:07:33,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {3531#true} assume true; {3531#true} is VALID [2022-04-28 04:07:33,668 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 04:07:33,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {3531#true} call ULTIMATE.init(); {3531#true} is VALID [2022-04-28 04:07:33,668 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 04:07:33,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491144183] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:07:33,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:07:33,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 04:07:33,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:33,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [871890964] [2022-04-28 04:07:33,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [871890964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:33,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:33,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 04:07:33,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143061622] [2022-04-28 04:07:33,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:33,669 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 04:07:33,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:33,670 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 04:07:33,683 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 04:07:33,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 04:07:33,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:33,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 04:07:33,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=290, Unknown=0, NotChecked=0, Total=462 [2022-04-28 04:07:33,684 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 04:07:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:33,943 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 04:07:33,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 04:07:33,943 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 04:07:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:33,943 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 04:07:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2022-04-28 04:07:33,944 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 04:07:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2022-04-28 04:07:33,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 29 transitions. [2022-04-28 04:07:33,967 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 04:07:33,967 INFO L225 Difference]: With dead ends: 29 [2022-04-28 04:07:33,967 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 04:07:33,968 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 04:07:33,968 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 04:07:33,968 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 04:07:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 04:07:33,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-04-28 04:07:33,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:33,998 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 04:07:33,998 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 04:07:33,999 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 04:07:33,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:33,999 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 04:07:33,999 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 04:07:33,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:33,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:33,999 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 04:07:33,999 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 04:07:34,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:34,000 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 04:07:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 04:07:34,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:34,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:34,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:34,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:34,000 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 04:07:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-28 04:07:34,001 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2022-04-28 04:07:34,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:34,001 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-28 04:07:34,001 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 04:07:34,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2022-04-28 04:07:34,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 04:07:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 04:07:34,032 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:34,032 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:34,048 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 04:07:34,232 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 04:07:34,233 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:34,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:34,233 INFO L85 PathProgramCache]: Analyzing trace with hash -19584778, now seen corresponding path program 15 times [2022-04-28 04:07:34,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:34,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1912318804] [2022-04-28 04:07:34,235 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:07:34,235 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:07:34,235 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:07:34,235 INFO L85 PathProgramCache]: Analyzing trace with hash -19584778, now seen corresponding path program 16 times [2022-04-28 04:07:34,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:34,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333143423] [2022-04-28 04:07:34,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:34,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:34,372 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 04:07:34,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {3841#true} assume true; {3841#true} is VALID [2022-04-28 04:07:34,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3841#true} {3841#true} #38#return; {3841#true} is VALID [2022-04-28 04:07:34,373 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 04:07:34,373 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 04:07:34,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {3841#true} assume true; {3841#true} is VALID [2022-04-28 04:07:34,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3841#true} {3841#true} #38#return; {3841#true} is VALID [2022-04-28 04:07:34,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {3841#true} call #t~ret7 := main(); {3841#true} is VALID [2022-04-28 04:07:34,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {3841#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3841#true} is VALID [2022-04-28 04:07:34,373 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 04:07:34,374 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 04:07:34,375 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 04:07:34,375 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 04:07:34,376 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 04:07:34,377 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 04:07:34,377 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 04:07:34,378 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 04:07:34,378 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 04:07:34,379 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 04:07:34,379 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 04:07:34,380 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 04:07:34,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {3842#false} assume !false; {3842#false} is VALID [2022-04-28 04:07:34,380 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 04:07:34,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:34,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333143423] [2022-04-28 04:07:34,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333143423] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:07:34,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630059699] [2022-04-28 04:07:34,380 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:07:34,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:07:34,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:07:34,381 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 04:07:34,385 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 04:07:34,439 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:07:34,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:07:34,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 04:07:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:34,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:07:35,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {3841#true} call ULTIMATE.init(); {3841#true} is VALID [2022-04-28 04:07:35,673 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 04:07:35,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {3841#true} assume true; {3841#true} is VALID [2022-04-28 04:07:35,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3841#true} {3841#true} #38#return; {3841#true} is VALID [2022-04-28 04:07:35,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {3841#true} call #t~ret7 := main(); {3841#true} is VALID [2022-04-28 04:07:35,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {3841#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3841#true} is VALID [2022-04-28 04:07:35,674 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 04:07:35,674 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 04:07:35,686 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 04:07:35,686 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 04:07:35,687 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 04:07:35,688 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 04:07:35,688 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 04:07:35,689 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 04:07:35,689 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 04:07:35,690 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 04:07:35,690 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 04:07:35,691 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 04:07:35,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {3842#false} assume !false; {3842#false} is VALID [2022-04-28 04:07:35,691 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 04:07:35,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:07:46,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {3842#false} assume !false; {3842#false} is VALID [2022-04-28 04:07:46,792 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 04:07:46,792 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 04:07:46,792 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 04:07:46,794 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 04:07:46,796 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 04:07:46,798 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 04:07:46,799 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 04:07:46,803 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 04:07:46,805 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 04:07:46,810 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 04:07:46,811 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 04:07:46,812 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 04:07:46,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {3841#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3841#true} is VALID [2022-04-28 04:07:46,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {3841#true} call #t~ret7 := main(); {3841#true} is VALID [2022-04-28 04:07:46,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3841#true} {3841#true} #38#return; {3841#true} is VALID [2022-04-28 04:07:46,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {3841#true} assume true; {3841#true} is VALID [2022-04-28 04:07:46,812 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 04:07:46,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {3841#true} call ULTIMATE.init(); {3841#true} is VALID [2022-04-28 04:07:46,813 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 04:07:46,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630059699] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:07:46,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:07:46,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 21 [2022-04-28 04:07:46,813 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:46,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1912318804] [2022-04-28 04:07:46,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1912318804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:46,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:46,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 04:07:46,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441805027] [2022-04-28 04:07:46,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:46,814 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 04:07:46,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:46,814 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 04:07:46,827 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 04:07:46,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 04:07:46,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:46,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 04:07:46,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2022-04-28 04:07:46,828 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 04:07:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:46,983 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 04:07:46,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 04:07:46,983 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 04:07:46,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:46,984 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 04:07:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2022-04-28 04:07:46,984 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 04:07:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2022-04-28 04:07:46,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 27 transitions. [2022-04-28 04:07:47,003 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 04:07:47,004 INFO L225 Difference]: With dead ends: 27 [2022-04-28 04:07:47,004 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 04:07:47,004 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 04:07:47,005 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 04:07:47,005 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 04:07:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 04:07:47,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 04:07:47,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:47,024 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 04:07:47,024 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 04:07:47,024 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 04:07:47,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:47,024 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 04:07:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 04:07:47,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:47,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:47,025 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 04:07:47,025 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 04:07:47,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:47,025 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 04:07:47,025 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 04:07:47,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:47,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:47,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:47,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:47,026 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 04:07:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-28 04:07:47,026 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2022-04-28 04:07:47,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:47,026 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-28 04:07:47,026 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 04:07:47,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-28 04:07:47,059 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 04:07:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 04:07:47,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 04:07:47,059 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:47,059 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:47,078 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 04:07:47,263 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 04:07:47,264 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:47,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:47,264 INFO L85 PathProgramCache]: Analyzing trace with hash -19535959, now seen corresponding path program 17 times [2022-04-28 04:07:47,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:47,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1493195260] [2022-04-28 04:07:47,267 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:07:47,267 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:07:47,267 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:07:47,267 INFO L85 PathProgramCache]: Analyzing trace with hash -19535959, now seen corresponding path program 18 times [2022-04-28 04:07:47,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:47,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409625474] [2022-04-28 04:07:47,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:47,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:47,412 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 04:07:47,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {4142#true} assume true; {4142#true} is VALID [2022-04-28 04:07:47,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4142#true} {4142#true} #38#return; {4142#true} is VALID [2022-04-28 04:07:47,413 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 04:07:47,413 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 04:07:47,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {4142#true} assume true; {4142#true} is VALID [2022-04-28 04:07:47,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4142#true} {4142#true} #38#return; {4142#true} is VALID [2022-04-28 04:07:47,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {4142#true} call #t~ret7 := main(); {4142#true} is VALID [2022-04-28 04:07:47,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {4142#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4142#true} is VALID [2022-04-28 04:07:47,414 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 04:07:47,414 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 04:07:47,415 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 04:07:47,415 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 04:07:47,416 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 04:07:47,417 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 04:07:47,417 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 04:07:47,418 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 04:07:47,418 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 04:07:47,419 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 04:07:47,419 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 04:07:47,420 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 04:07:47,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {4143#false} assume !false; {4143#false} is VALID [2022-04-28 04:07:47,420 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 04:07:47,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:47,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409625474] [2022-04-28 04:07:47,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409625474] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:07:47,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231256786] [2022-04-28 04:07:47,421 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:07:47,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:07:47,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:07:47,422 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 04:07:47,423 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 04:07:47,516 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 04:07:47,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:07:47,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 04:07:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:47,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:07:49,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {4142#true} call ULTIMATE.init(); {4142#true} is VALID [2022-04-28 04:07:49,452 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 04:07:49,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {4142#true} assume true; {4142#true} is VALID [2022-04-28 04:07:49,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4142#true} {4142#true} #38#return; {4142#true} is VALID [2022-04-28 04:07:49,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {4142#true} call #t~ret7 := main(); {4142#true} is VALID [2022-04-28 04:07:49,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {4142#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4142#true} is VALID [2022-04-28 04:07:49,453 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 04:07:49,453 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 04:07:49,454 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 04:07:49,454 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 04:07:49,455 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 04:07:49,456 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 04:07:49,456 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 04:07:49,457 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 04:07:49,457 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 04:07:49,458 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 04:07:49,458 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 04:07:49,459 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 04:07:49,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {4143#false} assume !false; {4143#false} is VALID [2022-04-28 04:07:49,459 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 04:07:49,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:08:01,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {4143#false} assume !false; {4143#false} is VALID [2022-04-28 04:08:01,357 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 04:08:01,357 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 04:08:01,358 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 04:08:01,363 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 04:08:01,366 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 04:08:01,368 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 04:08:01,376 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 04:08:01,378 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 04:08:01,380 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 04:08:01,388 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 04:08:01,392 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 04:08:01,392 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 04:08:01,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {4142#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4142#true} is VALID [2022-04-28 04:08:01,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {4142#true} call #t~ret7 := main(); {4142#true} is VALID [2022-04-28 04:08:01,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4142#true} {4142#true} #38#return; {4142#true} is VALID [2022-04-28 04:08:01,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {4142#true} assume true; {4142#true} is VALID [2022-04-28 04:08:01,393 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 04:08:01,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {4142#true} call ULTIMATE.init(); {4142#true} is VALID [2022-04-28 04:08:01,393 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 04:08:01,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231256786] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:08:01,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:08:01,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 04:08:01,393 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:01,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1493195260] [2022-04-28 04:08:01,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1493195260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:01,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:01,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 04:08:01,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996708824] [2022-04-28 04:08:01,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:01,394 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 04:08:01,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:01,394 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 04:08:01,406 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 04:08:01,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 04:08:01,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:01,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 04:08:01,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2022-04-28 04:08:01,407 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 04:08:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:01,704 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 04:08:01,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 04:08:01,704 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 04:08:01,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:01,704 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 04:08:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 30 transitions. [2022-04-28 04:08:01,705 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 04:08:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 30 transitions. [2022-04-28 04:08:01,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 30 transitions. [2022-04-28 04:08:01,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:01,728 INFO L225 Difference]: With dead ends: 30 [2022-04-28 04:08:01,728 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 04:08:01,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=440, Invalid=682, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 04:08:01,729 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 04:08:01,729 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 04:08:01,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 04:08:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-04-28 04:08:01,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:01,750 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 04:08:01,751 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 04:08:01,751 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 04:08:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:01,751 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 04:08:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 04:08:01,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:01,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:01,752 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 04:08:01,752 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 04:08:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:01,752 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 04:08:01,752 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 04:08:01,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:01,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:01,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:01,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:01,752 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 04:08:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-28 04:08:01,753 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2022-04-28 04:08:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:01,753 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-28 04:08:01,753 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 04:08:01,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-28 04:08:01,777 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 04:08:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-28 04:08:01,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 04:08:01,778 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:01,778 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:01,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-28 04:08:01,981 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 04:08:01,982 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:01,982 INFO L85 PathProgramCache]: Analyzing trace with hash -605611658, now seen corresponding path program 17 times [2022-04-28 04:08:01,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:01,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [11817412] [2022-04-28 04:08:01,984 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:08:01,984 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:08:01,984 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:08:01,984 INFO L85 PathProgramCache]: Analyzing trace with hash -605611658, now seen corresponding path program 18 times [2022-04-28 04:08:01,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:01,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358201645] [2022-04-28 04:08:01,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:01,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:02,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:02,122 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 04:08:02,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {4468#true} assume true; {4468#true} is VALID [2022-04-28 04:08:02,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4468#true} {4468#true} #38#return; {4468#true} is VALID [2022-04-28 04:08:02,135 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 04:08:02,135 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 04:08:02,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {4468#true} assume true; {4468#true} is VALID [2022-04-28 04:08:02,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4468#true} {4468#true} #38#return; {4468#true} is VALID [2022-04-28 04:08:02,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {4468#true} call #t~ret7 := main(); {4468#true} is VALID [2022-04-28 04:08:02,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {4468#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4468#true} is VALID [2022-04-28 04:08:02,136 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 04:08:02,137 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 04:08:02,137 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 04:08:02,138 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 04:08:02,138 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 04:08:02,139 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 04:08:02,140 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 04:08:02,140 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 04:08:02,141 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 04:08:02,141 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 04:08:02,142 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 04:08:02,142 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 04:08:02,142 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 04:08:02,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {4469#false} assume !false; {4469#false} is VALID [2022-04-28 04:08:02,143 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 04:08:02,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:02,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358201645] [2022-04-28 04:08:02,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358201645] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:08:02,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045787700] [2022-04-28 04:08:02,143 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:08:02,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:08:02,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:08:02,144 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 04:08:02,145 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 04:08:02,220 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 04:08:02,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:08:02,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 04:08:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:02,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:08:03,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {4468#true} call ULTIMATE.init(); {4468#true} is VALID [2022-04-28 04:08:03,644 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 04:08:03,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {4468#true} assume true; {4468#true} is VALID [2022-04-28 04:08:03,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4468#true} {4468#true} #38#return; {4468#true} is VALID [2022-04-28 04:08:03,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {4468#true} call #t~ret7 := main(); {4468#true} is VALID [2022-04-28 04:08:03,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {4468#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4468#true} is VALID [2022-04-28 04:08:03,644 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 04:08:03,645 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 04:08:03,645 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 04:08:03,646 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 04:08:03,647 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 04:08:03,647 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 04:08:03,648 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 04:08:03,648 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 04:08:03,649 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 04:08:03,649 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 04:08:03,650 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 04:08:03,650 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 04:08:03,651 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 04:08:03,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {4469#false} assume !false; {4469#false} is VALID [2022-04-28 04:08:03,651 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 04:08:03,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:08:16,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {4469#false} assume !false; {4469#false} is VALID [2022-04-28 04:08:16,977 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 04:08:16,978 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 04:08:16,978 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 04:08:16,981 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 04:08:17,004 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 04:08:17,006 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 04:08:17,008 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 04:08:17,009 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 04:08:17,010 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 04:08:17,012 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 04:08:17,014 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 04:08:17,018 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 04:08:17,019 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 04:08:17,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {4468#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4468#true} is VALID [2022-04-28 04:08:17,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {4468#true} call #t~ret7 := main(); {4468#true} is VALID [2022-04-28 04:08:17,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4468#true} {4468#true} #38#return; {4468#true} is VALID [2022-04-28 04:08:17,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {4468#true} assume true; {4468#true} is VALID [2022-04-28 04:08:17,019 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 04:08:17,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {4468#true} call ULTIMATE.init(); {4468#true} is VALID [2022-04-28 04:08:17,019 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 04:08:17,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045787700] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:08:17,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:08:17,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 23 [2022-04-28 04:08:17,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:17,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [11817412] [2022-04-28 04:08:17,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [11817412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:17,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:17,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 04:08:17,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712928411] [2022-04-28 04:08:17,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:17,021 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 04:08:17,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:17,021 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 04:08:17,032 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 04:08:17,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 04:08:17,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:17,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 04:08:17,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2022-04-28 04:08:17,033 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 04:08:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:17,241 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 04:08:17,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 04:08:17,241 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 04:08:17,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:17,241 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 04:08:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2022-04-28 04:08:17,242 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 04:08:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2022-04-28 04:08:17,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 28 transitions. [2022-04-28 04:08:17,262 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 04:08:17,263 INFO L225 Difference]: With dead ends: 28 [2022-04-28 04:08:17,263 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 04:08:17,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=463, Invalid=593, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 04:08:17,264 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:17,264 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.1s Time] [2022-04-28 04:08:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 04:08:17,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 04:08:17,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:17,289 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 04:08:17,289 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 04:08:17,289 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 04:08:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:17,289 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 04:08:17,290 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 04:08:17,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:17,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:17,290 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 04:08:17,290 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 04:08:17,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:17,290 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 04:08:17,290 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 04:08:17,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:17,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:17,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:17,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:17,291 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 04:08:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-28 04:08:17,291 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2022-04-28 04:08:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:17,291 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-28 04:08:17,291 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 04:08:17,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-28 04:08:17,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:17,319 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 04:08:17,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 04:08:17,319 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:17,319 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:17,323 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 04:08:17,520 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 04:08:17,520 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:17,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:17,520 INFO L85 PathProgramCache]: Analyzing trace with hash -605562839, now seen corresponding path program 19 times [2022-04-28 04:08:17,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:17,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1841477758] [2022-04-28 04:08:17,522 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:08:17,522 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:08:17,522 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:08:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash -605562839, now seen corresponding path program 20 times [2022-04-28 04:08:17,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:17,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164757196] [2022-04-28 04:08:17,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:17,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:17,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:17,670 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 04:08:17,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {4785#true} assume true; {4785#true} is VALID [2022-04-28 04:08:17,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4785#true} {4785#true} #38#return; {4785#true} is VALID [2022-04-28 04:08:17,670 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 04:08:17,670 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 04:08:17,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {4785#true} assume true; {4785#true} is VALID [2022-04-28 04:08:17,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4785#true} {4785#true} #38#return; {4785#true} is VALID [2022-04-28 04:08:17,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {4785#true} call #t~ret7 := main(); {4785#true} is VALID [2022-04-28 04:08:17,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {4785#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4785#true} is VALID [2022-04-28 04:08:17,671 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 04:08:17,672 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 04:08:17,672 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 04:08:17,673 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 04:08:17,673 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 04:08:17,674 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 04:08:17,675 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 04:08:17,675 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 04:08:17,676 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 04:08:17,677 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 04:08:17,678 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 04:08:17,678 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 04:08:17,678 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 04:08:17,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {4786#false} assume !false; {4786#false} is VALID [2022-04-28 04:08:17,679 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 04:08:17,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:17,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164757196] [2022-04-28 04:08:17,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164757196] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:08:17,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160610031] [2022-04-28 04:08:17,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:08:17,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:08:17,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:08:17,680 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 04:08:17,681 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 04:08:17,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:08:17,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:08:17,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 04:08:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:17,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:08:19,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {4785#true} call ULTIMATE.init(); {4785#true} is VALID [2022-04-28 04:08:19,826 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 04:08:19,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {4785#true} assume true; {4785#true} is VALID [2022-04-28 04:08:19,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4785#true} {4785#true} #38#return; {4785#true} is VALID [2022-04-28 04:08:19,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {4785#true} call #t~ret7 := main(); {4785#true} is VALID [2022-04-28 04:08:19,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {4785#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4785#true} is VALID [2022-04-28 04:08:19,827 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 04:08:19,827 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 04:08:19,828 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 04:08:19,828 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 04:08:19,829 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 04:08:19,830 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 04:08:19,830 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 04:08:19,831 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 04:08:19,831 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 04:08:19,832 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 04:08:19,832 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 04:08:19,833 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 04:08:19,833 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 04:08:19,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {4786#false} assume !false; {4786#false} is VALID [2022-04-28 04:08:19,834 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 04:08:19,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:08:33,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {4786#false} assume !false; {4786#false} is VALID [2022-04-28 04:08:33,483 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 04:08:33,483 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 04:08:33,533 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 04:08:33,535 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 04:08:33,554 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 04:08:33,557 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 04:08:33,560 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 04:08:33,562 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 04:08:33,593 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 04:08:33,594 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 04:08:33,598 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 04:08:33,600 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 04:08:33,600 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 04:08:33,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {4785#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4785#true} is VALID [2022-04-28 04:08:33,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {4785#true} call #t~ret7 := main(); {4785#true} is VALID [2022-04-28 04:08:33,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4785#true} {4785#true} #38#return; {4785#true} is VALID [2022-04-28 04:08:33,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {4785#true} assume true; {4785#true} is VALID [2022-04-28 04:08:33,601 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 04:08:33,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {4785#true} call ULTIMATE.init(); {4785#true} is VALID [2022-04-28 04:08:33,601 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 04:08:33,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160610031] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:08:33,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:08:33,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 04:08:33,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:33,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1841477758] [2022-04-28 04:08:33,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1841477758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:33,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:33,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 04:08:33,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915969004] [2022-04-28 04:08:33,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:33,602 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 04:08:33,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:33,603 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 04:08:33,614 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 04:08:33,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 04:08:33,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:33,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 04:08:33,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=398, Unknown=0, NotChecked=0, Total=650 [2022-04-28 04:08:33,615 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 04:08:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:33,991 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 04:08:33,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 04:08:33,991 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 04:08:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:33,991 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 04:08:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2022-04-28 04:08:33,992 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 04:08:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2022-04-28 04:08:33,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 31 transitions. [2022-04-28 04:08:34,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 04:08:34,016 INFO L225 Difference]: With dead ends: 31 [2022-04-28 04:08:34,016 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 04:08:34,016 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 04:08:34,017 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 04:08:34,017 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 04:08:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 04:08:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-04-28 04:08:34,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:34,038 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 04:08:34,038 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 04:08:34,038 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 04:08:34,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:34,039 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 04:08:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 04:08:34,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:34,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:34,039 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 04:08:34,039 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 04:08:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:34,040 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 04:08:34,040 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 04:08:34,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:34,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:34,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:34,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:34,040 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 04:08:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-28 04:08:34,040 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2022-04-28 04:08:34,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:34,041 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-28 04:08:34,041 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 04:08:34,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 27 transitions. [2022-04-28 04:08:34,064 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 04:08:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-28 04:08:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 04:08:34,065 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:34,065 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:34,081 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 04:08:34,265 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 04:08:34,266 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:34,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:34,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1592575754, now seen corresponding path program 19 times [2022-04-28 04:08:34,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:34,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [863212846] [2022-04-28 04:08:34,268 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:08:34,268 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:08:34,268 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:08:34,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1592575754, now seen corresponding path program 20 times [2022-04-28 04:08:34,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:34,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855656540] [2022-04-28 04:08:34,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:34,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:34,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:34,430 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 04:08:34,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {5127#true} assume true; {5127#true} is VALID [2022-04-28 04:08:34,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5127#true} {5127#true} #38#return; {5127#true} is VALID [2022-04-28 04:08:34,431 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 04:08:34,431 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 04:08:34,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {5127#true} assume true; {5127#true} is VALID [2022-04-28 04:08:34,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5127#true} {5127#true} #38#return; {5127#true} is VALID [2022-04-28 04:08:34,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {5127#true} call #t~ret7 := main(); {5127#true} is VALID [2022-04-28 04:08:34,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {5127#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5127#true} is VALID [2022-04-28 04:08:34,432 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 04:08:34,432 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 04:08:34,433 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 04:08:34,434 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 04:08:34,434 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 04:08:34,435 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 04:08:34,435 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 04:08:34,436 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 04:08:34,436 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 04:08:34,437 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 04:08:34,438 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 04:08:34,438 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 04:08:34,438 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 04:08:34,440 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 04:08:34,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {5128#false} assume !false; {5128#false} is VALID [2022-04-28 04:08:34,440 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 04:08:34,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:34,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855656540] [2022-04-28 04:08:34,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855656540] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:08:34,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098223291] [2022-04-28 04:08:34,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:08:34,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:08:34,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:08:34,442 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 04:08:34,443 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 04:08:34,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:08:34,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:08:34,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 04:08:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:34,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:08:36,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {5127#true} call ULTIMATE.init(); {5127#true} is VALID [2022-04-28 04:08:36,094 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 04:08:36,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {5127#true} assume true; {5127#true} is VALID [2022-04-28 04:08:36,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5127#true} {5127#true} #38#return; {5127#true} is VALID [2022-04-28 04:08:36,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {5127#true} call #t~ret7 := main(); {5127#true} is VALID [2022-04-28 04:08:36,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {5127#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5127#true} is VALID [2022-04-28 04:08:36,096 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 04:08:36,096 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 04:08:36,097 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 04:08:36,097 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 04:08:36,098 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 04:08:36,098 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 04:08:36,099 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 04:08:36,099 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 04:08:36,100 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 04:08:36,101 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 04:08:36,101 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 04:08:36,101 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 04:08:36,102 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 04:08:36,102 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 04:08:36,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {5128#false} assume !false; {5128#false} is VALID [2022-04-28 04:08:36,102 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 04:08:36,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:08:55,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {5128#false} assume !false; {5128#false} is VALID [2022-04-28 04:08:55,712 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 04:08:55,712 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 04:08:55,712 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 04:08:55,713 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 04:08:55,719 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 04:08:55,723 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 04:08:55,731 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 04:08:55,733 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 04:08:55,734 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 04:08:55,737 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 04:08:55,739 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 04:08:55,742 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 04:08:55,744 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 04:08:55,744 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 04:08:55,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {5127#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5127#true} is VALID [2022-04-28 04:08:55,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {5127#true} call #t~ret7 := main(); {5127#true} is VALID [2022-04-28 04:08:55,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5127#true} {5127#true} #38#return; {5127#true} is VALID [2022-04-28 04:08:55,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {5127#true} assume true; {5127#true} is VALID [2022-04-28 04:08:55,744 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 04:08:55,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {5127#true} call ULTIMATE.init(); {5127#true} is VALID [2022-04-28 04:08:55,745 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 04:08:55,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098223291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:08:55,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:08:55,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 25 [2022-04-28 04:08:55,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:55,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [863212846] [2022-04-28 04:08:55,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [863212846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:55,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:55,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 04:08:55,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593454693] [2022-04-28 04:08:55,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:55,746 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 04:08:55,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:55,746 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 04:08:55,758 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 04:08:55,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 04:08:55,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:55,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 04:08:55,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2022-04-28 04:08:55,759 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 04:08:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:56,020 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 04:08:56,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 04:08:56,021 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 04:08:56,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:56,021 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 04:08:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2022-04-28 04:08:56,021 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 04:08:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2022-04-28 04:08:56,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 29 transitions. [2022-04-28 04:08:56,043 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 04:08:56,043 INFO L225 Difference]: With dead ends: 29 [2022-04-28 04:08:56,043 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 04:08:56,044 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 04:08:56,044 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 04:08:56,044 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 04:08:56,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 04:08:56,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 04:08:56,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:56,073 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 04:08:56,073 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 04:08:56,073 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 04:08:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:56,074 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 04:08:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 04:08:56,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:56,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:56,074 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 04:08:56,074 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 04:08:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:56,074 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 04:08:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 04:08:56,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:56,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:56,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:56,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:56,075 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 04:08:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-28 04:08:56,075 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2022-04-28 04:08:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:56,075 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-28 04:08:56,076 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 04:08:56,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-28 04:08:56,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 04:08:56,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 04:08:56,099 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:56,099 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:56,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-28 04:08:56,306 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 04:08:56,306 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:56,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:56,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1592526935, now seen corresponding path program 21 times [2022-04-28 04:08:56,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:56,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [619178351] [2022-04-28 04:08:56,308 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:08:56,309 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:08:56,309 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:08:56,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1592526935, now seen corresponding path program 22 times [2022-04-28 04:08:56,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:56,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534853443] [2022-04-28 04:08:56,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:56,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:56,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:56,505 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 04:08:56,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {5460#true} assume true; {5460#true} is VALID [2022-04-28 04:08:56,505 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5460#true} {5460#true} #38#return; {5460#true} is VALID [2022-04-28 04:08:56,505 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 04:08:56,506 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 04:08:56,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {5460#true} assume true; {5460#true} is VALID [2022-04-28 04:08:56,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5460#true} {5460#true} #38#return; {5460#true} is VALID [2022-04-28 04:08:56,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {5460#true} call #t~ret7 := main(); {5460#true} is VALID [2022-04-28 04:08:56,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {5460#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5460#true} is VALID [2022-04-28 04:08:56,506 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 04:08:56,507 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 04:08:56,507 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 04:08:56,508 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 04:08:56,509 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 04:08:56,509 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 04:08:56,510 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 04:08:56,510 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 04:08:56,511 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 04:08:56,512 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 04:08:56,512 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 04:08:56,513 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 04:08:56,513 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 04:08:56,514 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 04:08:56,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {5461#false} assume !false; {5461#false} is VALID [2022-04-28 04:08:56,514 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 04:08:56,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:56,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534853443] [2022-04-28 04:08:56,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534853443] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:08:56,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900122352] [2022-04-28 04:08:56,515 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:08:56,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:08:56,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:08:56,516 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 04:08:56,517 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 04:08:56,643 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:08:56,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:08:56,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 04:08:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:56,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:08:58,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {5460#true} call ULTIMATE.init(); {5460#true} is VALID [2022-04-28 04:08:58,975 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 04:08:58,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {5460#true} assume true; {5460#true} is VALID [2022-04-28 04:08:58,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5460#true} {5460#true} #38#return; {5460#true} is VALID [2022-04-28 04:08:58,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {5460#true} call #t~ret7 := main(); {5460#true} is VALID [2022-04-28 04:08:58,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {5460#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5460#true} is VALID [2022-04-28 04:08:58,976 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 04:08:58,976 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 04:08:58,977 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 04:08:58,977 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 04:08:58,978 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 04:08:58,979 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 04:08:58,979 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 04:08:58,980 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 04:08:58,981 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 04:08:58,981 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 04:08:58,982 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 04:08:58,982 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 04:08:58,983 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 04:08:58,984 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 04:08:58,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {5461#false} assume !false; {5461#false} is VALID [2022-04-28 04:08:58,985 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 04:08:58,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:09:12,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {5461#false} assume !false; {5461#false} is VALID [2022-04-28 04:09:12,349 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 04:09:12,349 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 04:09:12,357 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 04:09:12,359 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 04:09:12,364 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 04:09:12,366 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 04:09:12,373 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 04:09:12,380 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 04:09:12,391 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 04:09:12,395 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 04:09:12,402 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 04:09:12,404 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 04:09:12,405 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 04:09:12,405 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 04:09:12,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {5460#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5460#true} is VALID [2022-04-28 04:09:12,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {5460#true} call #t~ret7 := main(); {5460#true} is VALID [2022-04-28 04:09:12,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5460#true} {5460#true} #38#return; {5460#true} is VALID [2022-04-28 04:09:12,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {5460#true} assume true; {5460#true} is VALID [2022-04-28 04:09:12,406 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 04:09:12,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {5460#true} call ULTIMATE.init(); {5460#true} is VALID [2022-04-28 04:09:12,406 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 04:09:12,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900122352] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:09:12,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:09:12,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 04:09:12,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:12,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [619178351] [2022-04-28 04:09:12,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [619178351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:12,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:12,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 04:09:12,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609812060] [2022-04-28 04:09:12,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:12,407 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 04:09:12,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:12,407 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 04:09:12,420 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 04:09:12,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 04:09:12,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:12,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 04:09:12,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=458, Unknown=0, NotChecked=0, Total=756 [2022-04-28 04:09:12,421 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 04:09:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:12,792 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 04:09:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 04:09:12,792 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 04:09:12,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:12,792 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 04:09:12,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 32 transitions. [2022-04-28 04:09:12,793 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 04:09:12,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 32 transitions. [2022-04-28 04:09:12,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 32 transitions. [2022-04-28 04:09:12,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:12,821 INFO L225 Difference]: With dead ends: 32 [2022-04-28 04:09:12,821 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 04:09:12,821 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 04:09:12,822 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 04:09:12,822 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 04:09:12,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 04:09:12,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-04-28 04:09:12,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:12,848 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 04:09:12,848 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 04:09:12,849 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 04:09:12,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:12,849 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 04:09:12,849 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 04:09:12,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:12,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:12,849 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 04:09:12,849 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 04:09:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:12,850 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 04:09:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 04:09:12,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:12,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:12,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:12,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:12,850 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 04:09:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-28 04:09:12,851 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2022-04-28 04:09:12,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:12,851 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-28 04:09:12,851 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 04:09:12,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2022-04-28 04:09:12,887 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 04:09:12,887 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-28 04:09:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 04:09:12,887 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:12,888 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:12,893 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 04:09:13,091 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 04:09:13,092 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:13,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:13,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2123691658, now seen corresponding path program 21 times [2022-04-28 04:09:13,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:13,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1255823849] [2022-04-28 04:09:13,094 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:09:13,094 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:09:13,094 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:09:13,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2123691658, now seen corresponding path program 22 times [2022-04-28 04:09:13,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:13,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547502706] [2022-04-28 04:09:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:13,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:13,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:13,279 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 04:09:13,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {5818#true} assume true; {5818#true} is VALID [2022-04-28 04:09:13,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5818#true} {5818#true} #38#return; {5818#true} is VALID [2022-04-28 04:09:13,280 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 04:09:13,280 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 04:09:13,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {5818#true} assume true; {5818#true} is VALID [2022-04-28 04:09:13,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5818#true} {5818#true} #38#return; {5818#true} is VALID [2022-04-28 04:09:13,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {5818#true} call #t~ret7 := main(); {5818#true} is VALID [2022-04-28 04:09:13,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {5818#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5818#true} is VALID [2022-04-28 04:09:13,280 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 04:09:13,281 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 04:09:13,282 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 04:09:13,282 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 04:09:13,283 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 04:09:13,283 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 04:09:13,284 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 04:09:13,285 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 04:09:13,285 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 04:09:13,286 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 04:09:13,286 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 04:09:13,287 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 04:09:13,287 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 04:09:13,288 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 04:09:13,288 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 04:09:13,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {5819#false} assume !false; {5819#false} is VALID [2022-04-28 04:09:13,289 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 04:09:13,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:13,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547502706] [2022-04-28 04:09:13,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547502706] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:09:13,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251341308] [2022-04-28 04:09:13,289 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:09:13,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:09:13,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:09:13,290 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 04:09:13,315 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 04:09:13,448 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:09:13,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:09:13,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 04:09:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:13,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:09:15,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {5818#true} call ULTIMATE.init(); {5818#true} is VALID [2022-04-28 04:09:15,324 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 04:09:15,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {5818#true} assume true; {5818#true} is VALID [2022-04-28 04:09:15,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5818#true} {5818#true} #38#return; {5818#true} is VALID [2022-04-28 04:09:15,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {5818#true} call #t~ret7 := main(); {5818#true} is VALID [2022-04-28 04:09:15,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {5818#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5818#true} is VALID [2022-04-28 04:09:15,324 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 04:09:15,325 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 04:09:15,327 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 04:09:15,328 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 04:09:15,329 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 04:09:15,329 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 04:09:15,330 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 04:09:15,330 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 04:09:15,331 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 04:09:15,331 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 04:09:15,332 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 04:09:15,333 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 04:09:15,333 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 04:09:15,333 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 04:09:15,334 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 04:09:15,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {5819#false} assume !false; {5819#false} is VALID [2022-04-28 04:09:15,334 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 04:09:15,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:09:35,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {5819#false} assume !false; {5819#false} is VALID [2022-04-28 04:09:35,718 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 04:09:35,718 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 04:09:35,719 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 04:09:35,729 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 04:09:35,730 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 04:09:35,733 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 04:09:35,741 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 04:09:35,748 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 04:09:35,749 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 04:09:35,750 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 04:09:35,751 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 04:09:35,753 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 04:09:35,755 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 04:09:35,757 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 04:09:35,757 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 04:09:35,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {5818#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {5818#true} is VALID [2022-04-28 04:09:35,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {5818#true} call #t~ret7 := main(); {5818#true} is VALID [2022-04-28 04:09:35,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5818#true} {5818#true} #38#return; {5818#true} is VALID [2022-04-28 04:09:35,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {5818#true} assume true; {5818#true} is VALID [2022-04-28 04:09:35,758 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 04:09:35,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {5818#true} call ULTIMATE.init(); {5818#true} is VALID [2022-04-28 04:09:35,758 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 04:09:35,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251341308] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:09:35,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:09:35,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 27 [2022-04-28 04:09:35,758 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:35,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1255823849] [2022-04-28 04:09:35,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1255823849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:35,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:35,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 04:09:35,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840781265] [2022-04-28 04:09:35,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:35,759 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 04:09:35,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:35,759 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 04:09:35,772 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 04:09:35,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 04:09:35,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:35,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 04:09:35,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2022-04-28 04:09:35,773 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 04:09:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:36,025 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 04:09:36,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 04:09:36,026 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 04:09:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:36,026 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 04:09:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 30 transitions. [2022-04-28 04:09:36,026 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 04:09:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 30 transitions. [2022-04-28 04:09:36,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 30 transitions. [2022-04-28 04:09:36,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:36,055 INFO L225 Difference]: With dead ends: 30 [2022-04-28 04:09:36,055 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 04:09:36,056 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 04:09:36,056 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 04:09:36,056 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 04:09:36,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 04:09:36,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 04:09:36,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:36,081 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 04:09:36,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 04:09:36,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 04:09:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:36,082 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 04:09:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 04:09:36,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:36,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:36,082 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 04:09:36,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 04:09:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:36,083 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 04:09:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 04:09:36,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:36,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:36,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:36,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:36,083 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 04:09:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-28 04:09:36,084 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2022-04-28 04:09:36,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:36,084 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-28 04:09:36,084 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 04:09:36,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-28 04:09:36,108 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 04:09:36,108 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 04:09:36,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 04:09:36,108 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:36,108 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:36,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 04:09:36,311 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 04:09:36,311 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:36,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:36,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2123642839, now seen corresponding path program 23 times [2022-04-28 04:09:36,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:36,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [825414647] [2022-04-28 04:09:36,314 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:09:36,314 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:09:36,314 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:09:36,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2123642839, now seen corresponding path program 24 times [2022-04-28 04:09:36,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:36,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732999107] [2022-04-28 04:09:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:36,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:36,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:36,494 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 04:09:36,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {6167#true} assume true; {6167#true} is VALID [2022-04-28 04:09:36,495 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6167#true} {6167#true} #38#return; {6167#true} is VALID [2022-04-28 04:09:36,495 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 04:09:36,495 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 04:09:36,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {6167#true} assume true; {6167#true} is VALID [2022-04-28 04:09:36,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6167#true} {6167#true} #38#return; {6167#true} is VALID [2022-04-28 04:09:36,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {6167#true} call #t~ret7 := main(); {6167#true} is VALID [2022-04-28 04:09:36,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {6167#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6167#true} is VALID [2022-04-28 04:09:36,496 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 04:09:36,496 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 04:09:36,497 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 04:09:36,498 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 04:09:36,498 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 04:09:36,499 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 04:09:36,499 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 04:09:36,500 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 04:09:36,501 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 04:09:36,501 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 04:09:36,502 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 04:09:36,502 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 04:09:36,503 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 04:09:36,504 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 04:09:36,504 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 04:09:36,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {6168#false} assume !false; {6168#false} is VALID [2022-04-28 04:09:36,504 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 04:09:36,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:36,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732999107] [2022-04-28 04:09:36,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732999107] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:09:36,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873289102] [2022-04-28 04:09:36,505 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:09:36,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:09:36,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:09:36,506 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 04:09:36,507 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 04:09:36,637 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 04:09:36,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:09:36,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 04:09:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:36,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:09:39,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {6167#true} call ULTIMATE.init(); {6167#true} is VALID [2022-04-28 04:09:39,092 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 04:09:39,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {6167#true} assume true; {6167#true} is VALID [2022-04-28 04:09:39,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6167#true} {6167#true} #38#return; {6167#true} is VALID [2022-04-28 04:09:39,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {6167#true} call #t~ret7 := main(); {6167#true} is VALID [2022-04-28 04:09:39,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {6167#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6167#true} is VALID [2022-04-28 04:09:39,092 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 04:09:39,093 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 04:09:39,093 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 04:09:39,094 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 04:09:39,094 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 04:09:39,095 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 04:09:39,095 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 04:09:39,096 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 04:09:39,097 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 04:09:39,097 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 04:09:39,098 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 04:09:39,098 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 04:09:39,099 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 04:09:39,099 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 04:09:39,100 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 04:09:39,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {6168#false} assume !false; {6168#false} is VALID [2022-04-28 04:09:39,100 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 04:09:39,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:09:51,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {6168#false} assume !false; {6168#false} is VALID [2022-04-28 04:09:51,481 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 04:09:51,481 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 04:09:51,482 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 04:09:51,483 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 04:09:51,485 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 04:09:51,487 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 04:09:51,488 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 04:09:51,489 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 04:09:51,491 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 04:09:51,492 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 04:09:51,494 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 04:09:51,495 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 04:09:51,543 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 04:09:51,546 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 04:09:51,546 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 04:09:51,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {6167#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6167#true} is VALID [2022-04-28 04:09:51,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {6167#true} call #t~ret7 := main(); {6167#true} is VALID [2022-04-28 04:09:51,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6167#true} {6167#true} #38#return; {6167#true} is VALID [2022-04-28 04:09:51,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {6167#true} assume true; {6167#true} is VALID [2022-04-28 04:09:51,546 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 04:09:51,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {6167#true} call ULTIMATE.init(); {6167#true} is VALID [2022-04-28 04:09:51,547 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 04:09:51,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873289102] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:09:51,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:09:51,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 04:09:51,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:51,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [825414647] [2022-04-28 04:09:51,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [825414647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:51,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:51,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 04:09:51,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396393845] [2022-04-28 04:09:51,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:51,548 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 04:09:51,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:51,548 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 04:09:51,564 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 04:09:51,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 04:09:51,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:51,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 04:09:51,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=522, Unknown=0, NotChecked=0, Total=870 [2022-04-28 04:09:51,565 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 04:09:51,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:51,956 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 04:09:51,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 04:09:51,957 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 04:09:51,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:51,957 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 04:09:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 33 transitions. [2022-04-28 04:09:51,957 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 04:09:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 33 transitions. [2022-04-28 04:09:51,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 33 transitions. [2022-04-28 04:09:51,985 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 04:09:51,986 INFO L225 Difference]: With dead ends: 33 [2022-04-28 04:09:51,986 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 04:09:51,986 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 04:09:51,987 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:51,987 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.0s Time] [2022-04-28 04:09:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 04:09:52,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-04-28 04:09:52,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:52,014 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 04:09:52,015 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 04:09:52,015 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 04:09:52,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:52,015 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 04:09:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 04:09:52,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:52,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:52,016 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 04:09:52,016 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 04:09:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:52,016 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 04:09:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 04:09:52,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:52,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:52,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:52,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:52,016 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 04:09:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-04-28 04:09:52,017 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2022-04-28 04:09:52,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:52,017 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-04-28 04:09:52,017 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 04:09:52,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2022-04-28 04:09:52,043 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 04:09:52,044 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-28 04:09:52,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 04:09:52,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:52,044 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:52,050 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 04:09:52,248 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 04:09:52,248 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:52,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:52,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1408415498, now seen corresponding path program 23 times [2022-04-28 04:09:52,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:52,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1741701617] [2022-04-28 04:09:52,250 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:09:52,250 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:09:52,250 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:09:52,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1408415498, now seen corresponding path program 24 times [2022-04-28 04:09:52,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:52,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698694165] [2022-04-28 04:09:52,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:52,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:52,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:52,469 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 04:09:52,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {6541#true} assume true; {6541#true} is VALID [2022-04-28 04:09:52,469 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6541#true} {6541#true} #38#return; {6541#true} is VALID [2022-04-28 04:09:52,470 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 04:09:52,470 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 04:09:52,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {6541#true} assume true; {6541#true} is VALID [2022-04-28 04:09:52,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6541#true} {6541#true} #38#return; {6541#true} is VALID [2022-04-28 04:09:52,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {6541#true} call #t~ret7 := main(); {6541#true} is VALID [2022-04-28 04:09:52,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {6541#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6541#true} is VALID [2022-04-28 04:09:52,471 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 04:09:52,471 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 04:09:52,472 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 04:09:52,473 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 04:09:52,473 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 04:09:52,474 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 04:09:52,475 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 04:09:52,475 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 04:09:52,476 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 04:09:52,476 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 04:09:52,477 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 04:09:52,478 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 04:09:52,478 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 04:09:52,479 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 04:09:52,479 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 04:09:52,481 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 04:09:52,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {6542#false} assume !false; {6542#false} is VALID [2022-04-28 04:09:52,481 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 04:09:52,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:52,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698694165] [2022-04-28 04:09:52,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698694165] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:09:52,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483484611] [2022-04-28 04:09:52,482 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:09:52,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:09:52,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:09:52,483 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 04:09:52,484 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 04:09:52,678 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 04:09:52,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:09:52,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 04:09:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:52,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:09:54,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {6541#true} call ULTIMATE.init(); {6541#true} is VALID [2022-04-28 04:09:54,735 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 04:09:54,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {6541#true} assume true; {6541#true} is VALID [2022-04-28 04:09:54,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6541#true} {6541#true} #38#return; {6541#true} is VALID [2022-04-28 04:09:54,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {6541#true} call #t~ret7 := main(); {6541#true} is VALID [2022-04-28 04:09:54,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {6541#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6541#true} is VALID [2022-04-28 04:09:54,736 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 04:09:54,737 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 04:09:54,737 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 04:09:54,738 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 04:09:54,738 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 04:09:54,739 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 04:09:54,739 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 04:09:54,740 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 04:09:54,741 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 04:09:54,741 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 04:09:54,742 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 04:09:54,742 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 04:09:54,743 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 04:09:54,743 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 04:09:54,744 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 04:09:54,744 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 04:09:54,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {6542#false} assume !false; {6542#false} is VALID [2022-04-28 04:09:54,744 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 04:09:54,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:10:10,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {6542#false} assume !false; {6542#false} is VALID [2022-04-28 04:10:10,064 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 04:10:10,064 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 04:10:10,064 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 04:10:10,070 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 04:10:10,072 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 04:10:10,073 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 04:10:10,075 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 04:10:10,076 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 04:10:10,078 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 04:10:10,081 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 04:10:10,082 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 04:10:10,187 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 04:10:10,189 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 04:10:10,198 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 04:10:10,214 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 04:10:10,214 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 04:10:10,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {6541#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6541#true} is VALID [2022-04-28 04:10:10,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {6541#true} call #t~ret7 := main(); {6541#true} is VALID [2022-04-28 04:10:10,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6541#true} {6541#true} #38#return; {6541#true} is VALID [2022-04-28 04:10:10,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {6541#true} assume true; {6541#true} is VALID [2022-04-28 04:10:10,214 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 04:10:10,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {6541#true} call ULTIMATE.init(); {6541#true} is VALID [2022-04-28 04:10:10,215 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 04:10:10,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483484611] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:10:10,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:10:10,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 29 [2022-04-28 04:10:10,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:10,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1741701617] [2022-04-28 04:10:10,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1741701617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:10,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:10,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 04:10:10,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647950526] [2022-04-28 04:10:10,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:10,217 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 04:10:10,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:10,217 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 04:10:10,231 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 04:10:10,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 04:10:10,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:10,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 04:10:10,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2022-04-28 04:10:10,231 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 04:10:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:10,468 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 04:10:10,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 04:10:10,468 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 04:10:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:10,468 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 04:10:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 31 transitions. [2022-04-28 04:10:10,469 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 04:10:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 31 transitions. [2022-04-28 04:10:10,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 31 transitions. [2022-04-28 04:10:10,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:10,491 INFO L225 Difference]: With dead ends: 31 [2022-04-28 04:10:10,491 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 04:10:10,491 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 04:10:10,492 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 04:10:10,492 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 04:10:10,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 04:10:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 04:10:10,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:10,516 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 04:10:10,516 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 04:10:10,516 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 04:10:10,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:10,517 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 04:10:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 04:10:10,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:10,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:10,517 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 04:10:10,517 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 04:10:10,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:10,518 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 04:10:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 04:10:10,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:10,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:10,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:10,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:10,518 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 04:10:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-28 04:10:10,518 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2022-04-28 04:10:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:10,518 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-28 04:10:10,519 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 04:10:10,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-28 04:10:10,542 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 04:10:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 04:10:10,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 04:10:10,542 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:10,542 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:10,546 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 04:10:10,742 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 04:10:10,743 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:10,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:10,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1408366679, now seen corresponding path program 25 times [2022-04-28 04:10:10,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:10,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1589328903] [2022-04-28 04:10:10,745 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:10:10,745 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:10:10,745 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:10:10,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1408366679, now seen corresponding path program 26 times [2022-04-28 04:10:10,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:10,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452981038] [2022-04-28 04:10:10,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:10,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:10,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:10,937 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 04:10:10,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {6906#true} assume true; {6906#true} is VALID [2022-04-28 04:10:10,937 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6906#true} {6906#true} #38#return; {6906#true} is VALID [2022-04-28 04:10:10,937 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 04:10:10,937 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 04:10:10,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {6906#true} assume true; {6906#true} is VALID [2022-04-28 04:10:10,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6906#true} {6906#true} #38#return; {6906#true} is VALID [2022-04-28 04:10:10,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {6906#true} call #t~ret7 := main(); {6906#true} is VALID [2022-04-28 04:10:10,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {6906#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6906#true} is VALID [2022-04-28 04:10:10,938 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 04:10:10,939 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 04:10:10,939 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 04:10:10,940 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 04:10:10,940 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 04:10:10,941 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 04:10:10,942 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 04:10:10,942 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 04:10:10,943 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 04:10:10,943 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 04:10:10,944 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 04:10:10,944 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 04:10:10,945 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 04:10:10,946 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 04:10:10,946 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 04:10:10,947 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 04:10:10,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {6907#false} assume !false; {6907#false} is VALID [2022-04-28 04:10:10,947 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 04:10:10,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:10,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452981038] [2022-04-28 04:10:10,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452981038] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:10:10,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030716066] [2022-04-28 04:10:10,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:10:10,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:10:10,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:10:10,948 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 04:10:10,949 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 04:10:11,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:10:11,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:10:11,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 04:10:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:11,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:10:14,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {6906#true} call ULTIMATE.init(); {6906#true} is VALID [2022-04-28 04:10:14,021 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 04:10:14,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {6906#true} assume true; {6906#true} is VALID [2022-04-28 04:10:14,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6906#true} {6906#true} #38#return; {6906#true} is VALID [2022-04-28 04:10:14,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {6906#true} call #t~ret7 := main(); {6906#true} is VALID [2022-04-28 04:10:14,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {6906#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6906#true} is VALID [2022-04-28 04:10:14,022 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 04:10:14,023 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 04:10:14,023 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 04:10:14,027 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 04:10:14,027 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 04:10:14,028 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 04:10:14,028 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 04:10:14,029 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 04:10:14,030 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 04:10:14,030 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 04:10:14,031 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 04:10:14,031 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 04:10:14,032 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 04:10:14,032 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 04:10:14,033 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 04:10:14,033 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 04:10:14,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {6907#false} assume !false; {6907#false} is VALID [2022-04-28 04:10:14,034 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 04:10:14,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:10:26,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {6907#false} assume !false; {6907#false} is VALID [2022-04-28 04:10:26,592 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 04:10:26,592 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 04:10:26,594 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 04:10:26,595 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 04:10:26,620 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 04:10:26,623 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 04:10:26,625 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 04:10:26,628 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 04:10:26,635 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 04:10:26,638 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 04:10:26,639 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 04:10:26,641 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 04:10:26,642 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 04:10:26,653 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 04:10:26,654 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 04:10:26,655 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 04:10:26,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {6906#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {6906#true} is VALID [2022-04-28 04:10:26,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {6906#true} call #t~ret7 := main(); {6906#true} is VALID [2022-04-28 04:10:26,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6906#true} {6906#true} #38#return; {6906#true} is VALID [2022-04-28 04:10:26,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {6906#true} assume true; {6906#true} is VALID [2022-04-28 04:10:26,655 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 04:10:26,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {6906#true} call ULTIMATE.init(); {6906#true} is VALID [2022-04-28 04:10:26,656 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 04:10:26,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030716066] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:10:26,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:10:26,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 04:10:26,656 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:26,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1589328903] [2022-04-28 04:10:26,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1589328903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:26,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:26,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 04:10:26,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844541338] [2022-04-28 04:10:26,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:26,657 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 04:10:26,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:26,657 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 04:10:26,671 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 04:10:26,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 04:10:26,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:26,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 04:10:26,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=590, Unknown=0, NotChecked=0, Total=992 [2022-04-28 04:10:26,672 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 04:10:27,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:27,140 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 04:10:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 04:10:27,141 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 04:10:27,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:27,141 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 04:10:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 34 transitions. [2022-04-28 04:10:27,141 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 04:10:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 34 transitions. [2022-04-28 04:10:27,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 34 transitions. [2022-04-28 04:10:27,170 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 04:10:27,171 INFO L225 Difference]: With dead ends: 34 [2022-04-28 04:10:27,171 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 04:10:27,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 12 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=836, Invalid=1234, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 04:10:27,172 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 04:10:27,172 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 04:10:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 04:10:27,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-04-28 04:10:27,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:27,200 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 04:10:27,200 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 04:10:27,200 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 04:10:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:27,201 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 04:10:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 04:10:27,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:27,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:27,201 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 04:10:27,201 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 04:10:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:27,202 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 04:10:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 04:10:27,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:27,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:27,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:27,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:27,202 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 04:10:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-28 04:10:27,202 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 23 [2022-04-28 04:10:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:27,203 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-28 04:10:27,203 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 04:10:27,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-28 04:10:27,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:27,230 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 04:10:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 04:10:27,230 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:27,231 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:27,249 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 04:10:27,431 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 04:10:27,431 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:27,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:27,431 INFO L85 PathProgramCache]: Analyzing trace with hash -709691018, now seen corresponding path program 25 times [2022-04-28 04:10:27,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:27,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [778106850] [2022-04-28 04:10:27,433 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:10:27,433 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:10:27,433 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:10:27,434 INFO L85 PathProgramCache]: Analyzing trace with hash -709691018, now seen corresponding path program 26 times [2022-04-28 04:10:27,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:27,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553209297] [2022-04-28 04:10:27,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:27,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:27,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:27,658 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 04:10:27,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {7296#true} assume true; {7296#true} is VALID [2022-04-28 04:10:27,658 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7296#true} {7296#true} #38#return; {7296#true} is VALID [2022-04-28 04:10:27,658 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 04:10:27,658 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 04:10:27,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {7296#true} assume true; {7296#true} is VALID [2022-04-28 04:10:27,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7296#true} {7296#true} #38#return; {7296#true} is VALID [2022-04-28 04:10:27,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {7296#true} call #t~ret7 := main(); {7296#true} is VALID [2022-04-28 04:10:27,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {7296#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {7296#true} is VALID [2022-04-28 04:10:27,659 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 04:10:27,660 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 04:10:27,660 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 04:10:27,661 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 04:10:27,661 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 04:10:27,662 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 04:10:27,663 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 04:10:27,663 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 04:10:27,664 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 04:10:27,664 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 04:10:27,665 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 04:10:27,665 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 04:10:27,666 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 04:10:27,667 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 04:10:27,667 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 04:10:27,667 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 04:10:27,668 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 04:10:27,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {7297#false} assume !false; {7297#false} is VALID [2022-04-28 04:10:27,668 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 04:10:27,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:27,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553209297] [2022-04-28 04:10:27,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553209297] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:10:27,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711337340] [2022-04-28 04:10:27,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:10:27,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:10:27,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:10:27,670 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 04:10:27,671 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 04:10:27,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:10:27,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:10:27,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 04:10:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:27,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:10:30,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {7296#true} call ULTIMATE.init(); {7296#true} is VALID [2022-04-28 04:10:30,022 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 04:10:30,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {7296#true} assume true; {7296#true} is VALID [2022-04-28 04:10:30,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7296#true} {7296#true} #38#return; {7296#true} is VALID [2022-04-28 04:10:30,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {7296#true} call #t~ret7 := main(); {7296#true} is VALID [2022-04-28 04:10:30,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {7296#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {7296#true} is VALID [2022-04-28 04:10:30,023 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 04:10:30,023 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 04:10:30,024 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 04:10:30,025 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 04:10:30,025 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 04:10:30,026 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 04:10:30,026 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 04:10:30,027 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 04:10:30,027 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 04:10:30,028 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 04:10:30,028 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 04:10:30,029 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 04:10:30,030 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 04:10:30,030 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 04:10:30,030 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 04:10:30,031 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 04:10:30,031 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 04:10:30,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {7297#false} assume !false; {7297#false} is VALID [2022-04-28 04:10:30,031 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 04:10:30,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:10:49,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {7297#false} assume !false; {7297#false} is VALID [2022-04-28 04:10:49,808 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 04:10:49,809 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 04:10:49,809 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 04:10:49,810 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 04:10:49,811 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 04:10:49,822 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 04:10:49,825 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 04:10:49,835 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 04:10:49,837 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 04:10:49,844 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 04:10:49,847 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 04:10:49,857 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 04:10:49,858 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 04:10:49,861 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 04:10:49,863 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 04:10:49,864 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 04:10:49,865 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 04:10:49,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {7296#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {7296#true} is VALID [2022-04-28 04:10:49,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {7296#true} call #t~ret7 := main(); {7296#true} is VALID [2022-04-28 04:10:49,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7296#true} {7296#true} #38#return; {7296#true} is VALID [2022-04-28 04:10:49,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {7296#true} assume true; {7296#true} is VALID [2022-04-28 04:10:49,865 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 04:10:49,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {7296#true} call ULTIMATE.init(); {7296#true} is VALID [2022-04-28 04:10:49,865 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 04:10:49,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711337340] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:10:49,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:10:49,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 31 [2022-04-28 04:10:49,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:49,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [778106850] [2022-04-28 04:10:49,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [778106850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:49,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:49,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 04:10:49,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997379842] [2022-04-28 04:10:49,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:49,867 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 04:10:49,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:49,867 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 04:10:49,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:49,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 04:10:49,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:49,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 04:10:49,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2022-04-28 04:10:49,881 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 04:10:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:50,139 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 04:10:50,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 04:10:50,139 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 04:10:50,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:50,139 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 04:10:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 32 transitions. [2022-04-28 04:10:50,140 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 04:10:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 32 transitions. [2022-04-28 04:10:50,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 32 transitions. [2022-04-28 04:10:50,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:50,161 INFO L225 Difference]: With dead ends: 32 [2022-04-28 04:10:50,161 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 04:10:50,162 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 04:10:50,162 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 04:10:50,163 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 04:10:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 04:10:50,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 04:10:50,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:50,197 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 04:10:50,198 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 04:10:50,198 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 04:10:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:50,198 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 04:10:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 04:10:50,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:50,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:50,198 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 04:10:50,199 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 04:10:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:50,199 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 04:10:50,199 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 04:10:50,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:50,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:50,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:50,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:50,199 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 04:10:50,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-28 04:10:50,200 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2022-04-28 04:10:50,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:50,200 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-28 04:10:50,200 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 04:10:50,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-28 04:10:50,246 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 04:10:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 04:10:50,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 04:10:50,246 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:50,246 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:50,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 04:10:50,447 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 04:10:50,447 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:50,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:50,447 INFO L85 PathProgramCache]: Analyzing trace with hash -709642199, now seen corresponding path program 27 times [2022-04-28 04:10:50,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:50,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1007673375] [2022-04-28 04:10:50,449 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:10:50,449 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:10:50,449 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:10:50,449 INFO L85 PathProgramCache]: Analyzing trace with hash -709642199, now seen corresponding path program 28 times [2022-04-28 04:10:50,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:50,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029483598] [2022-04-28 04:10:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:50,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:50,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:50,653 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 04:10:50,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {7677#true} assume true; {7677#true} is VALID [2022-04-28 04:10:50,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7677#true} {7677#true} #38#return; {7677#true} is VALID [2022-04-28 04:10:50,654 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 04:10:50,654 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 04:10:50,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {7677#true} assume true; {7677#true} is VALID [2022-04-28 04:10:50,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7677#true} {7677#true} #38#return; {7677#true} is VALID [2022-04-28 04:10:50,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {7677#true} call #t~ret7 := main(); {7677#true} is VALID [2022-04-28 04:10:50,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {7677#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {7677#true} is VALID [2022-04-28 04:10:50,654 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 04:10:50,655 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 04:10:50,656 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 04:10:50,656 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 04:10:50,657 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 04:10:50,657 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 04:10:50,658 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 04:10:50,659 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 04:10:50,659 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 04:10:50,660 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 04:10:50,660 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 04:10:50,661 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 04:10:50,662 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 04:10:50,662 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 04:10:50,663 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 04:10:50,663 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 04:10:50,664 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 04:10:50,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {7678#false} assume !false; {7678#false} is VALID [2022-04-28 04:10:50,664 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 04:10:50,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:50,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029483598] [2022-04-28 04:10:50,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029483598] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:10:50,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506277381] [2022-04-28 04:10:50,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:10:50,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:10:50,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:10:50,666 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 04:10:50,667 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 04:10:51,160 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:10:51,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:10:51,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 04:10:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:51,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:10:53,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {7677#true} call ULTIMATE.init(); {7677#true} is VALID [2022-04-28 04:10:53,772 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 04:10:53,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {7677#true} assume true; {7677#true} is VALID [2022-04-28 04:10:53,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7677#true} {7677#true} #38#return; {7677#true} is VALID [2022-04-28 04:10:53,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {7677#true} call #t~ret7 := main(); {7677#true} is VALID [2022-04-28 04:10:53,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {7677#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {7677#true} is VALID [2022-04-28 04:10:53,773 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 04:10:53,774 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 04:10:53,774 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 04:10:53,775 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 04:10:53,775 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 04:10:53,776 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 04:10:53,776 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 04:10:53,777 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 04:10:53,778 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 04:10:53,778 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 04:10:53,779 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 04:10:53,779 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 04:10:53,780 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 04:10:53,780 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 04:10:53,781 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 04:10:53,781 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 04:10:53,782 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 04:10:53,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {7678#false} assume !false; {7678#false} is VALID [2022-04-28 04:10:53,782 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 04:10:53,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:11:10,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {7678#false} assume !false; {7678#false} is VALID [2022-04-28 04:11:10,655 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 04:11:10,656 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 04:11:10,657 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 04:11:10,658 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 04:11:10,663 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 04:11:10,666 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 04:11:10,668 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 04:11:10,670 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 04:11:10,694 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 04:11:10,697 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 04:11:10,698 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 04:11:10,709 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 04:11:10,712 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 04:11:10,715 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 04:11:10,745 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 04:11:10,751 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 04:11:10,752 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 04:11:10,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {7677#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {7677#true} is VALID [2022-04-28 04:11:10,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {7677#true} call #t~ret7 := main(); {7677#true} is VALID [2022-04-28 04:11:10,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7677#true} {7677#true} #38#return; {7677#true} is VALID [2022-04-28 04:11:10,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {7677#true} assume true; {7677#true} is VALID [2022-04-28 04:11:10,752 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 04:11:10,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {7677#true} call ULTIMATE.init(); {7677#true} is VALID [2022-04-28 04:11:10,752 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 04:11:10,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506277381] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:11:10,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:11:10,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 04:11:10,753 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:10,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1007673375] [2022-04-28 04:11:10,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1007673375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:10,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:10,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 04:11:10,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237819710] [2022-04-28 04:11:10,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:10,754 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 04:11:10,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:10,754 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 04:11:10,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:10,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 04:11:10,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:10,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 04:11:10,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=662, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 04:11:10,768 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 04:11:11,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:11,265 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 04:11:11,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 04:11:11,265 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 04:11:11,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:11,265 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 04:11:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 35 transitions. [2022-04-28 04:11:11,266 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 04:11:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 35 transitions. [2022-04-28 04:11:11,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 35 transitions. [2022-04-28 04:11:11,293 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 04:11:11,294 INFO L225 Difference]: With dead ends: 35 [2022-04-28 04:11:11,294 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 04:11:11,295 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 04:11:11,295 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 04:11:11,295 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 04:11:11,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 04:11:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-04-28 04:11:11,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:11,326 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 04:11:11,327 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 04:11:11,327 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 04:11:11,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:11,327 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 04:11:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 04:11:11,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:11,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:11,328 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 04:11:11,328 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 04:11:11,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:11,328 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 04:11:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 04:11:11,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:11,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:11,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:11,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:11,328 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 04:11:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-04-28 04:11:11,329 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2022-04-28 04:11:11,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:11,329 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-04-28 04:11:11,329 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 04:11:11,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 31 transitions. [2022-04-28 04:11:11,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:11,360 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 04:11:11,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 04:11:11,360 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:11,360 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:11,386 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 04:11:11,560 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 04:11:11,561 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:11,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:11,561 INFO L85 PathProgramCache]: Analyzing trace with hash -524068618, now seen corresponding path program 27 times [2022-04-28 04:11:11,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:11,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1803496001] [2022-04-28 04:11:11,563 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:11,563 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:11:11,563 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:11:11,563 INFO L85 PathProgramCache]: Analyzing trace with hash -524068618, now seen corresponding path program 28 times [2022-04-28 04:11:11,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:11,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935923722] [2022-04-28 04:11:11,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:11,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:11,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:11,812 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 04:11:11,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {8083#true} assume true; {8083#true} is VALID [2022-04-28 04:11:11,813 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8083#true} {8083#true} #38#return; {8083#true} is VALID [2022-04-28 04:11:11,813 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 04:11:11,813 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 04:11:11,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {8083#true} assume true; {8083#true} is VALID [2022-04-28 04:11:11,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8083#true} {8083#true} #38#return; {8083#true} is VALID [2022-04-28 04:11:11,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {8083#true} call #t~ret7 := main(); {8083#true} is VALID [2022-04-28 04:11:11,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {8083#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8083#true} is VALID [2022-04-28 04:11:11,814 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 04:11:11,814 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 04:11:11,815 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 04:11:11,815 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 04:11:11,816 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 04:11:11,817 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 04:11:11,817 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 04:11:11,818 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 04:11:11,818 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 04:11:11,819 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 04:11:11,819 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 04:11:11,820 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 04:11:11,820 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 04:11:11,821 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 04:11:11,822 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 04:11:11,822 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 04:11:11,822 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 04:11:11,823 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 04:11:11,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {8084#false} assume !false; {8084#false} is VALID [2022-04-28 04:11:11,823 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 04:11:11,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:11,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935923722] [2022-04-28 04:11:11,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935923722] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:11:11,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596046328] [2022-04-28 04:11:11,823 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:11:11,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:11:11,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:11:11,824 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 04:11:11,825 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 04:11:11,950 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:11:11,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:11:11,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 04:11:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:12,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:11:14,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {8083#true} call ULTIMATE.init(); {8083#true} is VALID [2022-04-28 04:11:14,375 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 04:11:14,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {8083#true} assume true; {8083#true} is VALID [2022-04-28 04:11:14,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8083#true} {8083#true} #38#return; {8083#true} is VALID [2022-04-28 04:11:14,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {8083#true} call #t~ret7 := main(); {8083#true} is VALID [2022-04-28 04:11:14,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {8083#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8083#true} is VALID [2022-04-28 04:11:14,375 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 04:11:14,376 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 04:11:14,377 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 04:11:14,377 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 04:11:14,378 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 04:11:14,378 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 04:11:14,379 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 04:11:14,379 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 04:11:14,380 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 04:11:14,380 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 04:11:14,381 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 04:11:14,382 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 04:11:14,382 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 04:11:14,383 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 04:11:14,384 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 04:11:14,385 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 04:11:14,385 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 04:11:14,385 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 04:11:14,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {8084#false} assume !false; {8084#false} is VALID [2022-04-28 04:11:14,386 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 04:11:14,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:11:30,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {8084#false} assume !false; {8084#false} is VALID [2022-04-28 04:11:30,441 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 04:11:30,441 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 04:11:30,441 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 04:11:30,442 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 04:11:30,449 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 04:11:30,455 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 04:11:30,456 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 04:11:30,499 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 04:11:30,503 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 04:11:30,519 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 04:11:30,525 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 04:11:30,526 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 04:11:30,528 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 04:11:30,539 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 04:11:30,540 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 04:11:30,542 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 04:11:30,705 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 04:11:30,706 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 04:11:30,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {8083#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8083#true} is VALID [2022-04-28 04:11:30,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {8083#true} call #t~ret7 := main(); {8083#true} is VALID [2022-04-28 04:11:30,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8083#true} {8083#true} #38#return; {8083#true} is VALID [2022-04-28 04:11:30,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {8083#true} assume true; {8083#true} is VALID [2022-04-28 04:11:30,706 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 04:11:30,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {8083#true} call ULTIMATE.init(); {8083#true} is VALID [2022-04-28 04:11:30,706 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 04:11:30,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596046328] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:11:30,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:11:30,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 33 [2022-04-28 04:11:30,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:30,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1803496001] [2022-04-28 04:11:30,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1803496001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:30,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:30,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 04:11:30,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623173043] [2022-04-28 04:11:30,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:30,707 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 04:11:30,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:30,708 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 04:11:30,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:30,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 04:11:30,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:30,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 04:11:30,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 04:11:30,723 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 04:11:31,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:31,024 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 04:11:31,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 04:11:31,025 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 04:11:31,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:31,025 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 04:11:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2022-04-28 04:11:31,025 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 04:11:31,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2022-04-28 04:11:31,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 33 transitions. [2022-04-28 04:11:31,049 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 04:11:31,049 INFO L225 Difference]: With dead ends: 33 [2022-04-28 04:11:31,049 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 04:11:31,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 23 SyntacticMatches, 15 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=993, Invalid=1263, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 04:11:31,050 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:31,051 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.0s Time] [2022-04-28 04:11:31,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 04:11:31,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 04:11:31,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:31,080 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 04:11:31,080 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 04:11:31,081 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 04:11:31,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:31,081 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 04:11:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 04:11:31,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:31,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:31,081 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 04:11:31,081 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 04:11:31,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:31,082 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 04:11:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 04:11:31,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:31,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:31,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:31,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:31,082 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 04:11:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-28 04:11:31,083 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2022-04-28 04:11:31,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:31,083 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-28 04:11:31,083 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 04:11:31,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-28 04:11:31,115 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 04:11:31,115 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 04:11:31,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 04:11:31,115 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:31,116 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:31,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-28 04:11:31,316 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 04:11:31,316 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:31,316 INFO L85 PathProgramCache]: Analyzing trace with hash -524019799, now seen corresponding path program 29 times [2022-04-28 04:11:31,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:31,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1738741625] [2022-04-28 04:11:31,318 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:31,318 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:11:31,318 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:11:31,318 INFO L85 PathProgramCache]: Analyzing trace with hash -524019799, now seen corresponding path program 30 times [2022-04-28 04:11:31,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:31,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876352898] [2022-04-28 04:11:31,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:31,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:31,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:31,540 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 04:11:31,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {8480#true} assume true; {8480#true} is VALID [2022-04-28 04:11:31,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8480#true} {8480#true} #38#return; {8480#true} is VALID [2022-04-28 04:11:31,540 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 04:11:31,541 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 04:11:31,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {8480#true} assume true; {8480#true} is VALID [2022-04-28 04:11:31,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8480#true} {8480#true} #38#return; {8480#true} is VALID [2022-04-28 04:11:31,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {8480#true} call #t~ret7 := main(); {8480#true} is VALID [2022-04-28 04:11:31,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {8480#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8480#true} is VALID [2022-04-28 04:11:31,541 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 04:11:31,542 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 04:11:31,542 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 04:11:31,543 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 04:11:31,543 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 04:11:31,544 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 04:11:31,544 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 04:11:31,545 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 04:11:31,546 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 04:11:31,546 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 04:11:31,547 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 04:11:31,547 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 04:11:31,548 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 04:11:31,548 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 04:11:31,549 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 04:11:31,550 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 04:11:31,550 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 04:11:31,550 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 04:11:31,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {8481#false} assume !false; {8481#false} is VALID [2022-04-28 04:11:31,551 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 04:11:31,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:31,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876352898] [2022-04-28 04:11:31,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876352898] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:11:31,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330783641] [2022-04-28 04:11:31,551 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:11:31,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:11:31,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:11:31,552 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 04:11:31,553 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 04:11:31,865 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 04:11:31,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:11:31,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 04:11:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:31,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:11:34,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {8480#true} call ULTIMATE.init(); {8480#true} is VALID [2022-04-28 04:11:34,754 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 04:11:34,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {8480#true} assume true; {8480#true} is VALID [2022-04-28 04:11:34,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8480#true} {8480#true} #38#return; {8480#true} is VALID [2022-04-28 04:11:34,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {8480#true} call #t~ret7 := main(); {8480#true} is VALID [2022-04-28 04:11:34,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {8480#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8480#true} is VALID [2022-04-28 04:11:34,755 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 04:11:34,755 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 04:11:34,756 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 04:11:34,756 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 04:11:34,757 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 04:11:34,758 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 04:11:34,758 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 04:11:34,759 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 04:11:34,759 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 04:11:34,760 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 04:11:34,760 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 04:11:34,761 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 04:11:34,762 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 04:11:34,762 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 04:11:34,763 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 04:11:34,763 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 04:11:34,764 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 04:11:34,764 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 04:11:34,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {8481#false} assume !false; {8481#false} is VALID [2022-04-28 04:11:34,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 04:11:34,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:11:51,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {8481#false} assume !false; {8481#false} is VALID [2022-04-28 04:11:51,269 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 04:11:51,269 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 04:11:51,271 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 04:11:51,274 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 04:11:51,277 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 04:11:51,279 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 04:11:51,281 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 04:11:51,283 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 04:11:51,285 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 04:11:51,286 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 04:11:51,287 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 04:11:51,292 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 04:11:51,293 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 04:11:51,298 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 04:11:51,300 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 04:11:51,303 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 04:11:51,307 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 04:11:51,308 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 04:11:51,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {8480#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8480#true} is VALID [2022-04-28 04:11:51,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {8480#true} call #t~ret7 := main(); {8480#true} is VALID [2022-04-28 04:11:51,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8480#true} {8480#true} #38#return; {8480#true} is VALID [2022-04-28 04:11:51,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {8480#true} assume true; {8480#true} is VALID [2022-04-28 04:11:51,308 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 04:11:51,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {8480#true} call ULTIMATE.init(); {8480#true} is VALID [2022-04-28 04:11:51,308 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 04:11:51,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330783641] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:11:51,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:11:51,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 04:11:51,309 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:51,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1738741625] [2022-04-28 04:11:51,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1738741625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:51,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:51,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 04:11:51,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552362770] [2022-04-28 04:11:51,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:51,309 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 04:11:51,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:51,310 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 04:11:51,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:51,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 04:11:51,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:51,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 04:11:51,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=738, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 04:11:51,328 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 04:11:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:51,869 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 04:11:51,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 04:11:51,869 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 04:11:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:51,869 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 04:11:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2022-04-28 04:11:51,870 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 04:11:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2022-04-28 04:11:51,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 36 transitions. [2022-04-28 04:11:51,906 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 04:11:51,906 INFO L225 Difference]: With dead ends: 36 [2022-04-28 04:11:51,906 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 04:11:51,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 21 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1082, Invalid=1570, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 04:11:51,907 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 04:11:51,908 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 04:11:51,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 04:11:51,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-28 04:11:51,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:51,937 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 04:11:51,937 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 04:11:51,937 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 04:11:51,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:51,937 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 04:11:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 04:11:51,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:51,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:51,938 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 04:11:51,938 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 04:11:51,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:51,938 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 04:11:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 04:11:51,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:51,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:51,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:51,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:51,938 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 04:11:51,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-28 04:11:51,939 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2022-04-28 04:11:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:51,939 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-28 04:11:51,939 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 04:11:51,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2022-04-28 04:11:51,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-28 04:11:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 04:11:51,968 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:51,968 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:51,974 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 04:11:52,168 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 04:11:52,168 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:52,169 INFO L85 PathProgramCache]: Analyzing trace with hash 935258486, now seen corresponding path program 29 times [2022-04-28 04:11:52,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:52,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [49725473] [2022-04-28 04:11:52,171 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:52,171 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:11:52,171 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:11:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash 935258486, now seen corresponding path program 30 times [2022-04-28 04:11:52,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:52,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620648047] [2022-04-28 04:11:52,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:52,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:52,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:52,421 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 04:11:52,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {8902#true} assume true; {8902#true} is VALID [2022-04-28 04:11:52,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8902#true} {8902#true} #38#return; {8902#true} is VALID [2022-04-28 04:11:52,422 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 04:11:52,422 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 04:11:52,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {8902#true} assume true; {8902#true} is VALID [2022-04-28 04:11:52,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8902#true} {8902#true} #38#return; {8902#true} is VALID [2022-04-28 04:11:52,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {8902#true} call #t~ret7 := main(); {8902#true} is VALID [2022-04-28 04:11:52,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {8902#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8902#true} is VALID [2022-04-28 04:11:52,422 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 04:11:52,423 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 04:11:52,423 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 04:11:52,424 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 04:11:52,424 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 04:11:52,425 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 04:11:52,426 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 04:11:52,426 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 04:11:52,427 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 04:11:52,427 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 04:11:52,428 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 04:11:52,428 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 04:11:52,429 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 04:11:52,429 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 04:11:52,430 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 04:11:52,430 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 04:11:52,431 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 04:11:52,431 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 04:11:52,432 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 04:11:52,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {8903#false} assume !false; {8903#false} is VALID [2022-04-28 04:11:52,432 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 04:11:52,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:52,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620648047] [2022-04-28 04:11:52,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620648047] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:11:52,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120136389] [2022-04-28 04:11:52,432 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:11:52,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:11:52,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:11:52,433 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 04:11:52,434 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 04:11:52,753 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 04:11:52,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:11:52,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 04:11:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:52,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:11:55,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {8902#true} call ULTIMATE.init(); {8902#true} is VALID [2022-04-28 04:11:55,323 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 04:11:55,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {8902#true} assume true; {8902#true} is VALID [2022-04-28 04:11:55,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8902#true} {8902#true} #38#return; {8902#true} is VALID [2022-04-28 04:11:55,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {8902#true} call #t~ret7 := main(); {8902#true} is VALID [2022-04-28 04:11:55,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {8902#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8902#true} is VALID [2022-04-28 04:11:55,323 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 04:11:55,324 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 04:11:55,325 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 04:11:55,325 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 04:11:55,326 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 04:11:55,326 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 04:11:55,327 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 04:11:55,327 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 04:11:55,328 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 04:11:55,329 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 04:11:55,329 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 04:11:55,330 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 04:11:55,330 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 04:11:55,331 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 04:11:55,331 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 04:11:55,332 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 04:11:55,332 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 04:11:55,333 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 04:11:55,333 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 04:11:55,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {8903#false} assume !false; {8903#false} is VALID [2022-04-28 04:11:55,333 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 04:11:55,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:12:15,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {8903#false} assume !false; {8903#false} is VALID [2022-04-28 04:12:15,506 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 04:12:15,507 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 04:12:15,507 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 04:12:15,509 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 04:12:15,511 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 04:12:15,512 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 04:12:15,521 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 04:12:15,524 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 04:12:15,526 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 04:12:15,531 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 04:12:15,589 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 04:12:15,598 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 04:12:15,600 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 04:12:15,601 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 04:12:15,602 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 04:12:15,605 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 04:12:15,606 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 04:12:15,609 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 04:12:15,610 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 04:12:15,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {8902#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {8902#true} is VALID [2022-04-28 04:12:15,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {8902#true} call #t~ret7 := main(); {8902#true} is VALID [2022-04-28 04:12:15,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8902#true} {8902#true} #38#return; {8902#true} is VALID [2022-04-28 04:12:15,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {8902#true} assume true; {8902#true} is VALID [2022-04-28 04:12:15,610 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 04:12:15,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {8902#true} call ULTIMATE.init(); {8902#true} is VALID [2022-04-28 04:12:15,610 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 04:12:15,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120136389] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:12:15,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:12:15,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 35 [2022-04-28 04:12:15,611 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:15,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [49725473] [2022-04-28 04:12:15,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [49725473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:15,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:15,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 04:12:15,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196472374] [2022-04-28 04:12:15,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:15,611 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 04:12:15,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:15,612 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 04:12:15,627 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 04:12:15,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 04:12:15,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:15,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 04:12:15,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 04:12:15,628 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 04:12:15,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:15,923 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 04:12:15,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 04:12:15,923 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 04:12:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:15,924 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 04:12:15,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2022-04-28 04:12:15,924 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 04:12:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2022-04-28 04:12:15,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 34 transitions. [2022-04-28 04:12:15,949 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 04:12:15,950 INFO L225 Difference]: With dead ends: 34 [2022-04-28 04:12:15,950 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 04:12:15,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 16 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1123, Invalid=1427, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 04:12:15,951 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 04:12:15,951 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 04:12:15,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 04:12:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 04:12:15,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:15,983 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 04:12:15,983 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 04:12:15,983 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 04:12:15,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:15,983 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 04:12:15,984 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 04:12:15,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:15,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:15,984 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 04:12:15,984 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 04:12:15,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:15,984 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 04:12:15,984 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 04:12:15,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:15,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:15,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:15,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:15,985 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 04:12:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-28 04:12:15,985 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2022-04-28 04:12:15,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:15,985 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-28 04:12:15,985 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 04:12:15,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-28 04:12:16,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:16,012 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 04:12:16,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 04:12:16,012 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:16,013 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:16,018 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 04:12:16,218 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 04:12:16,219 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:16,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:16,219 INFO L85 PathProgramCache]: Analyzing trace with hash 935307305, now seen corresponding path program 31 times [2022-04-28 04:12:16,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:16,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1706862701] [2022-04-28 04:12:16,224 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:16,224 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:12:16,224 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:12:16,224 INFO L85 PathProgramCache]: Analyzing trace with hash 935307305, now seen corresponding path program 32 times [2022-04-28 04:12:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:16,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752642876] [2022-04-28 04:12:16,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:16,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:16,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:16,497 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 04:12:16,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {9315#true} assume true; {9315#true} is VALID [2022-04-28 04:12:16,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9315#true} {9315#true} #38#return; {9315#true} is VALID [2022-04-28 04:12:16,502 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 04:12:16,502 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 04:12:16,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {9315#true} assume true; {9315#true} is VALID [2022-04-28 04:12:16,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9315#true} {9315#true} #38#return; {9315#true} is VALID [2022-04-28 04:12:16,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {9315#true} call #t~ret7 := main(); {9315#true} is VALID [2022-04-28 04:12:16,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {9315#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {9315#true} is VALID [2022-04-28 04:12:16,504 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 04:12:16,504 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 04:12:16,505 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 04:12:16,506 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 04:12:16,506 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 04:12:16,507 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 04:12:16,507 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 04:12:16,508 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 04:12:16,509 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 04:12:16,509 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 04:12:16,510 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 04:12:16,510 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 04:12:16,511 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 04:12:16,512 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 04:12:16,512 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 04:12:16,513 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 04:12:16,514 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 04:12:16,514 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 04:12:16,515 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 04:12:16,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {9316#false} assume !false; {9316#false} is VALID [2022-04-28 04:12:16,515 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 04:12:16,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:16,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752642876] [2022-04-28 04:12:16,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752642876] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:12:16,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642996990] [2022-04-28 04:12:16,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:12:16,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:12:16,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:12:16,516 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 04:12:16,517 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 04:12:16,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:12:16,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:12:16,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 04:12:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:16,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:12:19,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {9315#true} call ULTIMATE.init(); {9315#true} is VALID [2022-04-28 04:12:19,839 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 04:12:19,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {9315#true} assume true; {9315#true} is VALID [2022-04-28 04:12:19,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9315#true} {9315#true} #38#return; {9315#true} is VALID [2022-04-28 04:12:19,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {9315#true} call #t~ret7 := main(); {9315#true} is VALID [2022-04-28 04:12:19,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {9315#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {9315#true} is VALID [2022-04-28 04:12:19,840 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 04:12:19,841 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 04:12:19,841 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 04:12:19,842 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 04:12:19,842 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 04:12:19,843 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 04:12:19,843 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 04:12:19,844 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 04:12:19,845 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 04:12:19,845 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 04:12:19,846 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 04:12:19,846 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 04:12:19,847 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 04:12:19,847 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 04:12:19,848 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 04:12:19,848 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 04:12:19,849 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 04:12:19,849 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 04:12:19,850 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 04:12:19,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {9316#false} assume !false; {9316#false} is VALID [2022-04-28 04:12:19,850 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 04:12:19,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:12:40,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {9316#false} assume !false; {9316#false} is VALID [2022-04-28 04:12:40,952 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 04:12:40,952 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 04:12:40,954 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 04:12:40,955 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 04:12:40,957 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 04:12:40,962 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 04:12:40,964 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 04:12:40,966 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 04:12:40,967 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 04:12:41,052 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 04:12:41,072 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 04:12:41,078 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 04:12:41,080 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 04:12:41,090 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 04:12:41,100 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 04:12:41,103 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 04:12:41,107 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 04:12:41,111 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 04:12:41,111 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 04:12:41,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {9315#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {9315#true} is VALID [2022-04-28 04:12:41,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {9315#true} call #t~ret7 := main(); {9315#true} is VALID [2022-04-28 04:12:41,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9315#true} {9315#true} #38#return; {9315#true} is VALID [2022-04-28 04:12:41,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {9315#true} assume true; {9315#true} is VALID [2022-04-28 04:12:41,112 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 04:12:41,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {9315#true} call ULTIMATE.init(); {9315#true} is VALID [2022-04-28 04:12:41,112 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 04:12:41,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642996990] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:12:41,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:12:41,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 04:12:41,112 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:41,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1706862701] [2022-04-28 04:12:41,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1706862701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:41,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:41,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 04:12:41,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204799454] [2022-04-28 04:12:41,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:41,113 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 04:12:41,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:41,113 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 04:12:41,129 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 04:12:41,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 04:12:41,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:41,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 04:12:41,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=588, Invalid=818, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 04:12:41,130 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 04:12:41,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:41,669 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 04:12:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 04:12:41,669 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 04:12:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:41,669 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 04:12:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2022-04-28 04:12:41,670 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 04:12:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2022-04-28 04:12:41,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 37 transitions. [2022-04-28 04:12:41,697 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 04:12:41,698 INFO L225 Difference]: With dead ends: 37 [2022-04-28 04:12:41,698 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 04:12:41,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 21 SyntacticMatches, 15 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1217, Invalid=1753, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 04:12:41,699 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 04:12:41,699 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 04:12:41,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 04:12:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-28 04:12:41,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:41,741 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 04:12:41,741 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 04:12:41,741 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 04:12:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:41,741 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 04:12:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 04:12:41,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:41,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:41,742 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 04:12:41,742 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 04:12:41,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:41,742 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 04:12:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 04:12:41,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:41,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:41,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:41,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:41,743 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 04:12:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-04-28 04:12:41,743 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2022-04-28 04:12:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:41,743 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-04-28 04:12:41,743 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 04:12:41,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2022-04-28 04:12:41,773 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 04:12:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-28 04:12:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 04:12:41,773 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:41,774 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:41,790 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 04:12:41,974 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 04:12:41,974 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:41,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:41,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1070241546, now seen corresponding path program 31 times [2022-04-28 04:12:41,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:41,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [272766172] [2022-04-28 04:12:41,977 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:41,977 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:12:41,977 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:12:41,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1070241546, now seen corresponding path program 32 times [2022-04-28 04:12:41,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:41,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622267116] [2022-04-28 04:12:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:41,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:42,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:42,245 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 04:12:42,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {9753#true} assume true; {9753#true} is VALID [2022-04-28 04:12:42,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9753#true} {9753#true} #38#return; {9753#true} is VALID [2022-04-28 04:12:42,246 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 04:12:42,246 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 04:12:42,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {9753#true} assume true; {9753#true} is VALID [2022-04-28 04:12:42,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9753#true} {9753#true} #38#return; {9753#true} is VALID [2022-04-28 04:12:42,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {9753#true} call #t~ret7 := main(); {9753#true} is VALID [2022-04-28 04:12:42,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {9753#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {9753#true} is VALID [2022-04-28 04:12:42,247 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 04:12:42,247 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 04:12:42,248 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 04:12:42,248 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 04:12:42,249 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 04:12:42,250 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 04:12:42,250 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 04:12:42,251 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 04:12:42,251 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 04:12:42,252 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 04:12:42,252 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 04:12:42,253 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 04:12:42,254 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 04:12:42,254 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 04:12:42,255 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 04:12:42,255 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 04:12:42,256 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 04:12:42,256 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 04:12:42,256 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 04:12:42,257 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 04:12:42,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {9754#false} assume !false; {9754#false} is VALID [2022-04-28 04:12:42,257 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 04:12:42,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:42,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622267116] [2022-04-28 04:12:42,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622267116] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:12:42,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372603249] [2022-04-28 04:12:42,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:12:42,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:12:42,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:12:42,259 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 04:12:42,259 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 04:12:42,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:12:42,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:12:42,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 04:12:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:42,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:12:45,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {9753#true} call ULTIMATE.init(); {9753#true} is VALID [2022-04-28 04:12:45,118 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 04:12:45,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {9753#true} assume true; {9753#true} is VALID [2022-04-28 04:12:45,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9753#true} {9753#true} #38#return; {9753#true} is VALID [2022-04-28 04:12:45,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {9753#true} call #t~ret7 := main(); {9753#true} is VALID [2022-04-28 04:12:45,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {9753#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {9753#true} is VALID [2022-04-28 04:12:45,119 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 04:12:45,119 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 04:12:45,120 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 04:12:45,121 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 04:12:45,121 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 04:12:45,122 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 04:12:45,122 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 04:12:45,123 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 04:12:45,123 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 04:12:45,124 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 04:12:45,125 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 04:12:45,125 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 04:12:45,126 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 04:12:45,126 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 04:12:45,127 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 04:12:45,127 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 04:12:45,128 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 04:12:45,128 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 04:12:45,129 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 04:12:45,129 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 04:12:45,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {9754#false} assume !false; {9754#false} is VALID [2022-04-28 04:12:45,129 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 04:12:45,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:13:10,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {9754#false} assume !false; {9754#false} is VALID [2022-04-28 04:13:10,228 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 04:13:10,229 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 04:13:10,229 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 04:13:10,231 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 04:13:10,234 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 04:13:10,239 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 04:13:10,249 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 04:13:10,256 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 04:13:10,260 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 04:13:10,263 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 04:13:10,265 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 04:13:10,268 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 04:13:10,270 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 04:13:10,322 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 04:13:10,324 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 04:13:10,328 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 04:13:10,330 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 04:13:10,333 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 04:13:10,335 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 04:13:10,336 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 04:13:10,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {9753#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {9753#true} is VALID [2022-04-28 04:13:10,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {9753#true} call #t~ret7 := main(); {9753#true} is VALID [2022-04-28 04:13:10,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9753#true} {9753#true} #38#return; {9753#true} is VALID [2022-04-28 04:13:10,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {9753#true} assume true; {9753#true} is VALID [2022-04-28 04:13:10,336 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 04:13:10,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {9753#true} call ULTIMATE.init(); {9753#true} is VALID [2022-04-28 04:13:10,336 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 04:13:10,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372603249] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:13:10,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:13:10,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 37 [2022-04-28 04:13:10,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:10,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [272766172] [2022-04-28 04:13:10,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [272766172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:10,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:10,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 04:13:10,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652985091] [2022-04-28 04:13:10,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:10,337 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 04:13:10,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:10,338 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 04:13:10,352 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 04:13:10,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 04:13:10,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:10,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 04:13:10,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 04:13:10,353 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 04:13:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:10,685 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 04:13:10,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 04:13:10,685 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 04:13:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:10,685 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 04:13:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2022-04-28 04:13:10,686 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 04:13:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2022-04-28 04:13:10,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 35 transitions. [2022-04-28 04:13:10,710 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 04:13:10,711 INFO L225 Difference]: With dead ends: 35 [2022-04-28 04:13:10,711 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 04:13:10,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 23 SyntacticMatches, 17 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1261, Invalid=1601, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 04:13:10,712 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 04:13:10,712 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 04:13:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 04:13:10,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 04:13:10,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:10,745 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 04:13:10,745 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 04:13:10,746 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 04:13:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:10,746 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 04:13:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 04:13:10,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:10,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:10,746 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 04:13:10,746 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 04:13:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:10,747 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 04:13:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 04:13:10,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:10,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:10,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:10,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:10,747 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 04:13:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 04:13:10,748 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2022-04-28 04:13:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:10,748 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 04:13:10,748 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 04:13:10,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 04:13:10,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 04:13:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 04:13:10,776 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:10,776 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:13:10,780 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 04:13:10,976 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 04:13:10,977 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:10,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:10,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1070192727, now seen corresponding path program 33 times [2022-04-28 04:13:10,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:10,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [498163393] [2022-04-28 04:13:10,979 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:13:10,979 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:13:10,979 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:13:10,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1070192727, now seen corresponding path program 34 times [2022-04-28 04:13:10,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:10,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47556217] [2022-04-28 04:13:10,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:10,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:11,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:13:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:11,255 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 04:13:11,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {10182#true} assume true; {10182#true} is VALID [2022-04-28 04:13:11,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10182#true} {10182#true} #38#return; {10182#true} is VALID [2022-04-28 04:13:11,256 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 04:13:11,256 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 04:13:11,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {10182#true} assume true; {10182#true} is VALID [2022-04-28 04:13:11,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10182#true} {10182#true} #38#return; {10182#true} is VALID [2022-04-28 04:13:11,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {10182#true} call #t~ret7 := main(); {10182#true} is VALID [2022-04-28 04:13:11,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {10182#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {10182#true} is VALID [2022-04-28 04:13:11,257 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 04:13:11,257 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 04:13:11,258 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 04:13:11,258 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 04:13:11,259 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 04:13:11,260 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 04:13:11,260 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 04:13:11,261 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 04:13:11,261 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 04:13:11,262 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 04:13:11,262 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 04:13:11,263 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 04:13:11,263 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 04:13:11,264 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 04:13:11,265 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 04:13:11,265 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 04:13:11,266 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 04:13:11,266 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 04:13:11,267 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 04:13:11,267 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 04:13:11,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {10183#false} assume !false; {10183#false} is VALID [2022-04-28 04:13:11,268 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 04:13:11,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:11,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47556217] [2022-04-28 04:13:11,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47556217] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:13:11,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380699218] [2022-04-28 04:13:11,268 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:13:11,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:13:11,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:13:11,269 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 04:13:11,270 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 04:13:11,430 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:13:11,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:13:11,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 04:13:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:11,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:13:14,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {10182#true} call ULTIMATE.init(); {10182#true} is VALID [2022-04-28 04:13:14,711 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 04:13:14,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {10182#true} assume true; {10182#true} is VALID [2022-04-28 04:13:14,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10182#true} {10182#true} #38#return; {10182#true} is VALID [2022-04-28 04:13:14,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {10182#true} call #t~ret7 := main(); {10182#true} is VALID [2022-04-28 04:13:14,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {10182#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {10182#true} is VALID [2022-04-28 04:13:14,712 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 04:13:14,712 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 04:13:14,713 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 04:13:14,713 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 04:13:14,714 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 04:13:14,714 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 04:13:14,715 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 04:13:14,716 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 04:13:14,716 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 04:13:14,717 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 04:13:14,717 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 04:13:14,718 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 04:13:14,718 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 04:13:14,719 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 04:13:14,720 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 04:13:14,720 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 04:13:14,721 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 04:13:14,721 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 04:13:14,722 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 04:13:14,722 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 04:13:14,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {10183#false} assume !false; {10183#false} is VALID [2022-04-28 04:13:14,722 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 04:13:14,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:13:34,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {10183#false} assume !false; {10183#false} is VALID [2022-04-28 04:13:34,192 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 04:13:34,192 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 04:13:34,211 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 04:13:34,212 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 04:13:34,217 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 04:13:34,218 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 04:13:34,221 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 04:13:34,224 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 04:13:34,227 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 04:13:34,270 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 04:13:34,271 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 04:13:34,275 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 04:13:34,276 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 04:13:34,277 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 04:13:34,281 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 04:13:34,284 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 04:13:34,289 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 04:13:34,290 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 04:13:34,292 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 04:13:34,292 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 04:13:34,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {10182#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {10182#true} is VALID [2022-04-28 04:13:34,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {10182#true} call #t~ret7 := main(); {10182#true} is VALID [2022-04-28 04:13:34,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10182#true} {10182#true} #38#return; {10182#true} is VALID [2022-04-28 04:13:34,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {10182#true} assume true; {10182#true} is VALID [2022-04-28 04:13:34,292 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 04:13:34,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {10182#true} call ULTIMATE.init(); {10182#true} is VALID [2022-04-28 04:13:34,293 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 04:13:34,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380699218] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:13:34,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:13:34,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 04:13:34,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:34,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [498163393] [2022-04-28 04:13:34,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [498163393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:34,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:34,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 04:13:34,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345591743] [2022-04-28 04:13:34,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:34,294 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 04:13:34,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:34,294 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 04:13:34,309 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 04:13:34,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 04:13:34,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:34,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 04:13:34,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=902, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 04:13:34,310 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 04:13:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:34,887 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 04:13:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 04:13:34,887 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 04:13:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:34,887 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 04:13:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 38 transitions. [2022-04-28 04:13:34,888 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 04:13:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 38 transitions. [2022-04-28 04:13:34,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 38 transitions. [2022-04-28 04:13:34,916 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 04:13:34,916 INFO L225 Difference]: With dead ends: 38 [2022-04-28 04:13:34,916 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 04:13:34,917 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 04:13:34,917 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 04:13:34,917 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 04:13:34,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 04:13:34,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-04-28 04:13:34,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:34,951 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 04:13:34,951 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 04:13:34,951 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 04:13:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:34,952 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 04:13:34,952 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 04:13:34,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:34,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:34,952 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 04:13:34,952 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 04:13:34,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:34,953 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 04:13:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 04:13:34,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:34,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:34,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:34,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:34,953 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 04:13:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-04-28 04:13:34,954 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 27 [2022-04-28 04:13:34,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:34,954 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-04-28 04:13:34,954 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 04:13:34,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 34 transitions. [2022-04-28 04:13:34,998 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 04:13:34,998 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-28 04:13:34,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 04:13:34,999 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:34,999 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:13:35,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-28 04:13:35,199 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 04:13:35,199 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:35,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:35,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1183766902, now seen corresponding path program 33 times [2022-04-28 04:13:35,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:35,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1424558253] [2022-04-28 04:13:35,201 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:13:35,201 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:13:35,202 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:13:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1183766902, now seen corresponding path program 34 times [2022-04-28 04:13:35,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:35,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866540715] [2022-04-28 04:13:35,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:35,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:35,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:13:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:35,499 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 04:13:35,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {10636#true} assume true; {10636#true} is VALID [2022-04-28 04:13:35,499 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10636#true} {10636#true} #38#return; {10636#true} is VALID [2022-04-28 04:13:35,500 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 04:13:35,500 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 04:13:35,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {10636#true} assume true; {10636#true} is VALID [2022-04-28 04:13:35,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10636#true} {10636#true} #38#return; {10636#true} is VALID [2022-04-28 04:13:35,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {10636#true} call #t~ret7 := main(); {10636#true} is VALID [2022-04-28 04:13:35,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {10636#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {10636#true} is VALID [2022-04-28 04:13:35,501 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 04:13:35,501 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 04:13:35,502 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 04:13:35,502 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 04:13:35,503 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 04:13:35,504 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 04:13:35,504 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 04:13:35,505 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 04:13:35,505 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 04:13:35,506 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 04:13:35,507 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 04:13:35,507 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 04:13:35,508 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 04:13:35,508 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 04:13:35,509 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 04:13:35,509 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 04:13:35,510 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 04:13:35,511 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 04:13:35,511 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 04:13:35,511 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 04:13:35,512 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 04:13:35,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {10637#false} assume !false; {10637#false} is VALID [2022-04-28 04:13:35,512 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 04:13:35,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:35,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866540715] [2022-04-28 04:13:35,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866540715] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:13:35,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993014857] [2022-04-28 04:13:35,513 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:13:35,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:13:35,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:13:35,514 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 04:13:35,514 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 04:13:36,844 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:13:36,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:13:36,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 04:13:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:36,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:13:39,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {10636#true} call ULTIMATE.init(); {10636#true} is VALID [2022-04-28 04:13:39,667 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 04:13:39,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {10636#true} assume true; {10636#true} is VALID [2022-04-28 04:13:39,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10636#true} {10636#true} #38#return; {10636#true} is VALID [2022-04-28 04:13:39,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {10636#true} call #t~ret7 := main(); {10636#true} is VALID [2022-04-28 04:13:39,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {10636#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {10636#true} is VALID [2022-04-28 04:13:39,667 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 04:13:39,668 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 04:13:39,669 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 04:13:39,669 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 04:13:39,670 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 04:13:39,670 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 04:13:39,671 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 04:13:39,671 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 04:13:39,672 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 04:13:39,673 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 04:13:39,673 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 04:13:39,674 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 04:13:39,674 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 04:13:39,675 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 04:13:39,675 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 04:13:39,676 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 04:13:39,676 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 04:13:39,677 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 04:13:39,677 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 04:13:39,678 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 04:13:39,678 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 04:13:39,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {10637#false} assume !false; {10637#false} is VALID [2022-04-28 04:13:39,678 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 04:13:39,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:14:05,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {10637#false} assume !false; {10637#false} is VALID [2022-04-28 04:14:05,884 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 04:14:05,884 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 04:14:05,885 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 04:14:05,886 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 04:14:05,889 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 04:14:05,891 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 04:14:05,899 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 04:14:05,907 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 04:14:05,915 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 04:14:05,917 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 04:14:05,926 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 04:14:05,928 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 04:14:05,934 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 04:14:05,935 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 04:14:05,937 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 04:14:05,943 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 04:14:05,945 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 04:14:05,949 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 04:14:05,951 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 04:14:05,956 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 04:14:05,956 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 04:14:05,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {10636#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {10636#true} is VALID [2022-04-28 04:14:05,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {10636#true} call #t~ret7 := main(); {10636#true} is VALID [2022-04-28 04:14:05,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10636#true} {10636#true} #38#return; {10636#true} is VALID [2022-04-28 04:14:05,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {10636#true} assume true; {10636#true} is VALID [2022-04-28 04:14:05,957 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 04:14:05,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {10636#true} call ULTIMATE.init(); {10636#true} is VALID [2022-04-28 04:14:05,957 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 04:14:05,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993014857] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:14:05,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:14:05,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 39 [2022-04-28 04:14:05,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:05,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1424558253] [2022-04-28 04:14:05,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1424558253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:05,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:05,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 04:14:05,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626125800] [2022-04-28 04:14:05,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:05,959 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 04:14:05,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:05,959 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 04:14:05,977 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 04:14:05,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 04:14:05,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:05,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 04:14:05,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 04:14:05,978 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 04:14:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:06,339 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 04:14:06,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 04:14:06,339 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 04:14:06,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:06,339 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 04:14:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2022-04-28 04:14:06,340 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 04:14:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2022-04-28 04:14:06,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 36 transitions. [2022-04-28 04:14:06,365 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 04:14:06,366 INFO L225 Difference]: With dead ends: 36 [2022-04-28 04:14:06,366 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 04:14:06,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 23 SyntacticMatches, 18 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1407, Invalid=1785, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 04:14:06,366 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 04:14:06,367 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 04:14:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 04:14:06,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 04:14:06,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:06,399 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 04:14:06,399 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 04:14:06,399 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 04:14:06,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:06,399 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 04:14:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 04:14:06,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:06,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:06,400 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 04:14:06,400 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 04:14:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:06,400 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 04:14:06,400 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 04:14:06,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:06,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:06,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:06,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:06,400 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 04:14:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-28 04:14:06,401 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2022-04-28 04:14:06,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:06,401 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-28 04:14:06,401 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 04:14:06,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-28 04:14:06,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 04:14:06,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 04:14:06,432 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:06,432 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:14:06,440 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 04:14:06,634 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 04:14:06,634 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:06,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:06,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1183815721, now seen corresponding path program 35 times [2022-04-28 04:14:06,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:06,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1693102782] [2022-04-28 04:14:06,637 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:14:06,637 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:14:06,637 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:14:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1183815721, now seen corresponding path program 36 times [2022-04-28 04:14:06,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:06,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911803302] [2022-04-28 04:14:06,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:06,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:06,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:14:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:06,917 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 04:14:06,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {11081#true} assume true; {11081#true} is VALID [2022-04-28 04:14:06,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11081#true} {11081#true} #38#return; {11081#true} is VALID [2022-04-28 04:14:06,918 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 04:14:06,918 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 04:14:06,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {11081#true} assume true; {11081#true} is VALID [2022-04-28 04:14:06,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11081#true} {11081#true} #38#return; {11081#true} is VALID [2022-04-28 04:14:06,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {11081#true} call #t~ret7 := main(); {11081#true} is VALID [2022-04-28 04:14:06,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {11081#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {11081#true} is VALID [2022-04-28 04:14:06,919 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 04:14:06,919 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 04:14:06,920 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 04:14:06,921 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 04:14:06,921 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 04:14:06,922 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 04:14:06,922 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 04:14:06,923 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 04:14:06,923 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 04:14:06,924 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 04:14:06,925 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 04:14:06,925 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 04:14:06,926 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 04:14:06,926 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 04:14:06,927 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 04:14:06,927 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 04:14:06,928 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 04:14:06,928 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 04:14:06,929 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 04:14:06,929 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 04:14:06,930 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 04:14:06,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {11082#false} assume !false; {11082#false} is VALID [2022-04-28 04:14:06,930 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 04:14:06,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:06,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911803302] [2022-04-28 04:14:06,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911803302] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:14:06,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317036963] [2022-04-28 04:14:06,931 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:14:06,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:14:06,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:14:06,932 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 04:14:06,932 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 04:14:07,806 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 04:14:07,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:14:07,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 04:14:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:07,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:14:11,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {11081#true} call ULTIMATE.init(); {11081#true} is VALID [2022-04-28 04:14:11,346 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 04:14:11,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {11081#true} assume true; {11081#true} is VALID [2022-04-28 04:14:11,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11081#true} {11081#true} #38#return; {11081#true} is VALID [2022-04-28 04:14:11,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {11081#true} call #t~ret7 := main(); {11081#true} is VALID [2022-04-28 04:14:11,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {11081#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {11081#true} is VALID [2022-04-28 04:14:11,346 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 04:14:11,347 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 04:14:11,347 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 04:14:11,348 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 04:14:11,349 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 04:14:11,349 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 04:14:11,350 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 04:14:11,351 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 04:14:11,352 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 04:14:11,352 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 04:14:11,353 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 04:14:11,353 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 04:14:11,354 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 04:14:11,354 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 04:14:11,355 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 04:14:11,356 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 04:14:11,356 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 04:14:11,357 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 04:14:11,357 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 04:14:11,358 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 04:14:11,358 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 04:14:11,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {11082#false} assume !false; {11082#false} is VALID [2022-04-28 04:14:11,358 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 04:14:11,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:14:33,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {11082#false} assume !false; {11082#false} is VALID [2022-04-28 04:14:33,863 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 04:14:33,863 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 04:14:33,865 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 04:14:33,866 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 04:14:33,867 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 04:14:33,869 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 04:14:33,870 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 04:14:33,871 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 04:14:33,875 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 04:14:33,876 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 04:14:33,878 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 04:14:33,974 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 04:14:33,977 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 04:14:33,982 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 04:14:33,984 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 04:14:33,985 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 04:14:33,990 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 04:14:33,994 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 04:14:33,997 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 04:14:34,013 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 04:14:34,014 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 04:14:34,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {11081#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {11081#true} is VALID [2022-04-28 04:14:34,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {11081#true} call #t~ret7 := main(); {11081#true} is VALID [2022-04-28 04:14:34,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11081#true} {11081#true} #38#return; {11081#true} is VALID [2022-04-28 04:14:34,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {11081#true} assume true; {11081#true} is VALID [2022-04-28 04:14:34,014 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 04:14:34,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {11081#true} call ULTIMATE.init(); {11081#true} is VALID [2022-04-28 04:14:34,015 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 04:14:34,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317036963] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:14:34,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:14:34,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 04:14:34,015 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:34,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1693102782] [2022-04-28 04:14:34,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1693102782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:34,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:34,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 04:14:34,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91754468] [2022-04-28 04:14:34,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:34,016 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 04:14:34,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:34,016 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 04:14:34,032 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 04:14:34,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 04:14:34,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:34,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 04:14:34,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=990, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 04:14:34,032 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 04:14:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:34,639 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 04:14:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 04:14:34,639 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 04:14:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:34,639 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 04:14:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 39 transitions. [2022-04-28 04:14:34,640 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 04:14:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 39 transitions. [2022-04-28 04:14:34,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 39 transitions. [2022-04-28 04:14:34,672 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 04:14:34,673 INFO L225 Difference]: With dead ends: 39 [2022-04-28 04:14:34,673 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 04:14:34,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 21 SyntacticMatches, 17 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1511, Invalid=2149, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 04:14:34,674 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 04:14:34,674 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 04:14:34,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 04:14:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2022-04-28 04:14:34,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:34,718 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 04:14:34,718 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 04:14:34,718 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 04:14:34,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:34,719 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 04:14:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 04:14:34,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:34,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:34,719 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 04:14:34,719 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 04:14:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:34,720 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 04:14:34,720 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 04:14:34,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:34,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:34,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:34,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:34,720 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 04:14:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-28 04:14:34,720 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 28 [2022-04-28 04:14:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:34,721 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-28 04:14:34,721 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 04:14:34,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-28 04:14:34,756 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 04:14:34,757 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 04:14:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 04:14:34,757 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:34,757 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:14:34,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 04:14:34,957 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 04:14:34,958 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:34,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:34,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1956415242, now seen corresponding path program 35 times [2022-04-28 04:14:34,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:34,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1091528026] [2022-04-28 04:14:34,960 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:14:34,960 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:14:34,960 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:14:34,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1956415242, now seen corresponding path program 36 times [2022-04-28 04:14:34,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:34,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923586510] [2022-04-28 04:14:34,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:34,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:35,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:14:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:35,246 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 04:14:35,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {11551#true} assume true; {11551#true} is VALID [2022-04-28 04:14:35,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11551#true} {11551#true} #38#return; {11551#true} is VALID [2022-04-28 04:14:35,247 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 04:14:35,247 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 04:14:35,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {11551#true} assume true; {11551#true} is VALID [2022-04-28 04:14:35,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11551#true} {11551#true} #38#return; {11551#true} is VALID [2022-04-28 04:14:35,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {11551#true} call #t~ret7 := main(); {11551#true} is VALID [2022-04-28 04:14:35,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {11551#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {11551#true} is VALID [2022-04-28 04:14:35,247 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 04:14:35,248 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 04:14:35,249 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 04:14:35,249 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 04:14:35,250 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 04:14:35,250 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 04:14:35,251 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 04:14:35,251 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 04:14:35,252 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 04:14:35,252 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 04:14:35,253 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 04:14:35,254 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 04:14:35,254 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 04:14:35,255 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 04:14:35,255 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 04:14:35,256 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 04:14:35,256 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 04:14:35,257 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 04:14:35,257 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 04:14:35,258 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 04:14:35,258 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 04:14:35,259 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 04:14:35,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {11552#false} assume !false; {11552#false} is VALID [2022-04-28 04:14:35,259 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 04:14:35,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:35,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923586510] [2022-04-28 04:14:35,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923586510] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:14:35,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285559524] [2022-04-28 04:14:35,259 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:14:35,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:14:35,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:14:35,260 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 04:14:35,261 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 04:14:35,810 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 04:14:35,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:14:35,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 04:14:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:35,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:14:38,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {11551#true} call ULTIMATE.init(); {11551#true} is VALID [2022-04-28 04:14:38,826 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 04:14:38,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {11551#true} assume true; {11551#true} is VALID [2022-04-28 04:14:38,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11551#true} {11551#true} #38#return; {11551#true} is VALID [2022-04-28 04:14:38,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {11551#true} call #t~ret7 := main(); {11551#true} is VALID [2022-04-28 04:14:38,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {11551#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {11551#true} is VALID [2022-04-28 04:14:38,827 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 04:14:38,827 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 04:14:38,828 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 04:14:38,828 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 04:14:38,829 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 04:14:38,830 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 04:14:38,830 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 04:14:38,831 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 04:14:38,831 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 04:14:38,832 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 04:14:38,833 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 04:14:38,833 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 04:14:38,834 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 04:14:38,834 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 04:14:38,835 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 04:14:38,835 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 04:14:38,836 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 04:14:38,836 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 04:14:38,837 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 04:14:38,837 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 04:14:38,838 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 04:14:38,838 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 04:14:38,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {11552#false} assume !false; {11552#false} is VALID [2022-04-28 04:14:38,839 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 04:14:38,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:15:09,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {11552#false} assume !false; {11552#false} is VALID [2022-04-28 04:15:09,007 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 04:15:09,008 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 04:15:09,008 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 04:15:09,034 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 04:15:09,036 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 04:15:09,038 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 04:15:09,040 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 04:15:09,045 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 04:15:09,046 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 04:15:09,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 04:15:09,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 04:15:09,051 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 04:15:09,053 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 04:15:09,055 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 04:15:09,064 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 04:15:09,065 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 04:15:09,067 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 04:15:09,071 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 04:15:09,331 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 04:15:09,333 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 04:15:09,336 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 04:15:09,337 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 04:15:09,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {11551#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {11551#true} is VALID [2022-04-28 04:15:09,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {11551#true} call #t~ret7 := main(); {11551#true} is VALID [2022-04-28 04:15:09,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11551#true} {11551#true} #38#return; {11551#true} is VALID [2022-04-28 04:15:09,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {11551#true} assume true; {11551#true} is VALID [2022-04-28 04:15:09,337 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 04:15:09,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {11551#true} call ULTIMATE.init(); {11551#true} is VALID [2022-04-28 04:15:09,338 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 04:15:09,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285559524] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:15:09,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:15:09,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 41 [2022-04-28 04:15:09,338 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:15:09,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1091528026] [2022-04-28 04:15:09,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1091528026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:09,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:09,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 04:15:09,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718175745] [2022-04-28 04:15:09,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:15:09,339 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 04:15:09,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:15:09,339 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 04:15:09,356 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 04:15:09,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 04:15:09,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:09,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 04:15:09,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 04:15:09,356 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 04:15:09,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:09,773 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 04:15:09,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 04:15:09,773 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 04:15:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:15:09,773 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 04:15:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. [2022-04-28 04:15:09,774 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 04:15:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. [2022-04-28 04:15:09,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 37 transitions. [2022-04-28 04:15:09,804 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 04:15:09,805 INFO L225 Difference]: With dead ends: 37 [2022-04-28 04:15:09,805 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 04:15:09,806 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 04:15:09,806 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 04:15:09,807 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 04:15:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 04:15:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 04:15:09,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:15:09,851 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 04:15:09,851 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 04:15:09,851 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 04:15:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:09,851 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 04:15:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 04:15:09,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:09,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:09,852 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 04:15:09,852 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 04:15:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:09,852 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 04:15:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 04:15:09,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:09,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:09,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:15:09,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:15:09,853 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 04:15:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-28 04:15:09,865 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2022-04-28 04:15:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:15:09,865 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-28 04:15:09,866 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 04:15:09,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-28 04:15:09,897 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 04:15:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 04:15:09,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 04:15:09,897 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:15:09,897 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:15:09,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-28 04:15:10,098 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 04:15:10,098 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:15:10,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:15:10,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1956366423, now seen corresponding path program 37 times [2022-04-28 04:15:10,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:10,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1831740860] [2022-04-28 04:15:10,101 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:15:10,101 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:15:10,101 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:15:10,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1956366423, now seen corresponding path program 38 times [2022-04-28 04:15:10,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:15:10,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276300967] [2022-04-28 04:15:10,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:15:10,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:15:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:10,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:15:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:10,425 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 04:15:10,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {12012#true} assume true; {12012#true} is VALID [2022-04-28 04:15:10,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12012#true} {12012#true} #38#return; {12012#true} is VALID [2022-04-28 04:15:10,425 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 04:15:10,425 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 04:15:10,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {12012#true} assume true; {12012#true} is VALID [2022-04-28 04:15:10,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12012#true} {12012#true} #38#return; {12012#true} is VALID [2022-04-28 04:15:10,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {12012#true} call #t~ret7 := main(); {12012#true} is VALID [2022-04-28 04:15:10,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {12012#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12012#true} is VALID [2022-04-28 04:15:10,426 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 04:15:10,427 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 04:15:10,427 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 04:15:10,428 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 04:15:10,428 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 04:15:10,429 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 04:15:10,429 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 04:15:10,430 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 04:15:10,431 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 04:15:10,431 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 04:15:10,432 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 04:15:10,432 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 04:15:10,433 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 04:15:10,433 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 04:15:10,434 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 04:15:10,435 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 04:15:10,435 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 04:15:10,436 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 04:15:10,436 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 04:15:10,437 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 04:15:10,437 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 04:15:10,438 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 04:15:10,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {12013#false} assume !false; {12013#false} is VALID [2022-04-28 04:15:10,438 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 04:15:10,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:15:10,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276300967] [2022-04-28 04:15:10,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276300967] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:15:10,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114962031] [2022-04-28 04:15:10,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:15:10,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:15:10,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:15:10,440 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 04:15:10,440 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 04:15:10,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:15:10,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:15:10,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 04:15:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:10,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:15:14,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {12012#true} call ULTIMATE.init(); {12012#true} is VALID [2022-04-28 04:15:14,321 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 04:15:14,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {12012#true} assume true; {12012#true} is VALID [2022-04-28 04:15:14,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12012#true} {12012#true} #38#return; {12012#true} is VALID [2022-04-28 04:15:14,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {12012#true} call #t~ret7 := main(); {12012#true} is VALID [2022-04-28 04:15:14,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {12012#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12012#true} is VALID [2022-04-28 04:15:14,322 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 04:15:14,323 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 04:15:14,323 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 04:15:14,324 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 04:15:14,324 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 04:15:14,325 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 04:15:14,326 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 04:15:14,326 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 04:15:14,327 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 04:15:14,327 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 04:15:14,328 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 04:15:14,328 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 04:15:14,329 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 04:15:14,329 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 04:15:14,330 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 04:15:14,330 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 04:15:14,331 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 04:15:14,332 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 04:15:14,332 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 04:15:14,333 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 04:15:14,333 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 04:15:14,334 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 04:15:14,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {12013#false} assume !false; {12013#false} is VALID [2022-04-28 04:15:14,334 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 04:15:14,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:15:37,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {12013#false} assume !false; {12013#false} is VALID [2022-04-28 04:15:37,481 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 04:15:37,481 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 04:15:37,483 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 04:15:37,486 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 04:15:37,493 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 04:15:37,497 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 04:15:37,500 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 04:15:37,501 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 04:15:37,503 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 04:15:37,504 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 04:15:37,512 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 04:15:37,532 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 04:15:37,534 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 04:15:37,537 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 04:15:37,539 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 04:15:37,541 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 04:15:37,542 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 04:15:37,543 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 04:15:37,546 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 04:15:37,547 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 04:15:37,549 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 04:15:37,550 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 04:15:37,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {12012#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12012#true} is VALID [2022-04-28 04:15:37,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {12012#true} call #t~ret7 := main(); {12012#true} is VALID [2022-04-28 04:15:37,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12012#true} {12012#true} #38#return; {12012#true} is VALID [2022-04-28 04:15:37,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {12012#true} assume true; {12012#true} is VALID [2022-04-28 04:15:37,550 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 04:15:37,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {12012#true} call ULTIMATE.init(); {12012#true} is VALID [2022-04-28 04:15:37,550 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 04:15:37,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114962031] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:15:37,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:15:37,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 04:15:37,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:15:37,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1831740860] [2022-04-28 04:15:37,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1831740860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:37,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:37,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 04:15:37,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053128370] [2022-04-28 04:15:37,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:15:37,551 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 04:15:37,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:15:37,551 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 04:15:37,571 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 04:15:37,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 04:15:37,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:37,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 04:15:37,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=810, Invalid=1082, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 04:15:37,572 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 04:15:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:38,232 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 04:15:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 04:15:38,232 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 04:15:38,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:15:38,232 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 04:15:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. [2022-04-28 04:15:38,233 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 04:15:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. [2022-04-28 04:15:38,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 40 transitions. [2022-04-28 04:15:38,262 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 04:15:38,263 INFO L225 Difference]: With dead ends: 40 [2022-04-28 04:15:38,263 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 04:15:38,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 21 SyntacticMatches, 18 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1670, Invalid=2362, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 04:15:38,264 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 04:15:38,264 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 04:15:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 04:15:38,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-04-28 04:15:38,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:15:38,301 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 04:15:38,301 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 04:15:38,301 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 04:15:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:38,302 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 04:15:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 04:15:38,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:38,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:38,302 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 04:15:38,302 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 04:15:38,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:38,303 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 04:15:38,303 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 04:15:38,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:38,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:38,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:15:38,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:15:38,303 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 04:15:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-04-28 04:15:38,304 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 29 [2022-04-28 04:15:38,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:15:38,304 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-04-28 04:15:38,304 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 04:15:38,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 36 transitions. [2022-04-28 04:15:38,350 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 04:15:38,350 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-04-28 04:15:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 04:15:38,350 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:15:38,350 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:15:38,380 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 04:15:38,551 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 04:15:38,551 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:15:38,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:15:38,552 INFO L85 PathProgramCache]: Analyzing trace with hash -517813898, now seen corresponding path program 37 times [2022-04-28 04:15:38,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:38,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [107350535] [2022-04-28 04:15:38,556 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:15:38,556 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:15:38,556 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:15:38,556 INFO L85 PathProgramCache]: Analyzing trace with hash -517813898, now seen corresponding path program 38 times [2022-04-28 04:15:38,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:15:38,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708265344] [2022-04-28 04:15:38,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:15:38,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:15:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:38,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:15:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:38,905 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 04:15:38,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {12498#true} assume true; {12498#true} is VALID [2022-04-28 04:15:38,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12498#true} {12498#true} #38#return; {12498#true} is VALID [2022-04-28 04:15:38,906 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 04:15:38,906 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 04:15:38,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {12498#true} assume true; {12498#true} is VALID [2022-04-28 04:15:38,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12498#true} {12498#true} #38#return; {12498#true} is VALID [2022-04-28 04:15:38,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {12498#true} call #t~ret7 := main(); {12498#true} is VALID [2022-04-28 04:15:38,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {12498#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12498#true} is VALID [2022-04-28 04:15:38,906 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 04:15:38,907 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 04:15:38,908 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 04:15:38,908 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 04:15:38,909 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 04:15:38,910 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 04:15:38,910 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 04:15:38,911 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 04:15:38,911 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 04:15:38,912 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 04:15:38,913 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 04:15:38,913 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 04:15:38,914 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 04:15:38,914 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 04:15:38,915 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 04:15:38,916 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 04:15:38,916 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 04:15:38,917 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 04:15:38,917 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 04:15:38,918 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 04:15:38,918 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 04:15:38,919 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 04:15:38,919 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 04:15:38,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {12499#false} assume !false; {12499#false} is VALID [2022-04-28 04:15:38,919 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 04:15:38,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:15:38,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708265344] [2022-04-28 04:15:38,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708265344] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:15:38,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927511035] [2022-04-28 04:15:38,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:15:38,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:15:38,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:15:38,921 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 04:15:38,922 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 04:15:39,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:15:39,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:15:39,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 04:15:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:39,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:15:42,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {12498#true} call ULTIMATE.init(); {12498#true} is VALID [2022-04-28 04:15:42,730 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 04:15:42,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {12498#true} assume true; {12498#true} is VALID [2022-04-28 04:15:42,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12498#true} {12498#true} #38#return; {12498#true} is VALID [2022-04-28 04:15:42,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {12498#true} call #t~ret7 := main(); {12498#true} is VALID [2022-04-28 04:15:42,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {12498#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12498#true} is VALID [2022-04-28 04:15:42,731 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 04:15:42,731 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 04:15:42,732 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 04:15:42,732 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 04:15:42,733 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 04:15:42,733 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 04:15:42,734 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 04:15:42,734 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 04:15:42,735 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 04:15:42,736 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 04:15:42,736 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 04:15:42,737 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 04:15:42,737 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 04:15:42,738 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 04:15:42,738 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 04:15:42,739 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 04:15:42,739 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 04:15:42,740 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 04:15:42,741 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 04:15:42,741 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 04:15:42,741 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 04:15:42,742 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 04:15:42,742 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 04:15:42,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {12499#false} assume !false; {12499#false} is VALID [2022-04-28 04:15:42,743 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 04:15:42,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:16:12,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {12499#false} assume !false; {12499#false} is VALID [2022-04-28 04:16:12,035 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 04:16:12,035 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 04:16:12,036 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 04:16:12,048 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 04:16:12,051 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 04:16:12,054 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 04:16:12,056 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 04:16:12,057 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 04:16:12,059 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 04:16:12,061 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 04:16:12,130 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 04:16:12,139 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 04:16:12,165 INFO 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 VALID [2022-04-28 04:16:12,166 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 04:16:12,167 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 04:16:12,172 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 04:16:12,173 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 04:16:12,176 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 04:16:12,467 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 04:16:12,477 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 04:16:12,481 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 04:16:12,483 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 04:16:12,483 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 04:16:12,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {12498#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12498#true} is VALID [2022-04-28 04:16:12,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {12498#true} call #t~ret7 := main(); {12498#true} is VALID [2022-04-28 04:16:12,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12498#true} {12498#true} #38#return; {12498#true} is VALID [2022-04-28 04:16:12,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {12498#true} assume true; {12498#true} is VALID [2022-04-28 04:16:12,483 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 04:16:12,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {12498#true} call ULTIMATE.init(); {12498#true} is VALID [2022-04-28 04:16:12,484 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 04:16:12,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927511035] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:16:12,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:16:12,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 43 [2022-04-28 04:16:12,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:16:12,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [107350535] [2022-04-28 04:16:12,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [107350535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:12,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:12,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 04:16:12,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927047270] [2022-04-28 04:16:12,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:16:12,485 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 04:16:12,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:16:12,485 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 04:16:12,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:12,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 04:16:12,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:12,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 04:16:12,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 04:16:12,502 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 04:16:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:12,880 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 04:16:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 04:16:12,880 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 04:16:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:16:12,881 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 04:16:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2022-04-28 04:16:12,881 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 04:16:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2022-04-28 04:16:12,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 38 transitions. [2022-04-28 04:16:12,906 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 04:16:12,907 INFO L225 Difference]: With dead ends: 38 [2022-04-28 04:16:12,907 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 04:16:12,908 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 04:16:12,908 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:16:12,908 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.0s Time] [2022-04-28 04:16:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 04:16:12,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 04:16:12,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:16:12,944 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 04:16:12,944 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 04:16:12,944 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 04:16:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:12,944 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 04:16:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 04:16:12,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:12,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:12,946 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 04:16:12,946 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 04:16:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:12,947 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 04:16:12,947 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 04:16:12,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:12,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:12,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:16:12,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:16:12,947 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 04:16:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-28 04:16:12,947 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2022-04-28 04:16:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:16:12,948 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-28 04:16:12,948 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 04:16:12,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-28 04:16:12,978 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 04:16:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 04:16:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 04:16:12,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:16:12,978 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:16:12,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-28 04:16:13,178 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 04:16:13,179 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:16:13,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:16:13,179 INFO L85 PathProgramCache]: Analyzing trace with hash -517765079, now seen corresponding path program 39 times [2022-04-28 04:16:13,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:13,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1297451822] [2022-04-28 04:16:13,181 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:16:13,181 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:16:13,181 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:16:13,181 INFO L85 PathProgramCache]: Analyzing trace with hash -517765079, now seen corresponding path program 40 times [2022-04-28 04:16:13,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:16:13,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676276607] [2022-04-28 04:16:13,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:16:13,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:16:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:13,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:16:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:13,504 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 04:16:13,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {12975#true} assume true; {12975#true} is VALID [2022-04-28 04:16:13,504 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12975#true} {12975#true} #38#return; {12975#true} is VALID [2022-04-28 04:16:13,504 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 04:16:13,505 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 04:16:13,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {12975#true} assume true; {12975#true} is VALID [2022-04-28 04:16:13,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12975#true} {12975#true} #38#return; {12975#true} is VALID [2022-04-28 04:16:13,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {12975#true} call #t~ret7 := main(); {12975#true} is VALID [2022-04-28 04:16:13,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {12975#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12975#true} is VALID [2022-04-28 04:16:13,511 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 04:16:13,512 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 04:16:13,512 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 04:16:13,513 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 04:16:13,514 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 04:16:13,514 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 04:16:13,515 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 04:16:13,515 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 04:16:13,516 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 04:16:13,516 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 04:16:13,517 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 04:16:13,518 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 04:16:13,518 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 04:16:13,519 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 04:16:13,519 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 04:16:13,520 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 04:16:13,520 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 04:16:13,521 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 04:16:13,522 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 04:16:13,522 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 04:16:13,523 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 04:16:13,523 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 04:16:13,524 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 04:16:13,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {12976#false} assume !false; {12976#false} is VALID [2022-04-28 04:16:13,524 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 04:16:13,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:16:13,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676276607] [2022-04-28 04:16:13,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676276607] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:16:13,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59058379] [2022-04-28 04:16:13,525 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:16:13,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:16:13,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:16:13,525 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 04:16:13,526 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 04:16:13,588 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:16:13,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:16:13,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 04:16:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:13,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:16:17,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {12975#true} call ULTIMATE.init(); {12975#true} is VALID [2022-04-28 04:16:17,376 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 04:16:17,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {12975#true} assume true; {12975#true} is VALID [2022-04-28 04:16:17,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12975#true} {12975#true} #38#return; {12975#true} is VALID [2022-04-28 04:16:17,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {12975#true} call #t~ret7 := main(); {12975#true} is VALID [2022-04-28 04:16:17,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {12975#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12975#true} is VALID [2022-04-28 04:16:17,377 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 04:16:17,377 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 04:16:17,378 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 04:16:17,378 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 04:16:17,379 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 04:16:17,379 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 04:16:17,380 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 04:16:17,380 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 04:16:17,381 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 04:16:17,382 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 04:16:17,382 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 04:16:17,383 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 04:16:17,383 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 04:16:17,384 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 04:16:17,384 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 04:16:17,385 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 04:16:17,385 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 04:16:17,386 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 04:16:17,387 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 04:16:17,387 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 04:16:17,388 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 04:16:17,388 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 04:16:17,389 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 04:16:17,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {12976#false} assume !false; {12976#false} is VALID [2022-04-28 04:16:17,389 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 04:16:17,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:16:46,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {12976#false} assume !false; {12976#false} is VALID [2022-04-28 04:16:46,205 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 04:16:46,205 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 04:16:46,207 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 04:16:46,209 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 04:16:46,211 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 04:16:46,217 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 04:16:46,219 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 04:16:46,221 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 04:16:46,223 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 04:16:46,227 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 04:16:46,229 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 04:16:46,234 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 04:16:46,235 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 04:16:46,237 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 04:16:46,248 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 04:16:46,252 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 04:16:46,254 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 04:16:46,294 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 04:16:46,304 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 04:16:46,312 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 04:16:46,325 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 04:16:46,333 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 04:16:46,334 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 04:16:46,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {12975#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {12975#true} is VALID [2022-04-28 04:16:46,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {12975#true} call #t~ret7 := main(); {12975#true} is VALID [2022-04-28 04:16:46,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12975#true} {12975#true} #38#return; {12975#true} is VALID [2022-04-28 04:16:46,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {12975#true} assume true; {12975#true} is VALID [2022-04-28 04:16:46,334 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 04:16:46,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {12975#true} call ULTIMATE.init(); {12975#true} is VALID [2022-04-28 04:16:46,335 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 04:16:46,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59058379] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:16:46,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:16:46,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 04:16:46,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:16:46,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1297451822] [2022-04-28 04:16:46,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1297451822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:46,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:46,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 04:16:46,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100538580] [2022-04-28 04:16:46,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:16:46,336 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 04:16:46,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:16:46,336 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 04:16:46,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:46,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 04:16:46,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:46,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 04:16:46,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=892, Invalid=1178, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 04:16:46,354 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 04:16:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:47,083 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 04:16:47,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 04:16:47,083 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 04:16:47,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:16:47,084 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 04:16:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 41 transitions. [2022-04-28 04:16:47,084 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 04:16:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 41 transitions. [2022-04-28 04:16:47,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 41 transitions. [2022-04-28 04:16:47,118 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 04:16:47,118 INFO L225 Difference]: With dead ends: 41 [2022-04-28 04:16:47,118 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 04:16:47,119 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 04:16:47,119 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 04:16:47,120 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 04:16:47,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 04:16:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-04-28 04:16:47,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:16:47,163 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 04:16:47,163 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 04:16:47,163 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 04:16:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:47,163 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 04:16:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 04:16:47,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:47,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:47,164 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 04:16:47,164 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 04:16:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:47,164 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 04:16:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 04:16:47,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:47,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:47,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:16:47,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:16:47,165 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 04:16:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-04-28 04:16:47,165 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2022-04-28 04:16:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:16:47,165 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-04-28 04:16:47,165 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 04:16:47,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 37 transitions. [2022-04-28 04:16:47,227 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 04:16:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-04-28 04:16:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 04:16:47,228 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:16:47,228 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:16:47,244 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 04:16:47,428 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 04:16:47,428 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:16:47,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:16:47,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1129154806, now seen corresponding path program 39 times [2022-04-28 04:16:47,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:47,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [265950961] [2022-04-28 04:16:47,431 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:16:47,431 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:16:47,432 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:16:47,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1129154806, now seen corresponding path program 40 times [2022-04-28 04:16:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:16:47,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936571407] [2022-04-28 04:16:47,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:16:47,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:16:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:16:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:47,792 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 04:16:47,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {13477#true} assume true; {13477#true} is VALID [2022-04-28 04:16:47,792 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13477#true} {13477#true} #38#return; {13477#true} is VALID [2022-04-28 04:16:47,792 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 04:16:47,792 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 04:16:47,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {13477#true} assume true; {13477#true} is VALID [2022-04-28 04:16:47,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13477#true} {13477#true} #38#return; {13477#true} is VALID [2022-04-28 04:16:47,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {13477#true} call #t~ret7 := main(); {13477#true} is VALID [2022-04-28 04:16:47,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {13477#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {13477#true} is VALID [2022-04-28 04:16:47,793 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 04:16:47,794 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 04:16:47,794 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 04:16:47,795 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 04:16:47,796 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 04:16:47,796 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 04:16:47,797 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 04:16:47,797 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 04:16:47,798 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 04:16:47,798 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 04:16:47,799 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 04:16:47,800 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 04:16:47,800 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 04:16:47,801 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 04:16:47,801 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 04:16:47,802 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 04:16:47,802 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 04:16:47,803 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 04:16:47,803 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 04:16:47,804 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 04:16:47,805 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 04:16:47,805 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 04:16:47,805 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 04:16:47,806 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 04:16:47,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {13478#false} assume !false; {13478#false} is VALID [2022-04-28 04:16:47,806 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 04:16:47,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:16:47,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936571407] [2022-04-28 04:16:47,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936571407] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:16:47,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083963767] [2022-04-28 04:16:47,806 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:16:47,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:16:47,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:16:47,808 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 04:16:47,809 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 04:16:47,872 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:16:47,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:16:47,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 04:16:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:47,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:16:51,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {13477#true} call ULTIMATE.init(); {13477#true} is VALID [2022-04-28 04:16:51,288 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 04:16:51,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {13477#true} assume true; {13477#true} is VALID [2022-04-28 04:16:51,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13477#true} {13477#true} #38#return; {13477#true} is VALID [2022-04-28 04:16:51,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {13477#true} call #t~ret7 := main(); {13477#true} is VALID [2022-04-28 04:16:51,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {13477#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {13477#true} is VALID [2022-04-28 04:16:51,289 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 04:16:51,290 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 04:16:51,290 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 04:16:51,291 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 04:16:51,292 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 04:16:51,292 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 04:16:51,293 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 04:16:51,294 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 04:16:51,294 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 04:16:51,295 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 04:16:51,295 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 04:16:51,296 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 04:16:51,297 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 04:16:51,297 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 04:16:51,298 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 04:16:51,298 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 04:16:51,299 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 04:16:51,315 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 04:16:51,315 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 04:16:51,316 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 04:16:51,316 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 04:16:51,317 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 04:16:51,317 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 04:16:51,318 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 04:16:51,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {13478#false} assume !false; {13478#false} is VALID [2022-04-28 04:16:51,318 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 04:16:51,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:17:27,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {13478#false} assume !false; {13478#false} is VALID [2022-04-28 04:17:27,950 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 04:17:27,951 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 04:17:27,951 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 04:17:27,953 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 04:17:27,964 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 04:17:27,965 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 04:17:28,004 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 04:17:28,026 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 04:17:28,028 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 04:17:28,036 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 04:17:28,041 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 04:17:28,043 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 04:17:28,045 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 04:17:28,047 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 04:17:28,048 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 04:17:28,049 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 04:17:28,051 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 04:17:28,055 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 04:17:28,056 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 04:17:28,058 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 04:17:28,060 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 04:17:28,062 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 04:17:28,064 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 04:17:28,064 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 04:17:28,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {13477#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {13477#true} is VALID [2022-04-28 04:17:28,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {13477#true} call #t~ret7 := main(); {13477#true} is VALID [2022-04-28 04:17:28,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13477#true} {13477#true} #38#return; {13477#true} is VALID [2022-04-28 04:17:28,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {13477#true} assume true; {13477#true} is VALID [2022-04-28 04:17:28,064 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 04:17:28,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {13477#true} call ULTIMATE.init(); {13477#true} is VALID [2022-04-28 04:17:28,065 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 04:17:28,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083963767] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:17:28,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:17:28,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 45 [2022-04-28 04:17:28,065 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:17:28,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [265950961] [2022-04-28 04:17:28,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [265950961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:28,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:28,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 04:17:28,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767875515] [2022-04-28 04:17:28,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:17:28,066 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 04:17:28,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:17:28,066 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 04:17:28,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:28,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 04:17:28,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:28,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 04:17:28,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 04:17:28,098 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 04:17:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:28,520 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 04:17:28,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 04:17:28,520 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 04:17:28,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:17:28,521 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 04:17:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2022-04-28 04:17:28,521 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 04:17:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2022-04-28 04:17:28,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 39 transitions. [2022-04-28 04:17:28,551 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 04:17:28,551 INFO L225 Difference]: With dead ends: 39 [2022-04-28 04:17:28,551 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 04:17:28,552 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 04:17:28,552 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 04:17:28,553 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 04:17:28,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 04:17:28,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 04:17:28,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:17:28,595 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 04:17:28,595 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 04:17:28,595 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 04:17:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:28,596 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 04:17:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 04:17:28,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:28,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:28,596 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 04:17:28,596 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 04:17:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:28,597 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 04:17:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 04:17:28,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:28,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:28,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:17:28,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:17:28,597 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 04:17:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-28 04:17:28,598 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2022-04-28 04:17:28,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:17:28,598 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-28 04:17:28,598 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 04:17:28,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-28 04:17:28,630 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 04:17:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 04:17:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 04:17:28,630 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:17:28,630 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:17:28,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-04-28 04:17:28,831 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 04:17:28,831 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:17:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:17:28,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1129203625, now seen corresponding path program 41 times [2022-04-28 04:17:28,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:28,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [715224453] [2022-04-28 04:17:28,833 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:17:28,833 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:17:28,833 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:17:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1129203625, now seen corresponding path program 42 times [2022-04-28 04:17:28,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:17:28,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113691870] [2022-04-28 04:17:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:17:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:17:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:29,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:17:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:29,151 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 04:17:29,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {13970#true} assume true; {13970#true} is VALID [2022-04-28 04:17:29,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13970#true} {13970#true} #38#return; {13970#true} is VALID [2022-04-28 04:17:29,152 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 04:17:29,152 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 04:17:29,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {13970#true} assume true; {13970#true} is VALID [2022-04-28 04:17:29,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13970#true} {13970#true} #38#return; {13970#true} is VALID [2022-04-28 04:17:29,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {13970#true} call #t~ret7 := main(); {13970#true} is VALID [2022-04-28 04:17:29,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {13970#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {13970#true} is VALID [2022-04-28 04:17:29,152 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 04:17:29,153 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 04:17:29,153 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 04:17:29,154 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 04:17:29,154 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 04:17:29,155 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 04:17:29,156 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 04:17:29,156 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 04:17:29,157 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 04:17:29,158 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 04:17:29,158 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 04:17:29,159 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 04:17:29,159 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 04:17:29,160 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 04:17:29,160 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 04:17:29,163 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 04:17:29,166 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 04:17:29,167 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 04:17:29,167 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 04:17:29,168 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 04:17:29,168 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 04:17:29,169 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 04:17:29,170 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 04:17:29,170 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 04:17:29,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {13971#false} assume !false; {13971#false} is VALID [2022-04-28 04:17:29,170 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 04:17:29,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:17:29,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113691870] [2022-04-28 04:17:29,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113691870] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:17:29,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480131647] [2022-04-28 04:17:29,171 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:17:29,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:17:29,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:17:29,172 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 04:17:29,172 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 04:17:30,132 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 04:17:30,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:17:30,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 04:17:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:30,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:17:34,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {13970#true} call ULTIMATE.init(); {13970#true} is VALID [2022-04-28 04:17:34,121 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 04:17:34,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {13970#true} assume true; {13970#true} is VALID [2022-04-28 04:17:34,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13970#true} {13970#true} #38#return; {13970#true} is VALID [2022-04-28 04:17:34,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {13970#true} call #t~ret7 := main(); {13970#true} is VALID [2022-04-28 04:17:34,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {13970#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {13970#true} is VALID [2022-04-28 04:17:34,122 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 04:17:34,122 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 04:17:34,123 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 04:17:34,123 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 04:17:34,124 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 04:17:34,124 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 04:17:34,125 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 04:17:34,125 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 04:17:34,126 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 04:17:34,127 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 04:17:34,127 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 04:17:34,128 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 04:17:34,128 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 04:17:34,129 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 04:17:34,129 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 04:17:34,130 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 04:17:34,130 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 04:17:34,131 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 04:17:34,131 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 04:17:34,132 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 04:17:34,133 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 04:17:34,133 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 04:17:34,134 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 04:17:34,134 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 04:17:34,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {13971#false} assume !false; {13971#false} is VALID [2022-04-28 04:17:34,134 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 04:17:34,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:18:04,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {13971#false} assume !false; {13971#false} is VALID [2022-04-28 04:18:04,777 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 04:18:04,777 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 04:18:04,779 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 04:18:04,781 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 04:18:04,783 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 04:18:04,787 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 04:18:04,788 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 04:18:04,789 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 04:18:04,791 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 04:18:04,806 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 04:18:04,808 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 04:18:04,809 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 04:18:04,813 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 04:18:04,814 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 04:18:04,816 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 04:18:04,822 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 04:18:04,827 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 04:18:04,843 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 04:18:04,845 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 04:18:04,847 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 04:18:04,849 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 04:18:04,857 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 04:18:06,864 WARN 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 UNKNOWN [2022-04-28 04:18:06,864 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 04:18:06,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {13970#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {13970#true} is VALID [2022-04-28 04:18:06,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {13970#true} call #t~ret7 := main(); {13970#true} is VALID [2022-04-28 04:18:06,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13970#true} {13970#true} #38#return; {13970#true} is VALID [2022-04-28 04:18:06,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {13970#true} assume true; {13970#true} is VALID [2022-04-28 04:18:06,865 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 04:18:06,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {13970#true} call ULTIMATE.init(); {13970#true} is VALID [2022-04-28 04:18:06,866 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 04:18:06,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480131647] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:18:06,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:18:06,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 04:18:06,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:18:06,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [715224453] [2022-04-28 04:18:06,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [715224453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:06,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:06,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 04:18:06,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159397226] [2022-04-28 04:18:06,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:18:06,870 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 04:18:06,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:18:06,870 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 04:18:06,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:06,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 04:18:06,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:06,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 04:18:06,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=978, Invalid=1278, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 04:18:06,894 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 04:18:07,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:07,675 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 04:18:07,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 04:18:07,676 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 04:18:07,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:18:07,677 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 04:18:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2022-04-28 04:18:07,678 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 04:18:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2022-04-28 04:18:07,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 42 transitions. [2022-04-28 04:18:07,724 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 04:18:07,724 INFO L225 Difference]: With dead ends: 42 [2022-04-28 04:18:07,724 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 04:18:07,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 21 SyntacticMatches, 20 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2012, Invalid=2818, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 04:18:07,725 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 04:18:07,726 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 04:18:07,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 04:18:07,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-28 04:18:07,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:18:07,768 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 04:18:07,768 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 04:18:07,768 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 04:18:07,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:07,769 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 04:18:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 04:18:07,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:07,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:07,770 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 04:18:07,770 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 04:18:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:07,770 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 04:18:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 04:18:07,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:07,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:07,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:18:07,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:18:07,771 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 04:18:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-28 04:18:07,771 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 31 [2022-04-28 04:18:07,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:18:07,771 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-28 04:18:07,771 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 04:18:07,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-28 04:18:07,810 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 04:18:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-28 04:18:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 04:18:07,810 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:18:07,810 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:18:07,825 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 04:18:08,015 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 04:18:08,015 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:18:08,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:18:08,016 INFO L85 PathProgramCache]: Analyzing trace with hash 645577078, now seen corresponding path program 41 times [2022-04-28 04:18:08,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:08,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1056140549] [2022-04-28 04:18:08,018 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:18:08,018 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:18:08,018 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:18:08,018 INFO L85 PathProgramCache]: Analyzing trace with hash 645577078, now seen corresponding path program 42 times [2022-04-28 04:18:08,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:18:08,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781985011] [2022-04-28 04:18:08,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:18:08,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:18:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:08,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:18:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:08,397 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 04:18:08,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {14488#true} assume true; {14488#true} is VALID [2022-04-28 04:18:08,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14488#true} {14488#true} #38#return; {14488#true} is VALID [2022-04-28 04:18:08,398 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 04:18:08,398 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 04:18:08,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {14488#true} assume true; {14488#true} is VALID [2022-04-28 04:18:08,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14488#true} {14488#true} #38#return; {14488#true} is VALID [2022-04-28 04:18:08,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {14488#true} call #t~ret7 := main(); {14488#true} is VALID [2022-04-28 04:18:08,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {14488#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {14488#true} is VALID [2022-04-28 04:18:08,399 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 04:18:08,399 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 04:18:08,400 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 04:18:08,401 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 04:18:08,401 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 04:18:08,402 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 04:18:08,402 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 04:18:08,403 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 04:18:08,404 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 04:18:08,404 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 04:18:08,405 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 04:18:08,406 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 04:18:08,406 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 04:18:08,407 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 04:18:08,407 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 04:18:08,408 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 04:18:08,409 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 04:18:08,409 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 04:18:08,410 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 04:18:08,411 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 04:18:08,411 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 04:18:08,412 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 04:18:08,412 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 04:18:08,412 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 04:18:08,413 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 04:18:08,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {14489#false} assume !false; {14489#false} is VALID [2022-04-28 04:18:08,413 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 04:18:08,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:18:08,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781985011] [2022-04-28 04:18:08,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781985011] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:18:08,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831467902] [2022-04-28 04:18:08,414 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:18:08,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:18:08,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:18:08,415 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 04:18:08,415 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 04:18:09,564 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 04:18:09,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:18:09,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 04:18:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 04:18:11,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:18:15,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {14488#true} call ULTIMATE.init(); {14488#true} is VALID [2022-04-28 04:18:15,048 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 04:18:15,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {14488#true} assume true; {14488#true} is VALID [2022-04-28 04:18:15,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14488#true} {14488#true} #38#return; {14488#true} is VALID [2022-04-28 04:18:15,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {14488#true} call #t~ret7 := main(); {14488#true} is VALID [2022-04-28 04:18:15,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {14488#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {14488#true} is VALID [2022-04-28 04:18:15,049 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 04:18:15,050 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 04:18:15,050 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 04:18:15,051 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 04:18:15,051 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 04:18:15,052 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 04:18:15,052 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 04:18:15,053 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 04:18:15,054 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 04:18:15,054 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 04:18:15,055 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 04:18:15,055 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 04:18:15,056 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 04:18:15,056 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 04:18:15,057 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 04:18:15,058 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 04:18:15,058 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 04:18:15,059 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 04:18:15,059 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 04:18:15,060 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 04:18:15,060 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 04:18:15,061 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 04:18:15,061 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 04:18:15,062 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 04:18:15,062 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 04:18:15,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {14489#false} assume !false; {14489#false} is VALID [2022-04-28 04:18:15,062 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 04:18:15,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:18:47,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {14489#false} assume !false; {14489#false} is VALID [2022-04-28 04:18:47,507 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 04:18:47,507 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 04:18:47,507 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 04:18:47,509 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 04:18:47,513 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 04:18:47,514 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 04:18:47,516 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 04:18:47,517 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 04:18:47,519 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 04:18:47,520 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 04:18:47,527 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 04:18:47,529 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 04:18:47,539 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 04:18:47,541 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 04:18:47,566 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 04:18:47,595 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 04:18:47,597 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 04:18:47,601 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 04:18:47,611 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 04:18:47,614 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 04:18:47,615 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 04:18:47,617 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 04:18:47,619 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 04:18:47,621 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 04:18:47,622 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 04:18:47,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {14488#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {14488#true} is VALID [2022-04-28 04:18:47,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {14488#true} call #t~ret7 := main(); {14488#true} is VALID [2022-04-28 04:18:47,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14488#true} {14488#true} #38#return; {14488#true} is VALID [2022-04-28 04:18:47,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {14488#true} assume true; {14488#true} is VALID [2022-04-28 04:18:47,622 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 04:18:47,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {14488#true} call ULTIMATE.init(); {14488#true} is VALID [2022-04-28 04:18:47,622 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 04:18:47,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831467902] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:18:47,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:18:47,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 47 [2022-04-28 04:18:47,623 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:18:47,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1056140549] [2022-04-28 04:18:47,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1056140549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:47,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:47,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 04:18:47,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969675405] [2022-04-28 04:18:47,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:18:47,623 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 04:18:47,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:18:47,624 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 04:18:47,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:47,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 04:18:47,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:47,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 04:18:47,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 04:18:47,644 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 04:18:48,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:48,071 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 04:18:48,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 04:18:48,071 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 04:18:48,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:18:48,071 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 04:18:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2022-04-28 04:18:48,072 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 04:18:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2022-04-28 04:18:48,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 40 transitions. [2022-04-28 04:18:48,101 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 04:18:48,102 INFO L225 Difference]: With dead ends: 40 [2022-04-28 04:18:48,102 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 04:18:48,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 23 SyntacticMatches, 22 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2071, Invalid=2621, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 04:18:48,103 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 04:18:48,103 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 04:18:48,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 04:18:48,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 04:18:48,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:18:48,146 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 04:18:48,146 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 04:18:48,146 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 04:18:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:48,147 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 04:18:48,147 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 04:18:48,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:48,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:48,147 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 04:18:48,147 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 04:18:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:48,148 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 04:18:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 04:18:48,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:48,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:48,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:18:48,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:18:48,148 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 04:18:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-28 04:18:48,148 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2022-04-28 04:18:48,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:18:48,148 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-28 04:18:48,149 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 04:18:48,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-28 04:18:48,182 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 04:18:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 04:18:48,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 04:18:48,183 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:18:48,183 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:18:48,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-04-28 04:18:48,389 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 04:18:48,389 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:18:48,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:18:48,390 INFO L85 PathProgramCache]: Analyzing trace with hash 645625897, now seen corresponding path program 43 times [2022-04-28 04:18:48,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:48,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [566768468] [2022-04-28 04:18:48,392 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:18:48,392 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:18:48,392 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:18:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash 645625897, now seen corresponding path program 44 times [2022-04-28 04:18:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:18:48,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714636054] [2022-04-28 04:18:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:18:48,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:18:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:48,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:18:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:48,770 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 04:18:48,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {14997#true} assume true; {14997#true} is VALID [2022-04-28 04:18:48,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14997#true} {14997#true} #38#return; {14997#true} is VALID [2022-04-28 04:18:48,771 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 04:18:48,771 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 04:18:48,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {14997#true} assume true; {14997#true} is VALID [2022-04-28 04:18:48,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14997#true} {14997#true} #38#return; {14997#true} is VALID [2022-04-28 04:18:48,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {14997#true} call #t~ret7 := main(); {14997#true} is VALID [2022-04-28 04:18:48,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {14997#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {14997#true} is VALID [2022-04-28 04:18:48,772 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 04:18:48,772 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 04:18:48,773 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 04:18:48,774 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 04:18:48,774 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 04:18:48,775 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 04:18:48,775 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 04:18:48,776 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 04:18:48,776 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 04:18:48,777 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 04:18:48,777 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 04:18:48,778 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 04:18:48,779 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 04:18:48,779 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 04:18:48,780 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 04:18:48,780 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 04:18:48,781 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 04:18:48,781 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 04:18:48,782 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 04:18:48,782 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 04:18:48,783 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 04:18:48,784 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 04:18:48,784 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 04:18:48,785 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 04:18:48,785 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 04:18:48,785 INFO L290 TraceCheckUtils]: 31: Hoare triple {14998#false} assume !false; {14998#false} is VALID [2022-04-28 04:18:48,785 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 04:18:48,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:18:48,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714636054] [2022-04-28 04:18:48,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714636054] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:18:48,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267144402] [2022-04-28 04:18:48,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:18:48,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:18:48,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:18:48,787 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 04:18:48,787 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 04:18:48,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:18:48,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:18:48,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 04:18:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:48,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:18:52,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {14997#true} call ULTIMATE.init(); {14997#true} is VALID [2022-04-28 04:18:52,990 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 04:18:52,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {14997#true} assume true; {14997#true} is VALID [2022-04-28 04:18:52,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14997#true} {14997#true} #38#return; {14997#true} is VALID [2022-04-28 04:18:52,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {14997#true} call #t~ret7 := main(); {14997#true} is VALID [2022-04-28 04:18:52,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {14997#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {14997#true} is VALID [2022-04-28 04:18:52,990 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 04:18:52,991 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 04:18:52,991 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 04:18:52,992 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 04:18:52,993 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 04:18:52,993 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 04:18:52,994 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 04:18:52,994 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 04:18:52,995 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 04:18:52,995 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 04:18:52,996 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 04:18:52,996 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 04:18:52,997 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 04:18:52,998 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 04:18:52,998 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 04:18:52,999 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 04:18:52,999 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 04:18:53,000 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 04:18:53,000 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 04:18:53,001 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 04:18:53,001 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 04:18:53,002 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 04:18:53,003 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 04:18:53,003 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 04:18:53,004 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 04:18:53,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {14998#false} assume !false; {14998#false} is VALID [2022-04-28 04:18:53,004 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 04:18:53,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:19:18,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {14998#false} assume !false; {14998#false} is VALID [2022-04-28 04:19:18,305 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 04:19:18,305 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 04:19:18,348 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 04:19:18,351 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 04:19:18,354 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 04:19:18,357 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 04:19:18,359 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 04:19:18,362 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 04:19:18,372 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 04:19:18,373 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 04:19:18,381 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 04:19:18,382 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 04:19:18,389 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 04:19:18,390 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 04:19:18,411 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 04:19:18,413 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 04:19:18,420 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 04:19:18,427 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 04:19:18,429 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 04:19:18,430 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 04:19:18,434 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 04:19:18,435 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 04:19:18,456 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 04:19:18,460 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 04:19:18,460 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 04:19:18,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {14997#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {14997#true} is VALID [2022-04-28 04:19:18,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {14997#true} call #t~ret7 := main(); {14997#true} is VALID [2022-04-28 04:19:18,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14997#true} {14997#true} #38#return; {14997#true} is VALID [2022-04-28 04:19:18,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {14997#true} assume true; {14997#true} is VALID [2022-04-28 04:19:18,460 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 04:19:18,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {14997#true} call ULTIMATE.init(); {14997#true} is VALID [2022-04-28 04:19:18,461 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 04:19:18,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267144402] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:19:18,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:19:18,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 04:19:18,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:19:18,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [566768468] [2022-04-28 04:19:18,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [566768468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:18,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:18,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 04:19:18,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048483919] [2022-04-28 04:19:18,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:19:18,462 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 04:19:18,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:19:18,462 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 04:19:18,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:18,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 04:19:18,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:18,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 04:19:18,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1068, Invalid=1382, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 04:19:18,479 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 04:19:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:19,241 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 04:19:19,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 04:19:19,241 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 04:19:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:19:19,241 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 04:19:19,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions. [2022-04-28 04:19:19,242 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 04:19:19,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions. [2022-04-28 04:19:19,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 43 transitions. [2022-04-28 04:19:19,273 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 04:19:19,274 INFO L225 Difference]: With dead ends: 43 [2022-04-28 04:19:19,274 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 04:19:19,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 21 SyntacticMatches, 21 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2195, Invalid=3061, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 04:19:19,274 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 04:19:19,275 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 04:19:19,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 04:19:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-04-28 04:19:19,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:19:19,316 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 04:19:19,316 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 04:19:19,316 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 04:19:19,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:19,317 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 04:19:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 04:19:19,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:19,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:19,317 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 04:19:19,317 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 04:19:19,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:19,318 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 04:19:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 04:19:19,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:19,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:19,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:19:19,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:19:19,318 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 04:19:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2022-04-28 04:19:19,318 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 32 [2022-04-28 04:19:19,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:19:19,319 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2022-04-28 04:19:19,319 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 04:19:19,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 39 transitions. [2022-04-28 04:19:19,355 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 04:19:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-04-28 04:19:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 04:19:19,356 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:19:19,356 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:19:19,376 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 04:19:19,556 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 04:19:19,556 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:19:19,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:19:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1460430602, now seen corresponding path program 43 times [2022-04-28 04:19:19,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:19,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [764915647] [2022-04-28 04:19:19,558 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:19:19,558 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:19:19,558 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:19:19,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1460430602, now seen corresponding path program 44 times [2022-04-28 04:19:19,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:19:19,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579139335] [2022-04-28 04:19:19,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:19:19,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:19:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:19,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:19:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:19,929 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 04:19:19,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {15531#true} assume true; {15531#true} is VALID [2022-04-28 04:19:19,929 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15531#true} {15531#true} #38#return; {15531#true} is VALID [2022-04-28 04:19:19,929 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 04:19:19,929 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 04:19:19,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {15531#true} assume true; {15531#true} is VALID [2022-04-28 04:19:19,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15531#true} {15531#true} #38#return; {15531#true} is VALID [2022-04-28 04:19:19,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {15531#true} call #t~ret7 := main(); {15531#true} is VALID [2022-04-28 04:19:19,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {15531#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {15531#true} is VALID [2022-04-28 04:19:19,930 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 04:19:19,930 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 04:19:19,931 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 04:19:19,932 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 04:19:19,932 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 04:19:19,933 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 04:19:19,933 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 04:19:19,934 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 04:19:19,934 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 04:19:19,935 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 04:19:19,935 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 04:19:19,936 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 04:19:19,936 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 04:19:19,937 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 04:19:19,938 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 04:19:19,938 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 04:19:19,939 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 04:19:19,939 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 04:19:19,940 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 04:19:19,940 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 04:19:19,941 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 04:19:19,941 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 04:19:19,942 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 04:19:19,942 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 04:19:19,943 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 04:19:19,943 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 04:19:19,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {15532#false} assume !false; {15532#false} is VALID [2022-04-28 04:19:19,943 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 04:19:19,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:19:19,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579139335] [2022-04-28 04:19:19,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579139335] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:19:19,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761580342] [2022-04-28 04:19:19,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:19:19,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:19:19,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:19:19,945 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 04:19:19,950 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 04:19:20,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:19:20,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:19:20,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 04:19:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:20,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:19:23,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {15531#true} call ULTIMATE.init(); {15531#true} is VALID [2022-04-28 04:19:23,797 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 04:19:23,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {15531#true} assume true; {15531#true} is VALID [2022-04-28 04:19:23,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15531#true} {15531#true} #38#return; {15531#true} is VALID [2022-04-28 04:19:23,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {15531#true} call #t~ret7 := main(); {15531#true} is VALID [2022-04-28 04:19:23,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {15531#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {15531#true} is VALID [2022-04-28 04:19:23,798 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 04:19:23,799 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 04:19:23,799 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 04:19:23,800 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 04:19:23,800 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 04:19:23,801 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 04:19:23,801 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 04:19:23,802 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 04:19:23,802 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 04:19:23,803 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 04:19:23,804 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 04:19:23,804 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 04:19:23,805 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 04:19:23,805 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 04:19:23,806 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 04:19:23,806 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 04:19:23,807 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 04:19:23,807 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 04:19:23,808 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 04:19:23,808 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 04:19:23,809 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 04:19:23,810 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 04:19:23,810 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 04:19:23,810 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 04:19:23,811 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 04:19:23,811 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 04:19:23,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {15532#false} assume !false; {15532#false} is VALID [2022-04-28 04:19:23,812 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 04:19:23,812 INFO L328 TraceCheckSpWp]: Computing backward predicates...