/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:38:43,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:38:43,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:38:43,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:38:43,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:38:43,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:38:43,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:38:43,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:38:43,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:38:43,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:38:43,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:38:43,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:38:43,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:38:43,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:38:43,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:38:43,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:38:43,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:38:43,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:38:43,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:38:43,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:38:43,726 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:38:43,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:38:43,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:38:43,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:38:43,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:38:43,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:38:43,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:38:43,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:38:43,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:38:43,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:38:43,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:38:43,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:38:43,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:38:43,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:38:43,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:38:43,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:38:43,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:38:43,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:38:43,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:38:43,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:38:43,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:38:43,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:38:43,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:38:43,770 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:38:43,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:38:43,770 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:38:43,771 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:38:43,771 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:38:43,772 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:38:43,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:38:43,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:38:43,772 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:38:43,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:38:43,773 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:38:43,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:38:43,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:38:43,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:38:43,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:38:43,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:38:43,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:38:43,775 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:38:43,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:38:43,775 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:38:43,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:38:43,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:38:43,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:38:43,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:38:43,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:38:43,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:38:43,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:38:43,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:38:43,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:38:43,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:38:43,776 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:38:43,777 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:38:43,777 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:38:43,777 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 11:38:43,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:38:43,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:38:43,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:38:43,990 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:38:43,992 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:38:43,993 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-27 11:38:44,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59bea0023/0f35bafabbf1487e9c004dd03e04ccb5/FLAGdada11c82 [2022-04-27 11:38:44,356 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:38:44,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c [2022-04-27 11:38:44,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59bea0023/0f35bafabbf1487e9c004dd03e04ccb5/FLAGdada11c82 [2022-04-27 11:38:44,815 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59bea0023/0f35bafabbf1487e9c004dd03e04ccb5 [2022-04-27 11:38:44,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:38:44,818 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:38:44,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:38:44,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:38:44,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:38:44,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:38:44" (1/1) ... [2022-04-27 11:38:44,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573021eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:44, skipping insertion in model container [2022-04-27 11:38:44,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:38:44" (1/1) ... [2022-04-27 11:38:44,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:38:44,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:38:44,939 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-27 11:38:44,941 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-27 11:38:44,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:38:44,947 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:38:44,956 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-27 11:38:44,957 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-27 11:38:44,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:38:44,965 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:38:44,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:44 WrapperNode [2022-04-27 11:38:44,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:38:44,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:38:44,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:38:44,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:38:44,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:44" (1/1) ... [2022-04-27 11:38:44,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:44" (1/1) ... [2022-04-27 11:38:44,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:44" (1/1) ... [2022-04-27 11:38:44,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:44" (1/1) ... [2022-04-27 11:38:44,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:44" (1/1) ... [2022-04-27 11:38:44,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:44" (1/1) ... [2022-04-27 11:38:44,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:44" (1/1) ... [2022-04-27 11:38:44,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:38:44,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:38:44,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:38:44,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:38:44,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:44" (1/1) ... [2022-04-27 11:38:44,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:38:45,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:38:45,011 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-27 11:38:45,019 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-27 11:38:45,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:38:45,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:38:45,042 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:38:45,042 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:38:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:38:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:38:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:38:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2022-04-27 11:38:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:38:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:38:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:38:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:38:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:38:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:38:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:38:45,086 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:38:45,088 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:38:45,189 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:38:45,194 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:38:45,206 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:38:45,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:38:45 BoogieIcfgContainer [2022-04-27 11:38:45,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:38:45,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:38:45,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:38:45,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:38:45,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:38:44" (1/3) ... [2022-04-27 11:38:45,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51be4b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:38:45, skipping insertion in model container [2022-04-27 11:38:45,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:44" (2/3) ... [2022-04-27 11:38:45,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51be4b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:38:45, skipping insertion in model container [2022-04-27 11:38:45,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:38:45" (3/3) ... [2022-04-27 11:38:45,224 INFO L111 eAbstractionObserver]: Analyzing ICFG linear-inequality-inv-a.c [2022-04-27 11:38:45,233 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:38:45,233 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-04-27 11:38:45,263 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:38:45,267 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@66b74491, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d16ddc0 [2022-04-27 11:38:45,268 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-04-27 11:38:45,286 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-27 11:38:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-27 11:38:45,291 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:38:45,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:38:45,291 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:38:45,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:38:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1624254505, now seen corresponding path program 1 times [2022-04-27 11:38:45,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:38:45,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763896009] [2022-04-27 11:38:45,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:38:45,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:38:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:38:45,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:38:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:38:45,517 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-27 11:38:45,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 11:38:45,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #38#return; {21#true} is VALID [2022-04-27 11:38:45,519 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-27 11:38:45,519 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-27 11:38:45,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 11:38:45,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #38#return; {21#true} is VALID [2022-04-27 11:38:45,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret7 := main(); {21#true} is VALID [2022-04-27 11:38:45,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {21#true} is VALID [2022-04-27 11:38:45,522 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-27 11:38:45,522 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-27 11:38:45,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {22#false} is VALID [2022-04-27 11:38:45,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-27 11:38:45,523 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-27 11:38:45,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:38:45,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763896009] [2022-04-27 11:38:45,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763896009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:38:45,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:38:45,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:38:45,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359160834] [2022-04-27 11:38:45,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:38:45,530 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-27 11:38:45,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:38:45,532 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-27 11:38:45,543 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-27 11:38:45,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:38:45,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:38:45,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:38:45,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:38:45,557 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-27 11:38:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:38:45,628 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-27 11:38:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:38:45,628 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-27 11:38:45,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:38:45,629 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-27 11:38:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-04-27 11:38:45,634 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-27 11:38:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-04-27 11:38:45,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2022-04-27 11:38:45,665 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-27 11:38:45,670 INFO L225 Difference]: With dead ends: 29 [2022-04-27 11:38:45,670 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 11:38:45,672 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-27 11:38:45,674 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-27 11:38:45,675 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-27 11:38:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 11:38:45,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 11:38:45,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:38:45,694 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-27 11:38:45,694 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-27 11:38:45,694 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-27 11:38:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:38:45,696 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 11:38:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 11:38:45,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:38:45,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:38:45,696 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-27 11:38:45,697 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-27 11:38:45,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:38:45,698 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 11:38:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 11:38:45,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:38:45,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:38:45,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:38:45,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:38:45,699 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-27 11:38:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 11:38:45,700 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2022-04-27 11:38:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:38:45,701 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 11:38:45,701 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-27 11:38:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 11:38:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:38:45,701 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:38:45,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:38:45,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:38:45,702 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:38:45,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:38:45,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1187666007, now seen corresponding path program 1 times [2022-04-27 11:38:45,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:38:45,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40871898] [2022-04-27 11:38:45,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:38:45,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:38:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:38:45,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:38:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:38:45,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {125#(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); {118#true} is VALID [2022-04-27 11:38:45,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} assume true; {118#true} is VALID [2022-04-27 11:38:45,813 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} #38#return; {118#true} is VALID [2022-04-27 11:38:45,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:38:45,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {125#(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); {118#true} is VALID [2022-04-27 11:38:45,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} assume true; {118#true} is VALID [2022-04-27 11:38:45,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} #38#return; {118#true} is VALID [2022-04-27 11:38:45,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} call #t~ret7 := main(); {118#true} is VALID [2022-04-27 11:38:45,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {118#true} is VALID [2022-04-27 11:38:45,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {123#(= main_~s~0 0)} is VALID [2022-04-27 11:38:45,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#(= 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; {124#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-27 11:38:45,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {124#(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); {124#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-27 11:38:45,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {124#(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; {119#false} is VALID [2022-04-27 11:38:45,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-04-27 11:38:45,818 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-27 11:38:45,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:38:45,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40871898] [2022-04-27 11:38:45,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40871898] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:38:45,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641642282] [2022-04-27 11:38:45,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:38:45,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:38:45,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:38:45,821 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-27 11:38:45,847 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-27 11:38:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:38:45,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 11:38:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:38:45,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:38:45,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {118#true} is VALID [2022-04-27 11:38:45,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#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); {118#true} is VALID [2022-04-27 11:38:45,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} assume true; {118#true} is VALID [2022-04-27 11:38:45,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} #38#return; {118#true} is VALID [2022-04-27 11:38:45,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} call #t~ret7 := main(); {118#true} is VALID [2022-04-27 11:38:45,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {118#true} is VALID [2022-04-27 11:38:45,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {123#(= main_~s~0 0)} is VALID [2022-04-27 11:38:45,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#(= 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; {150#(= (+ main_~s~0 (* (- 1) (mod main_~v~0 256))) 0)} is VALID [2022-04-27 11:38:45,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {150#(= (+ main_~s~0 (* (- 1) (mod main_~v~0 256))) 0)} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {150#(= (+ main_~s~0 (* (- 1) (mod main_~v~0 256))) 0)} is VALID [2022-04-27 11:38:45,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {150#(= (+ main_~s~0 (* (- 1) (mod main_~v~0 256))) 0)} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {119#false} is VALID [2022-04-27 11:38:45,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-04-27 11:38:45,936 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-27 11:38:45,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:38:46,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-04-27 11:38:46,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {119#false} is VALID [2022-04-27 11:38:46,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {163#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-27 11:38:46,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {170#(<= (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; {163#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-27 11:38:46,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {170#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-27 11:38:46,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {118#true} is VALID [2022-04-27 11:38:46,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} call #t~ret7 := main(); {118#true} is VALID [2022-04-27 11:38:46,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} #38#return; {118#true} is VALID [2022-04-27 11:38:46,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} assume true; {118#true} is VALID [2022-04-27 11:38:46,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#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); {118#true} is VALID [2022-04-27 11:38:46,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {118#true} is VALID [2022-04-27 11:38:46,281 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-27 11:38:46,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641642282] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:38:46,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:38:46,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 11:38:46,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162926048] [2022-04-27 11:38:46,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:38:46,284 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:38:46,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:38:46,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:38:46,301 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-27 11:38:46,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:38:46,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:38:46,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:38:46,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:38:46,303 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:38:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:38:46,502 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-27 11:38:46,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:38:46,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:38:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:38:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:38:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-27 11:38:46,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:38:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-27 11:38:46,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-27 11:38:46,541 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-27 11:38:46,542 INFO L225 Difference]: With dead ends: 32 [2022-04-27 11:38:46,542 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 11:38:46,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:38:46,544 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:38:46,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 28 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:38:46,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 11:38:46,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2022-04-27 11:38:46,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:38:46,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 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-27 11:38:46,551 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 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-27 11:38:46,551 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 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-27 11:38:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:38:46,552 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-27 11:38:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-27 11:38:46,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:38:46,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:38:46,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 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 26 states. [2022-04-27 11:38:46,553 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 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 26 states. [2022-04-27 11:38:46,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:38:46,554 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-27 11:38:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-27 11:38:46,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:38:46,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:38:46,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:38:46,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:38:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 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-27 11:38:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-27 11:38:46,555 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2022-04-27 11:38:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:38:46,556 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-27 11:38:46,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:38:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 11:38:46,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 11:38:46,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:38:46,556 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:38:46,573 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-27 11:38:46,762 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-27 11:38:46,763 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:38:46,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:38:46,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1115879670, now seen corresponding path program 1 times [2022-04-27 11:38:46,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:38:46,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662025443] [2022-04-27 11:38:46,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:38:46,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:38:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:38:46,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:38:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:38:46,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {335#(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); {327#true} is VALID [2022-04-27 11:38:46,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-27 11:38:46,889 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #38#return; {327#true} is VALID [2022-04-27 11:38:46,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {335#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:38:46,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#(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); {327#true} is VALID [2022-04-27 11:38:46,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-27 11:38:46,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #38#return; {327#true} is VALID [2022-04-27 11:38:46,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret7 := main(); {327#true} is VALID [2022-04-27 11:38:46,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {327#true} is VALID [2022-04-27 11:38:46,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {327#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {332#(= main_~s~0 0)} is VALID [2022-04-27 11:38:46,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {332#(= 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; {333#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-27 11:38:46,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {333#(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; {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:38:46,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:38:46,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:38:46,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {328#false} is VALID [2022-04-27 11:38:46,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-27 11:38:46,894 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-27 11:38:46,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:38:46,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662025443] [2022-04-27 11:38:46,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662025443] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:38:46,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369828838] [2022-04-27 11:38:46,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:38:46,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:38:46,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:38:46,897 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-27 11:38:46,899 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-27 11:38:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:38:46,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:38:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:38:46,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:38:47,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2022-04-27 11:38:47,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#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); {327#true} is VALID [2022-04-27 11:38:47,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-27 11:38:47,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #38#return; {327#true} is VALID [2022-04-27 11:38:47,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret7 := main(); {327#true} is VALID [2022-04-27 11:38:47,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {327#true} is VALID [2022-04-27 11:38:47,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {327#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {332#(= main_~s~0 0)} is VALID [2022-04-27 11:38:47,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {332#(= 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; {333#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-27 11:38:47,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {333#(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; {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:38:47,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:38:47,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:38:47,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {328#false} is VALID [2022-04-27 11:38:47,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-27 11:38:47,299 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-27 11:38:47,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:38:49,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-27 11:38:49,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {378#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {328#false} is VALID [2022-04-27 11:38:49,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {378#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {378#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-27 11:38:49,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {378#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {378#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-27 11:38:49,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {388#(<= (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; {378#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-27 11:38:49,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {392#(<= (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; {388#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-27 11:38:49,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {327#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {392#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-27 11:38:49,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {327#true} is VALID [2022-04-27 11:38:49,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret7 := main(); {327#true} is VALID [2022-04-27 11:38:49,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #38#return; {327#true} is VALID [2022-04-27 11:38:49,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-27 11:38:49,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#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); {327#true} is VALID [2022-04-27 11:38:49,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2022-04-27 11:38:49,298 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-27 11:38:49,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369828838] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:38:49,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:38:49,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-04-27 11:38:49,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532734724] [2022-04-27 11:38:49,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:38:49,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 11:38:49,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:38:49,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:38:49,323 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-27 11:38:49,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 11:38:49,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:38:49,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 11:38:49,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:38:49,325 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:38:49,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:38:49,506 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-27 11:38:49,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:38:49,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 11:38:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:38:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:38:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-27 11:38:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:38:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-27 11:38:49,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-27 11:38:49,546 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-27 11:38:49,547 INFO L225 Difference]: With dead ends: 30 [2022-04-27 11:38:49,547 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 11:38:49,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:38:49,548 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:38:49,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 18 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:38:49,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 11:38:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-27 11:38:49,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:38:49,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 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-27 11:38:49,560 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 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-27 11:38:49,560 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 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-27 11:38:49,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:38:49,561 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 11:38:49,561 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-27 11:38:49,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:38:49,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:38:49,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 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 22 states. [2022-04-27 11:38:49,562 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 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 22 states. [2022-04-27 11:38:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:38:49,563 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 11:38:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-27 11:38:49,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:38:49,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:38:49,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:38:49,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:38:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 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-27 11:38:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-27 11:38:49,564 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2022-04-27 11:38:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:38:49,565 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-27 11:38:49,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:38:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-27 11:38:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:38:49,565 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:38:49,565 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:38:49,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 11:38:49,781 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-27 11:38:49,782 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:38:49,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:38:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash 234096681, now seen corresponding path program 2 times [2022-04-27 11:38:49,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:38:49,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970369604] [2022-04-27 11:38:49,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:38:49,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:38:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:38:49,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:38:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:38:49,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {555#(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); {545#true} is VALID [2022-04-27 11:38:49,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#true} assume true; {545#true} is VALID [2022-04-27 11:38:49,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {545#true} {545#true} #38#return; {545#true} is VALID [2022-04-27 11:38:49,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {545#true} call ULTIMATE.init(); {555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:38:49,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {555#(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); {545#true} is VALID [2022-04-27 11:38:49,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {545#true} assume true; {545#true} is VALID [2022-04-27 11:38:49,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {545#true} {545#true} #38#return; {545#true} is VALID [2022-04-27 11:38:49,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {545#true} call #t~ret7 := main(); {545#true} is VALID [2022-04-27 11:38:49,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {545#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {545#true} is VALID [2022-04-27 11:38:49,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {545#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {550#(= main_~s~0 0)} is VALID [2022-04-27 11:38:49,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#(= 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; {551#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-27 11:38:49,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {551#(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; {552#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:38:49,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {552#(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; {553#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-27 11:38:49,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {553#(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; {554#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-27 11:38:49,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(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); {554#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-27 11:38:49,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(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; {546#false} is VALID [2022-04-27 11:38:49,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {546#false} assume !false; {546#false} is VALID [2022-04-27 11:38:49,894 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-27 11:38:49,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:38:49,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970369604] [2022-04-27 11:38:49,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970369604] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:38:49,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90309781] [2022-04-27 11:38:49,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:38:49,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:38:49,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:38:49,896 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-27 11:38:49,898 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-27 11:38:49,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:38:49,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:38:49,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:38:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:38:49,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:38:51,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {545#true} call ULTIMATE.init(); {545#true} is VALID [2022-04-27 11:38:51,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#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); {545#true} is VALID [2022-04-27 11:38:51,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {545#true} assume true; {545#true} is VALID [2022-04-27 11:38:51,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {545#true} {545#true} #38#return; {545#true} is VALID [2022-04-27 11:38:51,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {545#true} call #t~ret7 := main(); {545#true} is VALID [2022-04-27 11:38:51,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {545#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {545#true} is VALID [2022-04-27 11:38:51,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {545#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {550#(= main_~s~0 0)} is VALID [2022-04-27 11:38:51,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#(= 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; {551#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-27 11:38:51,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {551#(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; {552#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:38:51,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {552#(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; {553#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-27 11:38:51,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {553#(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; {589#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 765 (mod main_~v~0 256))))} is VALID [2022-04-27 11:38:51,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {589#(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); {589#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 765 (mod main_~v~0 256))))} is VALID [2022-04-27 11:38:51,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {589#(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; {546#false} is VALID [2022-04-27 11:38:51,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {546#false} assume !false; {546#false} is VALID [2022-04-27 11:38:51,049 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-27 11:38:51,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:38:57,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {546#false} assume !false; {546#false} is VALID [2022-04-27 11:38:57,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {602#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {546#false} is VALID [2022-04-27 11:38:57,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {602#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {602#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-27 11:38:57,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {609#(<= (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; {602#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-27 11:38:57,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {613#(<= (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; {609#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-27 11:38:57,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {617#(<= (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; {613#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-27 11:38:57,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {621#(<= (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; {617#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:38:57,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {545#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {621#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-27 11:38:57,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {545#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {545#true} is VALID [2022-04-27 11:38:57,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {545#true} call #t~ret7 := main(); {545#true} is VALID [2022-04-27 11:38:57,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {545#true} {545#true} #38#return; {545#true} is VALID [2022-04-27 11:38:57,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {545#true} assume true; {545#true} is VALID [2022-04-27 11:38:57,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#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); {545#true} is VALID [2022-04-27 11:38:57,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {545#true} call ULTIMATE.init(); {545#true} is VALID [2022-04-27 11:38:57,158 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-27 11:38:57,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90309781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:38:57,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:38:57,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 11:38:57,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908795661] [2022-04-27 11:38:57,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:38:57,159 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:38:57,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:38:57,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:38:57,189 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-27 11:38:57,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:38:57,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:38:57,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:38:57,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:38:57,190 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:38:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:38:57,725 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-27 11:38:57,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 11:38:57,725 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:38:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:38:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:38:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2022-04-27 11:38:57,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:38:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2022-04-27 11:38:57,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 49 transitions. [2022-04-27 11:38:57,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:38:57,795 INFO L225 Difference]: With dead ends: 44 [2022-04-27 11:38:57,795 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 11:38:57,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=423, Unknown=0, NotChecked=0, Total=650 [2022-04-27 11:38:57,796 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 75 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:38:57,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 33 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:38:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 11:38:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2022-04-27 11:38:57,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:38:57,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 21 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-27 11:38:57,817 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 21 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-27 11:38:57,817 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 21 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-27 11:38:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:38:57,822 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-27 11:38:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-27 11:38:57,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:38:57,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:38:57,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 21 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 40 states. [2022-04-27 11:38:57,824 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 21 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 40 states. [2022-04-27 11:38:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:38:57,826 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-27 11:38:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-27 11:38:57,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:38:57,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:38:57,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:38:57,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:38:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 21 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-27 11:38:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-27 11:38:57,830 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2022-04-27 11:38:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:38:57,830 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-27 11:38:57,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:38:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 11:38:57,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:38:57,830 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:38:57,831 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:38:57,853 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-27 11:38:58,031 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-27 11:38:58,031 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:38:58,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:38:58,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1001187082, now seen corresponding path program 2 times [2022-04-27 11:38:58,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:38:58,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949059462] [2022-04-27 11:38:58,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:38:58,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:38:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:38:58,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:38:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:38:58,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {860#(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); {848#true} is VALID [2022-04-27 11:38:58,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {848#true} assume true; {848#true} is VALID [2022-04-27 11:38:58,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {848#true} {848#true} #38#return; {848#true} is VALID [2022-04-27 11:38:58,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {848#true} call ULTIMATE.init(); {860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:38:58,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {860#(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); {848#true} is VALID [2022-04-27 11:38:58,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {848#true} assume true; {848#true} is VALID [2022-04-27 11:38:58,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {848#true} {848#true} #38#return; {848#true} is VALID [2022-04-27 11:38:58,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {848#true} call #t~ret7 := main(); {848#true} is VALID [2022-04-27 11:38:58,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {848#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {848#true} is VALID [2022-04-27 11:38:58,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {853#(= main_~s~0 0)} is VALID [2022-04-27 11:38:58,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#(= 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; {854#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-27 11:38:58,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {854#(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; {855#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:38:58,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {855#(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; {856#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-27 11:38:58,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {856#(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; {857#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-27 11:38:58,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {857#(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; {858#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-27 11:38:58,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {858#(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; {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-27 11:38:58,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-27 11:38:58,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-27 11:38:58,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume ~s~0 % 4294967296 > 65025; {849#false} is VALID [2022-04-27 11:38:58,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {849#false} assume !false; {849#false} is VALID [2022-04-27 11:38:58,193 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-27 11:38:58,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:38:58,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949059462] [2022-04-27 11:38:58,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949059462] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:38:58,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294257461] [2022-04-27 11:38:58,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:38:58,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:38:58,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:38:58,195 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-27 11:38:58,196 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-27 11:38:58,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:38:58,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:38:58,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 11:38:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:38:58,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:38:59,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {848#true} call ULTIMATE.init(); {848#true} is VALID [2022-04-27 11:38:59,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {848#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); {848#true} is VALID [2022-04-27 11:38:59,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {848#true} assume true; {848#true} is VALID [2022-04-27 11:38:59,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {848#true} {848#true} #38#return; {848#true} is VALID [2022-04-27 11:38:59,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {848#true} call #t~ret7 := main(); {848#true} is VALID [2022-04-27 11:38:59,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {848#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {848#true} is VALID [2022-04-27 11:38:59,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {853#(= main_~s~0 0)} is VALID [2022-04-27 11:38:59,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#(= 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; {854#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-27 11:38:59,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {854#(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; {855#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:38:59,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {855#(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; {856#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-27 11:38:59,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {856#(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; {857#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-27 11:38:59,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {857#(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; {858#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-27 11:38:59,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {858#(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; {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-27 11:38:59,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-27 11:38:59,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-27 11:38:59,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume ~s~0 % 4294967296 > 65025; {849#false} is VALID [2022-04-27 11:38:59,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {849#false} assume !false; {849#false} is VALID [2022-04-27 11:38:59,123 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-27 11:38:59,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:39:07,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {849#false} assume !false; {849#false} is VALID [2022-04-27 11:39:07,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {915#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {849#false} is VALID [2022-04-27 11:39:07,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {915#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {915#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-27 11:39:07,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {915#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {915#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-27 11:39:07,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {925#(<= (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; {915#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-27 11:39:07,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {929#(<= (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; {925#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-27 11:39:07,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {933#(<= (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; {929#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-27 11:39:07,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {937#(<= (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; {933#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-27 11:39:07,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {941#(<= (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; {937#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:39:07,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {945#(<= (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; {941#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-27 11:39:07,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {945#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-27 11:39:07,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {848#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {848#true} is VALID [2022-04-27 11:39:07,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {848#true} call #t~ret7 := main(); {848#true} is VALID [2022-04-27 11:39:07,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {848#true} {848#true} #38#return; {848#true} is VALID [2022-04-27 11:39:07,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {848#true} assume true; {848#true} is VALID [2022-04-27 11:39:07,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {848#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); {848#true} is VALID [2022-04-27 11:39:07,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {848#true} call ULTIMATE.init(); {848#true} is VALID [2022-04-27 11:39:07,393 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-27 11:39:07,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294257461] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:39:07,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:39:07,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2022-04-27 11:39:07,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365279627] [2022-04-27 11:39:07,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:39:07,394 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:39:07,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:39:07,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:07,432 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-27 11:39:07,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 11:39:07,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:39:07,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 11:39:07,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:39:07,433 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:39:07,920 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-27 11:39:07,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 11:39:07,920 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:39:07,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:39:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2022-04-27 11:39:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2022-04-27 11:39:07,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 57 transitions. [2022-04-27 11:39:08,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:39:08,016 INFO L225 Difference]: With dead ends: 46 [2022-04-27 11:39:08,016 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 11:39:08,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:39:08,017 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:39:08,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 33 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:39:08,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 11:39:08,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-04-27 11:39:08,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:39:08,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 25 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-27 11:39:08,048 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 25 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-27 11:39:08,048 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 25 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-27 11:39:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:39:08,049 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-27 11:39:08,049 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 11:39:08,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:39:08,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:39:08,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 25 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 32 states. [2022-04-27 11:39:08,050 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 25 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 32 states. [2022-04-27 11:39:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:39:08,051 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-27 11:39:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 11:39:08,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:39:08,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:39:08,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:39:08,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:39:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 25 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-27 11:39:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-27 11:39:08,052 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2022-04-27 11:39:08,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:39:08,052 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-27 11:39:08,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:08,053 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-27 11:39:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:39:08,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:39:08,054 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:39:08,070 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-27 11:39:08,259 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-27 11:39:08,259 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:39:08,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:39:08,260 INFO L85 PathProgramCache]: Analyzing trace with hash -605562839, now seen corresponding path program 3 times [2022-04-27 11:39:08,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:39:08,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315928645] [2022-04-27 11:39:08,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:39:08,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:39:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:39:08,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:39:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:39:08,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {1190#(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); {1174#true} is VALID [2022-04-27 11:39:08,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-27 11:39:08,469 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1174#true} {1174#true} #38#return; {1174#true} is VALID [2022-04-27 11:39:08,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:39:08,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {1190#(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); {1174#true} is VALID [2022-04-27 11:39:08,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-27 11:39:08,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #38#return; {1174#true} is VALID [2022-04-27 11:39:08,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret7 := main(); {1174#true} is VALID [2022-04-27 11:39:08,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1174#true} is VALID [2022-04-27 11:39:08,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {1174#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1179#(= main_~s~0 0)} is VALID [2022-04-27 11:39:08,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#(= 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; {1180#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-27 11:39:08,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {1180#(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; {1181#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:08,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {1181#(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; {1182#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:08,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {1182#(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; {1183#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-27 11:39:08,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {1183#(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; {1184#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-27 11:39:08,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {1184#(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; {1185#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-27 11:39:08,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {1185#(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; {1186#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-27 11:39:08,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {1186#(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; {1187#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:08,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {1187#(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; {1188#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-27 11:39:08,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#(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; {1189#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-27 11:39:08,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {1189#(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); {1189#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-27 11:39:08,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {1189#(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; {1175#false} is VALID [2022-04-27 11:39:08,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2022-04-27 11:39:08,481 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-27 11:39:08,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:39:08,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315928645] [2022-04-27 11:39:08,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315928645] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:39:08,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748346244] [2022-04-27 11:39:08,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:39:08,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:39:08,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:39:08,483 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-27 11:39:08,484 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-27 11:39:08,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-27 11:39:08,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:39:08,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 11:39:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:39:08,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:39:10,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1174#true} is VALID [2022-04-27 11:39:10,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#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); {1174#true} is VALID [2022-04-27 11:39:10,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-27 11:39:10,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #38#return; {1174#true} is VALID [2022-04-27 11:39:10,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret7 := main(); {1174#true} is VALID [2022-04-27 11:39:10,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1174#true} is VALID [2022-04-27 11:39:10,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {1174#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1179#(= main_~s~0 0)} is VALID [2022-04-27 11:39:10,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#(= 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; {1180#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-27 11:39:10,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {1180#(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; {1181#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:10,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {1181#(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; {1182#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:10,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {1182#(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; {1183#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-27 11:39:10,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {1183#(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; {1184#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-27 11:39:10,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {1184#(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; {1185#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-27 11:39:10,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {1185#(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; {1186#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-27 11:39:10,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {1186#(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; {1187#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:10,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {1187#(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; {1188#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-27 11:39:10,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#(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; {1242#(and (<= main_~s~0 (+ 2295 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-27 11:39:10,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {1242#(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); {1242#(and (<= main_~s~0 (+ 2295 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-27 11:39:10,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {1242#(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; {1175#false} is VALID [2022-04-27 11:39:10,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2022-04-27 11:39:10,696 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-27 11:39:10,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:39:22,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2022-04-27 11:39:22,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {1255#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {1175#false} is VALID [2022-04-27 11:39:22,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {1255#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1255#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-27 11:39:22,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {1262#(<= (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; {1255#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-27 11:39:22,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {1266#(<= (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; {1262#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-27 11:39:22,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {1270#(<= (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; {1266#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-27 11:39:22,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {1274#(<= (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; {1270#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:39:22,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {1278#(<= (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; {1274#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-27 11:39:22,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {1282#(<= (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; {1278#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-27 11:39:22,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {1286#(<= (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; {1282#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-27 11:39:22,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {1290#(<= (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; {1286#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-27 11:39:22,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {1294#(<= (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; {1290#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-27 11:39:22,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {1298#(<= (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; {1294#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-27 11:39:22,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {1174#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1298#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-27 11:39:22,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1174#true} is VALID [2022-04-27 11:39:22,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret7 := main(); {1174#true} is VALID [2022-04-27 11:39:22,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #38#return; {1174#true} is VALID [2022-04-27 11:39:22,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-27 11:39:22,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#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); {1174#true} is VALID [2022-04-27 11:39:22,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1174#true} is VALID [2022-04-27 11:39:22,096 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-27 11:39:22,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748346244] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:39:22,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:39:22,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-27 11:39:22,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907752822] [2022-04-27 11:39:22,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:39:22,097 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:39:22,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:39:22,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:22,135 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-27 11:39:22,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 11:39:22,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:39:22,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 11:39:22,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=398, Unknown=0, NotChecked=0, Total=650 [2022-04-27 11:39:22,136 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:23,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:39:23,624 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-04-27 11:39:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-27 11:39:23,624 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:39:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:39:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 85 transitions. [2022-04-27 11:39:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 85 transitions. [2022-04-27 11:39:23,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 85 transitions. [2022-04-27 11:39:23,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:39:23,777 INFO L225 Difference]: With dead ends: 74 [2022-04-27 11:39:23,777 INFO L226 Difference]: Without dead ends: 68 [2022-04-27 11:39:23,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=875, Invalid=1575, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 11:39:23,780 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 137 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:39:23,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 38 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:39:23,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-27 11:39:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 37. [2022-04-27 11:39:23,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:39:23,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:23,843 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:23,843 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:39:23,845 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-27 11:39:23,845 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-27 11:39:23,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:39:23,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:39:23,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (2), 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 68 states. [2022-04-27 11:39:23,846 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (2), 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 68 states. [2022-04-27 11:39:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:39:23,847 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-27 11:39:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-27 11:39:23,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:39:23,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:39:23,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:39:23,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:39:23,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:23,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-04-27 11:39:23,849 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 20 [2022-04-27 11:39:23,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:39:23,850 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-04-27 11:39:23,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-27 11:39:23,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 11:39:23,850 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:39:23,850 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:39:23,874 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-27 11:39:24,067 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-27 11:39:24,067 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:39:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:39:24,068 INFO L85 PathProgramCache]: Analyzing trace with hash -524068618, now seen corresponding path program 3 times [2022-04-27 11:39:24,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:39:24,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592353351] [2022-04-27 11:39:24,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:39:24,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:39:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:39:24,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:39:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:39:24,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {1691#(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); {1671#true} is VALID [2022-04-27 11:39:24,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-27 11:39:24,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1671#true} {1671#true} #38#return; {1671#true} is VALID [2022-04-27 11:39:24,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1691#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:39:24,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {1691#(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); {1671#true} is VALID [2022-04-27 11:39:24,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-27 11:39:24,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #38#return; {1671#true} is VALID [2022-04-27 11:39:24,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret7 := main(); {1671#true} is VALID [2022-04-27 11:39:24,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1671#true} is VALID [2022-04-27 11:39:24,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {1671#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1676#(= main_~s~0 0)} is VALID [2022-04-27 11:39:24,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {1676#(= 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; {1677#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-27 11:39:24,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {1677#(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; {1678#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:24,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {1678#(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; {1679#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:24,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {1679#(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; {1680#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-27 11:39:24,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {1680#(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; {1681#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-27 11:39:24,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {1681#(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; {1682#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-27 11:39:24,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {1682#(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; {1683#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-27 11:39:24,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {1683#(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; {1684#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:24,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {1684#(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; {1685#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-27 11:39:24,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#(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; {1686#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:24,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {1686#(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; {1687#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-27 11:39:24,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {1687#(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; {1688#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:24,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {1688#(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; {1689#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:24,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {1689#(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; {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:24,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:24,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:24,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {1672#false} is VALID [2022-04-27 11:39:24,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {1672#false} assume !false; {1672#false} is VALID [2022-04-27 11:39:24,413 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-27 11:39:24,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:39:24,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592353351] [2022-04-27 11:39:24,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592353351] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:39:24,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450312133] [2022-04-27 11:39:24,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:39:24,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:39:24,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:39:24,416 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-27 11:39:24,416 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-27 11:39:24,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-04-27 11:39:24,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:39:24,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-27 11:39:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:39:24,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:39:26,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1671#true} is VALID [2022-04-27 11:39:26,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#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); {1671#true} is VALID [2022-04-27 11:39:26,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-27 11:39:26,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #38#return; {1671#true} is VALID [2022-04-27 11:39:26,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret7 := main(); {1671#true} is VALID [2022-04-27 11:39:26,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1671#true} is VALID [2022-04-27 11:39:27,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {1671#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1676#(= main_~s~0 0)} is VALID [2022-04-27 11:39:27,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {1676#(= 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; {1677#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-27 11:39:27,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {1677#(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; {1678#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:27,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {1678#(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; {1679#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:27,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {1679#(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; {1680#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-27 11:39:27,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {1680#(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; {1681#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-27 11:39:27,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {1681#(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; {1682#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-27 11:39:27,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {1682#(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; {1683#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-27 11:39:27,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {1683#(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; {1684#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:27,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {1684#(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; {1685#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-27 11:39:27,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#(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; {1686#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:27,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {1686#(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; {1687#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-27 11:39:27,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {1687#(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; {1688#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:27,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {1688#(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; {1689#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:27,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {1689#(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; {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:27,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:27,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:27,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {1672#false} is VALID [2022-04-27 11:39:27,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {1672#false} assume !false; {1672#false} is VALID [2022-04-27 11:39:27,011 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-27 11:39:27,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:39:47,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {1672#false} assume !false; {1672#false} is VALID [2022-04-27 11:39:47,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {1770#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {1672#false} is VALID [2022-04-27 11:39:47,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {1770#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {1770#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-27 11:39:47,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {1770#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1770#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-27 11:39:47,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {1780#(<= (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; {1770#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-27 11:39:47,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {1784#(<= (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; {1780#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-27 11:39:47,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {1788#(<= (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; {1784#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-27 11:39:47,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {1792#(<= (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; {1788#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-27 11:39:47,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {1796#(<= (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; {1792#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:39:47,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {1800#(<= (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; {1796#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-27 11:39:47,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {1804#(<= (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; {1800#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-27 11:39:47,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {1808#(<= (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; {1804#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-27 11:39:47,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {1812#(<= (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; {1808#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-27 11:39:47,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {1816#(<= (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; {1812#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is VALID [2022-04-27 11:39:47,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {1820#(<= (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; {1816#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:39:47,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {1824#(<= (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; {1820#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} is VALID [2022-04-27 11:39:47,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#(<= (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; {1824#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:39:47,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {1832#(<= (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; {1828#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} is VALID [2022-04-27 11:39:47,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {1671#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1832#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} is VALID [2022-04-27 11:39:47,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1671#true} is VALID [2022-04-27 11:39:47,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret7 := main(); {1671#true} is VALID [2022-04-27 11:39:47,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #38#return; {1671#true} is VALID [2022-04-27 11:39:47,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-27 11:39:47,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#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); {1671#true} is VALID [2022-04-27 11:39:47,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1671#true} is VALID [2022-04-27 11:39:47,364 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-27 11:39:47,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450312133] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:39:47,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:39:47,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 33 [2022-04-27 11:39:47,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407017491] [2022-04-27 11:39:47,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:39:47,364 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 11:39:47,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:39:47,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:47,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:39:47,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-27 11:39:47,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:39:47,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-27 11:39:47,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 11:39:47,483 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:48,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:39:48,971 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2022-04-27 11:39:48,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-27 11:39:48,972 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 11:39:48,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:39:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 101 transitions. [2022-04-27 11:39:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 101 transitions. [2022-04-27 11:39:48,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 101 transitions. [2022-04-27 11:39:49,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:39:49,397 INFO L225 Difference]: With dead ends: 78 [2022-04-27 11:39:49,397 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 11:39:49,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 23 SyntacticMatches, 15 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2022-04-27 11:39:49,399 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 127 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:39:49,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 28 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:39:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 11:39:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2022-04-27 11:39:49,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:39:49,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:49,462 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:49,462 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:49,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:39:49,463 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-27 11:39:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-27 11:39:49,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:39:49,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:39:49,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (2), 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 52 states. [2022-04-27 11:39:49,464 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (2), 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 52 states. [2022-04-27 11:39:49,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:39:49,465 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-27 11:39:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-27 11:39:49,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:39:49,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:39:49,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:39:49,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:39:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:49,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-04-27 11:39:49,466 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 25 [2022-04-27 11:39:49,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:39:49,466 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-04-27 11:39:49,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:39:49,466 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-27 11:39:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:39:49,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:39:49,467 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:39:49,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 11:39:49,671 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-27 11:39:49,673 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:39:49,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:39:49,674 INFO L85 PathProgramCache]: Analyzing trace with hash 645625897, now seen corresponding path program 4 times [2022-04-27 11:39:49,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:39:49,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953994562] [2022-04-27 11:39:49,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:39:49,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:39:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:39:50,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:39:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:39:50,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {2241#(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); {2213#true} is VALID [2022-04-27 11:39:50,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {2213#true} assume true; {2213#true} is VALID [2022-04-27 11:39:50,209 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2213#true} {2213#true} #38#return; {2213#true} is VALID [2022-04-27 11:39:50,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {2213#true} call ULTIMATE.init(); {2241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:39:50,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {2241#(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); {2213#true} is VALID [2022-04-27 11:39:50,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {2213#true} assume true; {2213#true} is VALID [2022-04-27 11:39:50,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2213#true} {2213#true} #38#return; {2213#true} is VALID [2022-04-27 11:39:50,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {2213#true} call #t~ret7 := main(); {2213#true} is VALID [2022-04-27 11:39:50,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {2213#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2213#true} is VALID [2022-04-27 11:39:50,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {2213#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2218#(= main_~s~0 0)} is VALID [2022-04-27 11:39:50,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {2218#(= 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; {2219#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-27 11:39:50,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {2219#(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; {2220#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:50,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {2220#(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; {2221#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:50,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {2221#(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; {2222#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-27 11:39:50,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {2222#(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; {2223#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-27 11:39:50,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {2223#(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; {2224#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-27 11:39:50,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {2224#(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; {2225#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-27 11:39:50,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {2225#(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; {2226#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:50,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {2226#(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; {2227#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-27 11:39:50,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {2227#(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; {2228#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:50,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {2228#(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; {2229#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-27 11:39:50,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {2229#(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; {2230#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:50,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {2230#(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; {2231#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:50,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {2231#(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; {2232#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:50,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {2232#(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; {2233#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-27 11:39:50,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {2233#(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; {2234#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-27 11:39:50,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {2234#(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; {2235#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-27 11:39:50,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {2235#(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; {2236#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:50,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {2236#(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; {2237#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-27 11:39:50,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {2237#(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; {2238#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-27 11:39:50,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {2238#(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; {2239#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-27 11:39:50,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {2239#(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; {2240#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-27 11:39:50,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {2240#(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); {2240#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-27 11:39:50,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {2240#(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; {2214#false} is VALID [2022-04-27 11:39:50,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {2214#false} assume !false; {2214#false} is VALID [2022-04-27 11:39:50,229 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-27 11:39:50,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:39:50,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953994562] [2022-04-27 11:39:50,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953994562] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:39:50,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308831639] [2022-04-27 11:39:50,229 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:39:50,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:39:50,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:39:50,231 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-27 11:39:50,231 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-27 11:39:50,313 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:39:50,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:39:50,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-27 11:39:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:39:50,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:39:53,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {2213#true} call ULTIMATE.init(); {2213#true} is VALID [2022-04-27 11:39:53,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {2213#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); {2213#true} is VALID [2022-04-27 11:39:53,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {2213#true} assume true; {2213#true} is VALID [2022-04-27 11:39:53,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2213#true} {2213#true} #38#return; {2213#true} is VALID [2022-04-27 11:39:53,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {2213#true} call #t~ret7 := main(); {2213#true} is VALID [2022-04-27 11:39:53,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {2213#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2213#true} is VALID [2022-04-27 11:39:53,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {2213#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2218#(= main_~s~0 0)} is VALID [2022-04-27 11:39:53,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {2218#(= 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; {2219#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-27 11:39:53,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {2219#(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; {2220#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:53,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {2220#(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; {2221#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:53,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {2221#(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; {2222#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-27 11:39:53,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {2222#(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; {2223#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-27 11:39:53,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {2223#(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; {2224#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-27 11:39:53,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {2224#(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; {2225#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-27 11:39:53,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {2225#(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; {2226#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:53,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {2226#(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; {2227#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-27 11:39:53,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {2227#(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; {2228#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:53,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {2228#(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; {2229#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-27 11:39:53,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {2229#(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; {2230#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:53,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {2230#(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; {2231#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:53,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {2231#(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; {2232#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:53,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {2232#(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; {2233#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-27 11:39:53,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {2233#(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; {2234#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-27 11:39:53,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {2234#(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; {2235#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-27 11:39:54,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {2235#(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; {2236#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-27 11:39:54,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {2236#(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; {2237#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-27 11:39:54,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {2237#(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; {2238#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-27 11:39:54,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {2238#(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; {2239#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-27 11:39:54,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {2239#(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; {2329#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 5355 (mod main_~v~0 256))))} is VALID [2022-04-27 11:39:54,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {2329#(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); {2329#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 5355 (mod main_~v~0 256))))} is VALID [2022-04-27 11:39:54,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {2329#(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; {2214#false} is VALID [2022-04-27 11:39:54,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {2214#false} assume !false; {2214#false} is VALID [2022-04-27 11:39:54,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-27 11:39:54,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:40:25,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {2214#false} assume !false; {2214#false} is VALID [2022-04-27 11:40:25,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {2342#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {2214#false} is VALID [2022-04-27 11:40:25,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {2342#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {2342#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-27 11:40:25,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {2349#(<= (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; {2342#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-27 11:40:25,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {2353#(<= (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; {2349#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-27 11:40:25,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {2357#(<= (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; {2353#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-27 11:40:25,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {2361#(<= (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; {2357#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:40:25,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {2365#(<= (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; {2361#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-27 11:40:25,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {2369#(<= (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; {2365#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-27 11:40:25,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {2373#(<= (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; {2369#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-27 11:40:25,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {2377#(<= (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; {2373#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-27 11:40:25,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {2381#(<= (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; {2377#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-27 11:40:25,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {2385#(<= (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; {2381#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-27 11:40:25,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {2389#(<= (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; {2385#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-27 11:40:25,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {2393#(<= (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; {2389#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:40:25,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {2397#(<= (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; {2393#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} is VALID [2022-04-27 11:40:25,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {2401#(<= (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; {2397#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:40:25,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {2405#(<= (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; {2401#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} is VALID [2022-04-27 11:40:25,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {2409#(<= (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; {2405#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} is VALID [2022-04-27 11:40:25,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {2413#(<= (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; {2409#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:40:25,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {2417#(<= (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; {2413#(<= (div (+ (- 68719481072) (* (- 1) main_~s~0)) (- 4294967296)) (+ 33 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} is VALID [2022-04-27 11:40:25,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {2421#(<= (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; {2417#(<= (div (+ (* (- 1) main_~s~0) (- 73014448623)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 35))} is VALID [2022-04-27 11:40:25,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {2425#(<= (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; {2421#(<= (div (+ (* (- 1) main_~s~0) (- 77309416174)) (- 4294967296)) (+ (div (+ (- 77309411328) main_~s~0) 4294967296) 37))} is VALID [2022-04-27 11:40:25,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {2429#(<= (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; {2425#(<= (div (+ (- 81604383725) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 39))} is VALID [2022-04-27 11:40:25,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {2433#(<= (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; {2429#(<= (div (+ (* (- 1) main_~s~0) (- 85899351276)) (- 4294967296)) (+ 41 (div (+ main_~s~0 (- 85899345920)) 4294967296)))} is VALID [2022-04-27 11:40:25,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {2213#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2433#(<= (div (+ (- 90194318827) (* (- 1) main_~s~0)) (- 4294967296)) (+ 43 (div (+ main_~s~0 (- 90194313216)) 4294967296)))} is VALID [2022-04-27 11:40:25,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {2213#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2213#true} is VALID [2022-04-27 11:40:25,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {2213#true} call #t~ret7 := main(); {2213#true} is VALID [2022-04-27 11:40:25,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2213#true} {2213#true} #38#return; {2213#true} is VALID [2022-04-27 11:40:25,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {2213#true} assume true; {2213#true} is VALID [2022-04-27 11:40:25,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {2213#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); {2213#true} is VALID [2022-04-27 11:40:25,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {2213#true} call ULTIMATE.init(); {2213#true} is VALID [2022-04-27 11:40:25,231 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-27 11:40:25,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308831639] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:40:25,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:40:25,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-27 11:40:25,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311250155] [2022-04-27 11:40:25,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:40:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:40:25,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:40:25,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:25,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:40:25,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 11:40:25,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:40:25,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 11:40:25,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1068, Invalid=1382, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 11:40:25,333 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:29,051 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-27 11:40:29,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-27 11:40:29,051 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:40:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:40:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:29,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 157 transitions. [2022-04-27 11:40:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 157 transitions. [2022-04-27 11:40:29,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 157 transitions. [2022-04-27 11:40:29,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:40:29,416 INFO L225 Difference]: With dead ends: 134 [2022-04-27 11:40:29,416 INFO L226 Difference]: Without dead ends: 124 [2022-04-27 11:40:29,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 21 SyntacticMatches, 21 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3467, Invalid=6039, Unknown=0, NotChecked=0, Total=9506 [2022-04-27 11:40:29,419 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 324 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:40:29,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 43 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:40:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-27 11:40:29,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 61. [2022-04-27 11:40:29,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:40:29,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 57 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:29,519 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 57 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:29,520 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 57 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:29,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:29,522 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2022-04-27 11:40:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2022-04-27 11:40:29,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:40:29,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:40:29,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 57 states have internal predecessors, (74), 2 states have call successors, (2), 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 124 states. [2022-04-27 11:40:29,523 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 57 states have internal predecessors, (74), 2 states have call successors, (2), 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 124 states. [2022-04-27 11:40:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:29,525 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2022-04-27 11:40:29,525 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2022-04-27 11:40:29,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:40:29,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:40:29,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:40:29,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:40:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 57 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2022-04-27 11:40:29,527 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 32 [2022-04-27 11:40:29,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:40:29,527 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2022-04-27 11:40:29,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2022-04-27 11:40:29,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 11:40:29,527 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:40:29,527 INFO L195 NwaCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:40:29,557 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-27 11:40:29,755 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-27 11:40:29,756 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:40:29,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:40:29,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1558436086, now seen corresponding path program 4 times [2022-04-27 11:40:29,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:40:29,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992841062] [2022-04-27 11:40:29,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:40:29,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:40:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:30,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:40:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:30,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {3134#(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); {3098#true} is VALID [2022-04-27 11:40:30,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {3098#true} assume true; {3098#true} is VALID [2022-04-27 11:40:30,366 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3098#true} {3098#true} #38#return; {3098#true} is VALID [2022-04-27 11:40:30,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {3098#true} call ULTIMATE.init(); {3134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:40:30,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {3134#(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); {3098#true} is VALID [2022-04-27 11:40:30,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {3098#true} assume true; {3098#true} is VALID [2022-04-27 11:40:30,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3098#true} {3098#true} #38#return; {3098#true} is VALID [2022-04-27 11:40:30,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {3098#true} call #t~ret7 := main(); {3098#true} is VALID [2022-04-27 11:40:30,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {3098#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3098#true} is VALID [2022-04-27 11:40:30,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {3098#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {3103#(= main_~s~0 0)} is VALID [2022-04-27 11:40:30,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {3103#(= 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; {3104#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-27 11:40:30,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {3104#(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; {3105#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:30,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {3105#(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; {3106#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:30,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {3106#(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; {3107#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-27 11:40:30,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {3107#(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; {3108#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-27 11:40:30,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {3108#(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; {3109#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-27 11:40:30,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {3109#(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; {3110#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-27 11:40:30,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {3110#(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; {3111#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:30,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {3111#(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; {3112#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-27 11:40:30,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {3112#(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; {3113#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:30,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {3113#(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; {3114#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-27 11:40:30,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {3114#(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; {3115#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:30,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {3115#(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; {3116#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:30,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {3116#(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; {3117#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:30,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {3117#(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; {3118#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-27 11:40:30,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {3118#(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; {3119#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-27 11:40:30,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {3119#(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; {3120#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-27 11:40:30,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {3120#(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; {3121#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:30,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {3121#(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; {3122#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-27 11:40:30,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {3122#(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; {3123#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-27 11:40:30,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {3123#(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; {3124#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-27 11:40:30,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {3124#(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; {3125#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:30,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {3125#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3126#(and (<= main_~s~0 5865) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:30,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {3126#(and (<= main_~s~0 5865) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3127#(and (<= 0 main_~s~0) (<= main_~s~0 6120))} is VALID [2022-04-27 11:40:30,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {3127#(and (<= 0 main_~s~0) (<= main_~s~0 6120))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3128#(and (<= main_~s~0 6375) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:30,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {3128#(and (<= main_~s~0 6375) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3129#(and (<= main_~s~0 6630) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:30,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {3129#(and (<= main_~s~0 6630) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3130#(and (<= main_~s~0 6885) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:30,383 INFO L290 TraceCheckUtils]: 34: Hoare triple {3130#(and (<= main_~s~0 6885) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3131#(and (<= main_~s~0 7140) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:30,383 INFO L290 TraceCheckUtils]: 35: Hoare triple {3131#(and (<= main_~s~0 7140) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3132#(and (<= 0 main_~s~0) (<= main_~s~0 7395))} is VALID [2022-04-27 11:40:30,384 INFO L290 TraceCheckUtils]: 36: Hoare triple {3132#(and (<= 0 main_~s~0) (<= main_~s~0 7395))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} is VALID [2022-04-27 11:40:30,384 INFO L290 TraceCheckUtils]: 37: Hoare triple {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} is VALID [2022-04-27 11:40:30,384 INFO L290 TraceCheckUtils]: 38: Hoare triple {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} is VALID [2022-04-27 11:40:30,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} assume ~s~0 % 4294967296 > 65025; {3099#false} is VALID [2022-04-27 11:40:30,385 INFO L290 TraceCheckUtils]: 40: Hoare triple {3099#false} assume !false; {3099#false} is VALID [2022-04-27 11:40:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:40:30,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:40:30,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992841062] [2022-04-27 11:40:30,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992841062] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:40:30,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655630851] [2022-04-27 11:40:30,386 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:40:30,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:40:30,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:40:30,387 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-27 11:40:30,387 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-27 11:40:30,541 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:40:30,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:40:30,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-27 11:40:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:30,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:40:34,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {3098#true} call ULTIMATE.init(); {3098#true} is VALID [2022-04-27 11:40:34,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {3098#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); {3098#true} is VALID [2022-04-27 11:40:34,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {3098#true} assume true; {3098#true} is VALID [2022-04-27 11:40:34,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3098#true} {3098#true} #38#return; {3098#true} is VALID [2022-04-27 11:40:34,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {3098#true} call #t~ret7 := main(); {3098#true} is VALID [2022-04-27 11:40:34,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {3098#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3098#true} is VALID [2022-04-27 11:40:34,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {3098#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {3103#(= main_~s~0 0)} is VALID [2022-04-27 11:40:34,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {3103#(= 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; {3104#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-27 11:40:34,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {3104#(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; {3105#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:34,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {3105#(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; {3106#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:34,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {3106#(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; {3107#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-27 11:40:34,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {3107#(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; {3108#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-27 11:40:34,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {3108#(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; {3109#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-27 11:40:34,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {3109#(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; {3110#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-27 11:40:34,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {3110#(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; {3111#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:34,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {3111#(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; {3112#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-27 11:40:34,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {3112#(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; {3113#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:34,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {3113#(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; {3114#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-27 11:40:34,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {3114#(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; {3115#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:34,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {3115#(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; {3116#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:34,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {3116#(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; {3117#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:34,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {3117#(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; {3118#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-27 11:40:34,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {3118#(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; {3119#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-27 11:40:34,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {3119#(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; {3120#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-27 11:40:34,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {3120#(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; {3121#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:34,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {3121#(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; {3122#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-27 11:40:34,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {3122#(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; {3123#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-27 11:40:34,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {3123#(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; {3124#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-27 11:40:34,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {3124#(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; {3125#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:34,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {3125#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3126#(and (<= main_~s~0 5865) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:34,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {3126#(and (<= main_~s~0 5865) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3127#(and (<= 0 main_~s~0) (<= main_~s~0 6120))} is VALID [2022-04-27 11:40:34,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {3127#(and (<= 0 main_~s~0) (<= main_~s~0 6120))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3128#(and (<= main_~s~0 6375) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:34,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {3128#(and (<= main_~s~0 6375) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3129#(and (<= main_~s~0 6630) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:34,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {3129#(and (<= main_~s~0 6630) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3130#(and (<= main_~s~0 6885) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:34,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {3130#(and (<= main_~s~0 6885) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3131#(and (<= main_~s~0 7140) (<= 0 main_~s~0))} is VALID [2022-04-27 11:40:34,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {3131#(and (<= main_~s~0 7140) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3132#(and (<= 0 main_~s~0) (<= main_~s~0 7395))} is VALID [2022-04-27 11:40:34,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {3132#(and (<= 0 main_~s~0) (<= main_~s~0 7395))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} is VALID [2022-04-27 11:40:34,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} is VALID [2022-04-27 11:40:34,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} is VALID [2022-04-27 11:40:34,840 INFO L290 TraceCheckUtils]: 39: Hoare triple {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} assume ~s~0 % 4294967296 > 65025; {3099#false} is VALID [2022-04-27 11:40:34,840 INFO L290 TraceCheckUtils]: 40: Hoare triple {3099#false} assume !false; {3099#false} is VALID [2022-04-27 11:40:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:40:34,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:41:19,720 INFO L290 TraceCheckUtils]: 40: Hoare triple {3099#false} assume !false; {3099#false} is VALID [2022-04-27 11:41:19,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {3261#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {3099#false} is VALID [2022-04-27 11:41:19,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {3261#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {3261#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-27 11:41:19,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {3261#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3261#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-27 11:41:19,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {3271#(<= (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; {3261#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-27 11:41:19,731 INFO L290 TraceCheckUtils]: 35: Hoare triple {3275#(<= (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; {3271#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-27 11:41:19,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {3279#(<= (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; {3275#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-27 11:41:19,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {3283#(<= (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; {3279#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-27 11:41:19,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {3287#(<= (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; {3283#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:41:19,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {3291#(<= (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; {3287#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-27 11:41:19,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {3295#(<= (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; {3291#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-27 11:41:19,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {3299#(<= (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; {3295#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-27 11:41:19,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {3303#(<= (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; {3299#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-27 11:41:19,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {3307#(<= (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; {3303#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is VALID [2022-04-27 11:41:19,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {3311#(<= (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; {3307#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:41:19,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {3315#(<= (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; {3311#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} is VALID [2022-04-27 11:41:19,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {3319#(<= (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; {3315#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:41:19,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {3323#(<= (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; {3319#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} is VALID [2022-04-27 11:41:19,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {3327#(<= (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; {3323#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} is VALID [2022-04-27 11:41:19,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {3331#(<= (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; {3327#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:41:19,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {3335#(<= (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; {3331#(<= (div (+ (* (- 1) main_~s~0) (- 64424448495)) (- 4294967296)) (+ 31 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} is VALID [2022-04-27 11:41:19,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {3339#(<= (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; {3335#(<= (div (+ (- 68719416046) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 33))} is VALID [2022-04-27 11:41:19,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {3343#(<= (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; {3339#(<= (div (+ (- 73014383597) (* (- 1) main_~s~0)) (- 4294967296)) (+ 35 (div (+ (- 77309411328) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:41:19,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {3347#(<= (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; {3343#(<= (div (+ (- 77309351148) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 37))} is VALID [2022-04-27 11:41:19,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {3351#(<= (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; {3347#(<= (div (+ (- 81604318699) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 85899345920)) 4294967296) 39))} is VALID [2022-04-27 11:41:19,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {3355#(<= (div (+ (* (- 1) main_~s~0) (- 90194253801)) (- 4294967296)) (+ 43 (div (+ (- 94489280512) 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; {3351#(<= (div (+ (* (- 1) main_~s~0) (- 85899286250)) (- 4294967296)) (+ 41 (div (+ main_~s~0 (- 90194313216)) 4294967296)))} is VALID [2022-04-27 11:41:19,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {3359#(<= (div (+ (* (- 1) main_~s~0) (- 94489221352)) (- 4294967296)) (+ (div (+ main_~s~0 (- 98784247808)) 4294967296) 45))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3355#(<= (div (+ (* (- 1) main_~s~0) (- 90194253801)) (- 4294967296)) (+ 43 (div (+ (- 94489280512) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:41:19,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {3363#(<= (div (+ (- 98784188903) (* (- 1) main_~s~0)) (- 4294967296)) (+ 47 (div (+ (- 103079215104) 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; {3359#(<= (div (+ (* (- 1) main_~s~0) (- 94489221352)) (- 4294967296)) (+ (div (+ main_~s~0 (- 98784247808)) 4294967296) 45))} is VALID [2022-04-27 11:41:19,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {3367#(<= (div (+ (- 103079156454) (* (- 1) main_~s~0)) (- 4294967296)) (+ 49 (div (+ (- 107374182400) 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; {3363#(<= (div (+ (- 98784188903) (* (- 1) main_~s~0)) (- 4294967296)) (+ 47 (div (+ (- 103079215104) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:41:19,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {3371#(<= (div (+ (- 107374124005) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 111669149696)) 4294967296) 51))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3367#(<= (div (+ (- 103079156454) (* (- 1) main_~s~0)) (- 4294967296)) (+ 49 (div (+ (- 107374182400) main_~s~0) 4294967296)))} is VALID [2022-04-27 11:41:20,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {3375#(<= (div (+ (* (- 1) main_~s~0) (- 111669091556)) (- 4294967296)) (+ 53 (div (+ main_~s~0 (- 115964116992)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3371#(<= (div (+ (- 107374124005) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 111669149696)) 4294967296) 51))} is VALID [2022-04-27 11:41:20,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {3379#(<= (div (+ (- 115964059107) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 120259084288)) 4294967296) 55))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3375#(<= (div (+ (* (- 1) main_~s~0) (- 111669091556)) (- 4294967296)) (+ 53 (div (+ main_~s~0 (- 115964116992)) 4294967296)))} is VALID [2022-04-27 11:41:20,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {3383#(<= (div (+ (* (- 1) main_~s~0) (- 120259026658)) (- 4294967296)) (+ (div (+ main_~s~0 (- 124554051584)) 4294967296) 57))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3379#(<= (div (+ (- 115964059107) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 120259084288)) 4294967296) 55))} is VALID [2022-04-27 11:41:20,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {3387#(<= (div (+ (- 124553994209) (* (- 1) main_~s~0)) (- 4294967296)) (+ 59 (div (+ main_~s~0 (- 128849018880)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3383#(<= (div (+ (* (- 1) main_~s~0) (- 120259026658)) (- 4294967296)) (+ (div (+ main_~s~0 (- 124554051584)) 4294967296) 57))} is VALID [2022-04-27 11:41:20,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {3098#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {3387#(<= (div (+ (- 124553994209) (* (- 1) main_~s~0)) (- 4294967296)) (+ 59 (div (+ main_~s~0 (- 128849018880)) 4294967296)))} is VALID [2022-04-27 11:41:20,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {3098#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3098#true} is VALID [2022-04-27 11:41:20,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {3098#true} call #t~ret7 := main(); {3098#true} is VALID [2022-04-27 11:41:20,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3098#true} {3098#true} #38#return; {3098#true} is VALID [2022-04-27 11:41:20,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {3098#true} assume true; {3098#true} is VALID [2022-04-27 11:41:20,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {3098#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); {3098#true} is VALID [2022-04-27 11:41:20,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {3098#true} call ULTIMATE.init(); {3098#true} is VALID [2022-04-27 11:41:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:41:20,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655630851] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:41:20,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:41:20,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 65 [2022-04-27 11:41:20,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579102298] [2022-04-27 11:41:20,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:41:20,023 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 11:41:20,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:41:20,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:20,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:41:20,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-27 11:41:20,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:41:20,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-27 11:41:20,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2022-04-27 11:41:20,280 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:25,492 INFO L93 Difference]: Finished difference Result 142 states and 189 transitions. [2022-04-27 11:41:25,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-27 11:41:25,492 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 11:41:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:41:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 189 transitions. [2022-04-27 11:41:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 189 transitions. [2022-04-27 11:41:25,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 189 transitions. [2022-04-27 11:41:27,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:41:27,122 INFO L225 Difference]: With dead ends: 142 [2022-04-27 11:41:27,122 INFO L226 Difference]: Without dead ends: 92 [2022-04-27 11:41:27,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 23 SyntacticMatches, 31 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2791 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=6048, Invalid=9954, Unknown=0, NotChecked=0, Total=16002 [2022-04-27 11:41:27,126 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 341 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 11:41:27,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 33 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 11:41:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-27 11:41:27,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2022-04-27 11:41:27,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:41:27,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 77 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:27,254 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 77 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:27,254 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 77 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:27,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:27,257 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-27 11:41:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-27 11:41:27,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:41:27,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:41:27,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 2 states have call successors, (2), 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 92 states. [2022-04-27 11:41:27,257 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 2 states have call successors, (2), 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 92 states. [2022-04-27 11:41:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:41:27,259 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-27 11:41:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-27 11:41:27,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:41:27,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:41:27,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:41:27,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:41:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2022-04-27 11:41:27,261 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 41 [2022-04-27 11:41:27,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:41:27,261 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2022-04-27 11:41:27,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:41:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2022-04-27 11:41:27,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 11:41:27,262 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:41:27,262 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:41:27,278 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-27 11:41:27,464 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-27 11:41:27,465 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:41:27,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:41:27,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1034766295, now seen corresponding path program 5 times [2022-04-27 11:41:27,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:41:27,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219869703] [2022-04-27 11:41:27,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:41:27,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:41:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:41:28,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:41:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:41:28,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {4124#(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); {4072#true} is VALID [2022-04-27 11:41:28,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {4072#true} assume true; {4072#true} is VALID [2022-04-27 11:41:28,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4072#true} {4072#true} #38#return; {4072#true} is VALID [2022-04-27 11:41:28,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {4072#true} call ULTIMATE.init(); {4124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:41:28,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {4124#(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); {4072#true} is VALID [2022-04-27 11:41:28,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {4072#true} assume true; {4072#true} is VALID [2022-04-27 11:41:28,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4072#true} {4072#true} #38#return; {4072#true} is VALID [2022-04-27 11:41:28,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {4072#true} call #t~ret7 := main(); {4072#true} is VALID [2022-04-27 11:41:28,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {4072#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4072#true} is VALID [2022-04-27 11:41:28,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {4072#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {4077#(= main_~s~0 0)} is VALID [2022-04-27 11:41:28,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {4077#(= 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; {4078#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-27 11:41:28,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {4078#(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; {4079#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {4079#(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; {4080#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {4080#(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; {4081#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-27 11:41:28,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {4081#(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; {4082#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-27 11:41:28,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {4082#(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; {4083#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-27 11:41:28,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {4083#(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; {4084#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-27 11:41:28,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {4084#(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; {4085#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {4085#(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; {4086#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-27 11:41:28,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {4086#(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; {4087#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {4087#(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; {4088#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-27 11:41:28,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {4088#(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; {4089#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {4089#(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; {4090#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {4090#(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; {4091#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {4091#(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; {4092#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-27 11:41:28,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {4092#(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; {4093#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-27 11:41:28,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {4093#(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; {4094#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-27 11:41:28,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {4094#(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; {4095#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {4095#(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; {4096#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-27 11:41:28,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {4096#(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; {4097#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-27 11:41:28,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {4097#(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; {4098#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-27 11:41:28,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {4098#(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; {4099#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {4099#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4100#(and (<= main_~s~0 5865) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {4100#(and (<= main_~s~0 5865) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4101#(and (<= 0 main_~s~0) (<= main_~s~0 6120))} is VALID [2022-04-27 11:41:28,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {4101#(and (<= 0 main_~s~0) (<= main_~s~0 6120))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4102#(and (<= main_~s~0 6375) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,895 INFO L290 TraceCheckUtils]: 32: Hoare triple {4102#(and (<= main_~s~0 6375) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4103#(and (<= main_~s~0 6630) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {4103#(and (<= main_~s~0 6630) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4104#(and (<= main_~s~0 6885) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {4104#(and (<= main_~s~0 6885) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4105#(and (<= main_~s~0 7140) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,897 INFO L290 TraceCheckUtils]: 35: Hoare triple {4105#(and (<= main_~s~0 7140) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4106#(and (<= 0 main_~s~0) (<= main_~s~0 7395))} is VALID [2022-04-27 11:41:28,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {4106#(and (<= 0 main_~s~0) (<= main_~s~0 7395))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4107#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} is VALID [2022-04-27 11:41:28,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {4107#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4108#(and (<= main_~s~0 7905) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {4108#(and (<= main_~s~0 7905) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4109#(and (<= main_~s~0 8160) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {4109#(and (<= main_~s~0 8160) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4110#(and (<= main_~s~0 8415) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,901 INFO L290 TraceCheckUtils]: 40: Hoare triple {4110#(and (<= main_~s~0 8415) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4111#(and (<= 0 main_~s~0) (<= main_~s~0 8670))} is VALID [2022-04-27 11:41:28,902 INFO L290 TraceCheckUtils]: 41: Hoare triple {4111#(and (<= 0 main_~s~0) (<= main_~s~0 8670))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4112#(and (<= main_~s~0 8925) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,902 INFO L290 TraceCheckUtils]: 42: Hoare triple {4112#(and (<= main_~s~0 8925) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4113#(and (<= 0 main_~s~0) (<= main_~s~0 9180))} is VALID [2022-04-27 11:41:28,903 INFO L290 TraceCheckUtils]: 43: Hoare triple {4113#(and (<= 0 main_~s~0) (<= main_~s~0 9180))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4114#(and (<= main_~s~0 9435) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {4114#(and (<= main_~s~0 9435) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4115#(and (<= main_~s~0 9690) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {4115#(and (<= main_~s~0 9690) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4116#(and (<= 0 main_~s~0) (<= main_~s~0 9945))} is VALID [2022-04-27 11:41:28,905 INFO L290 TraceCheckUtils]: 46: Hoare triple {4116#(and (<= 0 main_~s~0) (<= main_~s~0 9945))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4117#(and (<= 0 main_~s~0) (<= main_~s~0 10200))} is VALID [2022-04-27 11:41:28,906 INFO L290 TraceCheckUtils]: 47: Hoare triple {4117#(and (<= 0 main_~s~0) (<= main_~s~0 10200))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4118#(and (<= 0 main_~s~0) (<= main_~s~0 10455))} is VALID [2022-04-27 11:41:28,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {4118#(and (<= 0 main_~s~0) (<= main_~s~0 10455))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4119#(and (<= 0 main_~s~0) (<= main_~s~0 10710))} is VALID [2022-04-27 11:41:28,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {4119#(and (<= 0 main_~s~0) (<= main_~s~0 10710))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4120#(and (<= main_~s~0 10965) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,908 INFO L290 TraceCheckUtils]: 50: Hoare triple {4120#(and (<= main_~s~0 10965) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4121#(and (<= main_~s~0 11220) (<= 0 main_~s~0))} is VALID [2022-04-27 11:41:28,908 INFO L290 TraceCheckUtils]: 51: Hoare triple {4121#(and (<= main_~s~0 11220) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4122#(and (<= 0 main_~s~0) (<= main_~s~0 11475))} is VALID [2022-04-27 11:41:28,909 INFO L290 TraceCheckUtils]: 52: Hoare triple {4122#(and (<= 0 main_~s~0) (<= main_~s~0 11475))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4123#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-27 11:41:28,910 INFO L290 TraceCheckUtils]: 53: Hoare triple {4123#(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); {4123#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-27 11:41:28,910 INFO L290 TraceCheckUtils]: 54: Hoare triple {4123#(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; {4073#false} is VALID [2022-04-27 11:41:28,910 INFO L290 TraceCheckUtils]: 55: Hoare triple {4073#false} assume !false; {4073#false} is VALID [2022-04-27 11:41:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:41:28,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:41:28,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219869703] [2022-04-27 11:41:28,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219869703] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:41:28,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080143154] [2022-04-27 11:41:28,911 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:41:28,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:41:28,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:41:28,913 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-27 11:41:28,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process